TSTP Solution File: NUM533+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM533+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n040.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.625MB
% OS : Linux 3.10.0-693.2.2.el7.x86_64
% CPULimit : 300s
% DateTime : Mon Jan 8 15:21:41 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% Syntax : Number of formulae : 37 ( 9 unt; 0 def)
% Number of atoms : 136 ( 0 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 162 ( 63 ~; 72 |; 22 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 18 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(8,axiom,
( aSet0(xA)
& aSet0(xB)
& aSet0(xC) ),
file('/export/starexec/sandbox2/tmp/tmplOOrvp/sel_theBenchmark.p_1',m__522) ).
fof(9,conjecture,
( ( aSubsetOf0(xA,xB)
& aSubsetOf0(xB,xC) )
=> aSubsetOf0(xA,xC) ),
file('/export/starexec/sandbox2/tmp/tmplOOrvp/sel_theBenchmark.p_1',m__) ).
fof(11,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmplOOrvp/sel_theBenchmark.p_1',mDefSub) ).
fof(16,negated_conjecture,
~ ( ( aSubsetOf0(xA,xB)
& aSubsetOf0(xB,xC) )
=> aSubsetOf0(xA,xC) ),
inference(assume_negation,[status(cth)],[9]) ).
cnf(38,plain,
aSet0(xC),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(39,plain,
aSet0(xB),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(40,plain,
aSet0(xA),
inference(split_conjunct,[status(thm)],[8]) ).
fof(41,negated_conjecture,
( aSubsetOf0(xA,xB)
& aSubsetOf0(xB,xC)
& ~ aSubsetOf0(xA,xC) ),
inference(fof_nnf,[status(thm)],[16]) ).
cnf(42,negated_conjecture,
~ aSubsetOf0(xA,xC),
inference(split_conjunct,[status(thm)],[41]) ).
cnf(43,negated_conjecture,
aSubsetOf0(xB,xC),
inference(split_conjunct,[status(thm)],[41]) ).
cnf(44,negated_conjecture,
aSubsetOf0(xA,xB),
inference(split_conjunct,[status(thm)],[41]) ).
fof(48,plain,
! [X1] :
( ~ aSet0(X1)
| ! [X2] :
( ( ~ aSubsetOf0(X2,X1)
| ( aSet0(X2)
& ! [X3] :
( ~ aElementOf0(X3,X2)
| aElementOf0(X3,X1) ) ) )
& ( ~ aSet0(X2)
| ? [X3] :
( aElementOf0(X3,X2)
& ~ aElementOf0(X3,X1) )
| aSubsetOf0(X2,X1) ) ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(49,plain,
! [X4] :
( ~ aSet0(X4)
| ! [X5] :
( ( ~ aSubsetOf0(X5,X4)
| ( aSet0(X5)
& ! [X6] :
( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4) ) ) )
& ( ~ aSet0(X5)
| ? [X7] :
( aElementOf0(X7,X5)
& ~ aElementOf0(X7,X4) )
| aSubsetOf0(X5,X4) ) ) ),
inference(variable_rename,[status(thm)],[48]) ).
fof(50,plain,
! [X4] :
( ~ aSet0(X4)
| ! [X5] :
( ( ~ aSubsetOf0(X5,X4)
| ( aSet0(X5)
& ! [X6] :
( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4) ) ) )
& ( ~ aSet0(X5)
| ( aElementOf0(esk1_2(X4,X5),X5)
& ~ aElementOf0(esk1_2(X4,X5),X4) )
| aSubsetOf0(X5,X4) ) ) ),
inference(skolemize,[status(esa)],[49]) ).
fof(51,plain,
! [X4,X5,X6] :
( ( ( ( ( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4) )
& aSet0(X5) )
| ~ aSubsetOf0(X5,X4) )
& ( ~ aSet0(X5)
| ( aElementOf0(esk1_2(X4,X5),X5)
& ~ aElementOf0(esk1_2(X4,X5),X4) )
| aSubsetOf0(X5,X4) ) )
| ~ aSet0(X4) ),
inference(shift_quantors,[status(thm)],[50]) ).
fof(52,plain,
! [X4,X5,X6] :
( ( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( aSet0(X5)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( aElementOf0(esk1_2(X4,X5),X5)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( ~ aElementOf0(esk1_2(X4,X5),X4)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) ) ),
inference(distribute,[status(thm)],[51]) ).
cnf(53,plain,
( aSubsetOf0(X2,X1)
| ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[52]) ).
cnf(54,plain,
( aSubsetOf0(X2,X1)
| aElementOf0(esk1_2(X1,X2),X2)
| ~ aSet0(X1)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[52]) ).
cnf(56,plain,
( aElementOf0(X3,X1)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1)
| ~ aElementOf0(X3,X2) ),
inference(split_conjunct,[status(thm)],[52]) ).
cnf(94,negated_conjecture,
( aElementOf0(X1,xB)
| ~ aElementOf0(X1,xA)
| ~ aSet0(xB) ),
inference(spm,[status(thm)],[56,44,theory(equality)]) ).
cnf(95,negated_conjecture,
( aElementOf0(X1,xC)
| ~ aElementOf0(X1,xB)
| ~ aSet0(xC) ),
inference(spm,[status(thm)],[56,43,theory(equality)]) ).
cnf(97,negated_conjecture,
( aElementOf0(X1,xB)
| ~ aElementOf0(X1,xA)
| $false ),
inference(rw,[status(thm)],[94,39,theory(equality)]) ).
cnf(98,negated_conjecture,
( aElementOf0(X1,xB)
| ~ aElementOf0(X1,xA) ),
inference(cn,[status(thm)],[97,theory(equality)]) ).
cnf(99,negated_conjecture,
( aElementOf0(X1,xC)
| ~ aElementOf0(X1,xB)
| $false ),
inference(rw,[status(thm)],[95,38,theory(equality)]) ).
cnf(100,negated_conjecture,
( aElementOf0(X1,xC)
| ~ aElementOf0(X1,xB) ),
inference(cn,[status(thm)],[99,theory(equality)]) ).
cnf(135,negated_conjecture,
( aElementOf0(esk1_2(X1,xA),xB)
| aSubsetOf0(xA,X1)
| ~ aSet0(xA)
| ~ aSet0(X1) ),
inference(spm,[status(thm)],[98,54,theory(equality)]) ).
cnf(140,negated_conjecture,
( aElementOf0(esk1_2(X1,xA),xB)
| aSubsetOf0(xA,X1)
| $false
| ~ aSet0(X1) ),
inference(rw,[status(thm)],[135,40,theory(equality)]) ).
cnf(141,negated_conjecture,
( aElementOf0(esk1_2(X1,xA),xB)
| aSubsetOf0(xA,X1)
| ~ aSet0(X1) ),
inference(cn,[status(thm)],[140,theory(equality)]) ).
cnf(144,negated_conjecture,
( aSubsetOf0(X1,xC)
| ~ aSet0(X1)
| ~ aSet0(xC)
| ~ aElementOf0(esk1_2(xC,X1),xB) ),
inference(spm,[status(thm)],[53,100,theory(equality)]) ).
cnf(147,negated_conjecture,
( aSubsetOf0(X1,xC)
| ~ aSet0(X1)
| $false
| ~ aElementOf0(esk1_2(xC,X1),xB) ),
inference(rw,[status(thm)],[144,38,theory(equality)]) ).
cnf(148,negated_conjecture,
( aSubsetOf0(X1,xC)
| ~ aSet0(X1)
| ~ aElementOf0(esk1_2(xC,X1),xB) ),
inference(cn,[status(thm)],[147,theory(equality)]) ).
cnf(231,negated_conjecture,
( aSubsetOf0(xA,xC)
| ~ aSet0(xA)
| ~ aSet0(xC) ),
inference(spm,[status(thm)],[148,141,theory(equality)]) ).
cnf(236,negated_conjecture,
( aSubsetOf0(xA,xC)
| $false
| ~ aSet0(xC) ),
inference(rw,[status(thm)],[231,40,theory(equality)]) ).
cnf(237,negated_conjecture,
( aSubsetOf0(xA,xC)
| $false
| $false ),
inference(rw,[status(thm)],[236,38,theory(equality)]) ).
cnf(238,negated_conjecture,
aSubsetOf0(xA,xC),
inference(cn,[status(thm)],[237,theory(equality)]) ).
cnf(239,negated_conjecture,
$false,
inference(sr,[status(thm)],[238,42,theory(equality)]) ).
cnf(240,negated_conjecture,
$false,
239,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM533+1 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.22 % Computer : n040.star.cs.uiowa.edu
% 0.02/0.22 % Model : x86_64 x86_64
% 0.02/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.22 % Memory : 32218.625MB
% 0.02/0.22 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.22 % CPULimit : 300
% 0.02/0.22 % DateTime : Mon Jan 8 08:10:42 CST 2018
% 0.02/0.23 % CPUTime :
% 0.06/0.27 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.27 --creating new selector for []
% 0.06/0.33 -running prover on /export/starexec/sandbox2/tmp/tmplOOrvp/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.33 -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox2/tmp/tmplOOrvp/sel_theBenchmark.p_1']
% 0.06/0.33 -prover status Theorem
% 0.06/0.33 Problem theBenchmark.p solved in phase 0.
% 0.06/0.33 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.33 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.33 Solved 1 out of 1.
% 0.06/0.33 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.33 # SZS status Theorem
% 0.06/0.33 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.34 # SZS output end CNFRefutation
%------------------------------------------------------------------------------