TSTP Solution File: NUM555+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM555+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n038.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:46 EST 2018
% Result : Theorem 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 12 unt; 0 def)
% Number of atoms : 183 ( 1 equ)
% Maximal formula atoms : 52 ( 7 avg)
% Number of connectives : 260 ( 102 ~; 108 |; 47 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 33 ( 0 sgn 24 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(9,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aElement0(X2) )
=> ! [X3] :
( equal(X3,sdtmndt0(X1,X2))
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aElement0(X4)
& aElementOf0(X4,X1)
& ~ equal(X4,X2) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp6UEu3H/sel_theBenchmark.p_1',mDefDiff) ).
fof(26,axiom,
~ aElementOf0(xx,xQ),
file('/export/starexec/sandbox2/tmp/tmp6UEu3H/sel_theBenchmark.p_1',m__2338) ).
fof(45,axiom,
( aElement0(xy)
& aElementOf0(xy,xQ) ),
file('/export/starexec/sandbox2/tmp/tmp6UEu3H/sel_theBenchmark.p_1',m__2304) ).
fof(46,conjecture,
~ aElementOf0(xx,sdtmndt0(xQ,xy)),
file('/export/starexec/sandbox2/tmp/tmp6UEu3H/sel_theBenchmark.p_1',m__) ).
fof(51,axiom,
( aSet0(xQ)
& isFinite0(xQ)
& equal(sbrdtbr0(xQ),xk) ),
file('/export/starexec/sandbox2/tmp/tmp6UEu3H/sel_theBenchmark.p_1',m__2291) ).
fof(72,negated_conjecture,
~ ~ aElementOf0(xx,sdtmndt0(xQ,xy)),
inference(assume_negation,[status(cth)],[46]) ).
fof(76,plain,
~ aElementOf0(xx,xQ),
inference(fof_simplification,[status(thm)],[26,theory(equality)]) ).
fof(78,negated_conjecture,
aElementOf0(xx,sdtmndt0(xQ,xy)),
inference(fof_simplification,[status(thm)],[72,theory(equality)]) ).
fof(105,plain,
! [X1,X2] :
( ~ aSet0(X1)
| ~ aElement0(X2)
| ! [X3] :
( ( ~ equal(X3,sdtmndt0(X1,X2))
| ( aSet0(X3)
& ! [X4] :
( ( ~ aElementOf0(X4,X3)
| ( aElement0(X4)
& aElementOf0(X4,X1)
& ~ equal(X4,X2) ) )
& ( ~ aElement0(X4)
| ~ aElementOf0(X4,X1)
| equal(X4,X2)
| aElementOf0(X4,X3) ) ) ) )
& ( ~ aSet0(X3)
| ? [X4] :
( ( ~ aElementOf0(X4,X3)
| ~ aElement0(X4)
| ~ aElementOf0(X4,X1)
| equal(X4,X2) )
& ( aElementOf0(X4,X3)
| ( aElement0(X4)
& aElementOf0(X4,X1)
& ~ equal(X4,X2) ) ) )
| equal(X3,sdtmndt0(X1,X2)) ) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(106,plain,
! [X5,X6] :
( ~ aSet0(X5)
| ~ aElement0(X6)
| ! [X7] :
( ( ~ equal(X7,sdtmndt0(X5,X6))
| ( aSet0(X7)
& ! [X8] :
( ( ~ aElementOf0(X8,X7)
| ( aElement0(X8)
& aElementOf0(X8,X5)
& ~ equal(X8,X6) ) )
& ( ~ aElement0(X8)
| ~ aElementOf0(X8,X5)
| equal(X8,X6)
| aElementOf0(X8,X7) ) ) ) )
& ( ~ aSet0(X7)
| ? [X9] :
( ( ~ aElementOf0(X9,X7)
| ~ aElement0(X9)
| ~ aElementOf0(X9,X5)
| equal(X9,X6) )
& ( aElementOf0(X9,X7)
| ( aElement0(X9)
& aElementOf0(X9,X5)
& ~ equal(X9,X6) ) ) )
| equal(X7,sdtmndt0(X5,X6)) ) ) ),
inference(variable_rename,[status(thm)],[105]) ).
fof(107,plain,
! [X5,X6] :
( ~ aSet0(X5)
| ~ aElement0(X6)
| ! [X7] :
( ( ~ equal(X7,sdtmndt0(X5,X6))
| ( aSet0(X7)
& ! [X8] :
( ( ~ aElementOf0(X8,X7)
| ( aElement0(X8)
& aElementOf0(X8,X5)
& ~ equal(X8,X6) ) )
& ( ~ aElement0(X8)
| ~ aElementOf0(X8,X5)
| equal(X8,X6)
| aElementOf0(X8,X7) ) ) ) )
& ( ~ aSet0(X7)
| ( ( ~ aElementOf0(esk2_3(X5,X6,X7),X7)
| ~ aElement0(esk2_3(X5,X6,X7))
| ~ aElementOf0(esk2_3(X5,X6,X7),X5)
| equal(esk2_3(X5,X6,X7),X6) )
& ( aElementOf0(esk2_3(X5,X6,X7),X7)
| ( aElement0(esk2_3(X5,X6,X7))
& aElementOf0(esk2_3(X5,X6,X7),X5)
& ~ equal(esk2_3(X5,X6,X7),X6) ) ) )
| equal(X7,sdtmndt0(X5,X6)) ) ) ),
inference(skolemize,[status(esa)],[106]) ).
fof(108,plain,
! [X5,X6,X7,X8] :
( ( ( ( ( ~ aElementOf0(X8,X7)
| ( aElement0(X8)
& aElementOf0(X8,X5)
& ~ equal(X8,X6) ) )
& ( ~ aElement0(X8)
| ~ aElementOf0(X8,X5)
| equal(X8,X6)
| aElementOf0(X8,X7) )
& aSet0(X7) )
| ~ equal(X7,sdtmndt0(X5,X6)) )
& ( ~ aSet0(X7)
| ( ( ~ aElementOf0(esk2_3(X5,X6,X7),X7)
| ~ aElement0(esk2_3(X5,X6,X7))
| ~ aElementOf0(esk2_3(X5,X6,X7),X5)
| equal(esk2_3(X5,X6,X7),X6) )
& ( aElementOf0(esk2_3(X5,X6,X7),X7)
| ( aElement0(esk2_3(X5,X6,X7))
& aElementOf0(esk2_3(X5,X6,X7),X5)
& ~ equal(esk2_3(X5,X6,X7),X6) ) ) )
| equal(X7,sdtmndt0(X5,X6)) ) )
| ~ aSet0(X5)
| ~ aElement0(X6) ),
inference(shift_quantors,[status(thm)],[107]) ).
fof(109,plain,
! [X5,X6,X7,X8] :
( ( aElement0(X8)
| ~ aElementOf0(X8,X7)
| ~ equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( aElementOf0(X8,X5)
| ~ aElementOf0(X8,X7)
| ~ equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( ~ equal(X8,X6)
| ~ aElementOf0(X8,X7)
| ~ equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( ~ aElement0(X8)
| ~ aElementOf0(X8,X5)
| equal(X8,X6)
| aElementOf0(X8,X7)
| ~ equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( aSet0(X7)
| ~ equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( ~ aElementOf0(esk2_3(X5,X6,X7),X7)
| ~ aElement0(esk2_3(X5,X6,X7))
| ~ aElementOf0(esk2_3(X5,X6,X7),X5)
| equal(esk2_3(X5,X6,X7),X6)
| ~ aSet0(X7)
| equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( aElement0(esk2_3(X5,X6,X7))
| aElementOf0(esk2_3(X5,X6,X7),X7)
| ~ aSet0(X7)
| equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( aElementOf0(esk2_3(X5,X6,X7),X5)
| aElementOf0(esk2_3(X5,X6,X7),X7)
| ~ aSet0(X7)
| equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) )
& ( ~ equal(esk2_3(X5,X6,X7),X6)
| aElementOf0(esk2_3(X5,X6,X7),X7)
| ~ aSet0(X7)
| equal(X7,sdtmndt0(X5,X6))
| ~ aSet0(X5)
| ~ aElement0(X6) ) ),
inference(distribute,[status(thm)],[108]) ).
cnf(117,plain,
( aElementOf0(X4,X2)
| ~ aElement0(X1)
| ~ aSet0(X2)
| X3 != sdtmndt0(X2,X1)
| ~ aElementOf0(X4,X3) ),
inference(split_conjunct,[status(thm)],[109]) ).
cnf(187,plain,
~ aElementOf0(xx,xQ),
inference(split_conjunct,[status(thm)],[76]) ).
cnf(273,plain,
aElement0(xy),
inference(split_conjunct,[status(thm)],[45]) ).
cnf(274,negated_conjecture,
aElementOf0(xx,sdtmndt0(xQ,xy)),
inference(split_conjunct,[status(thm)],[78]) ).
cnf(289,plain,
aSet0(xQ),
inference(split_conjunct,[status(thm)],[51]) ).
cnf(509,plain,
( aElementOf0(X1,X2)
| ~ aElement0(X3)
| ~ aElementOf0(X1,sdtmndt0(X2,X3))
| ~ aSet0(X2) ),
inference(er,[status(thm)],[117,theory(equality)]) ).
cnf(1060,negated_conjecture,
( aElementOf0(xx,xQ)
| ~ aElement0(xy)
| ~ aSet0(xQ) ),
inference(spm,[status(thm)],[509,274,theory(equality)]) ).
cnf(1067,negated_conjecture,
( aElementOf0(xx,xQ)
| $false
| ~ aSet0(xQ) ),
inference(rw,[status(thm)],[1060,273,theory(equality)]) ).
cnf(1068,negated_conjecture,
( aElementOf0(xx,xQ)
| $false
| $false ),
inference(rw,[status(thm)],[1067,289,theory(equality)]) ).
cnf(1069,negated_conjecture,
aElementOf0(xx,xQ),
inference(cn,[status(thm)],[1068,theory(equality)]) ).
cnf(1070,negated_conjecture,
$false,
inference(sr,[status(thm)],[1069,187,theory(equality)]) ).
cnf(1071,negated_conjecture,
$false,
1070,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM555+1 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.23 % Computer : n038.star.cs.uiowa.edu
% 0.03/0.23 % Model : x86_64 x86_64
% 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.23 % Memory : 32218.625MB
% 0.03/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.23 % CPULimit : 300
% 0.03/0.23 % DateTime : Fri Jan 5 08:47:45 CST 2018
% 0.03/0.24 % CPUTime :
% 0.07/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.28 --creating new selector for []
% 0.07/0.38 -running prover on /export/starexec/sandbox2/tmp/tmp6UEu3H/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.38 -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/tmp6UEu3H/sel_theBenchmark.p_1']
% 0.07/0.38 -prover status Theorem
% 0.07/0.38 Problem theBenchmark.p solved in phase 0.
% 0.07/0.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.38 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.38 Solved 1 out of 1.
% 0.07/0.38 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.38 # SZS status Theorem
% 0.07/0.38 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.38 # SZS output end CNFRefutation
%------------------------------------------------------------------------------