TSTP Solution File: NUM423+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM423+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n119.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:17 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 6 unt; 0 def)
% Number of atoms : 75 ( 6 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 82 ( 36 ~; 26 |; 18 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn 11 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(5,axiom,
aInteger0(sz00),
file('/export/starexec/sandbox2/tmp/tmpZcmOst/sel_theBenchmark.p_1',mIntZero) ).
fof(9,axiom,
! [X1] :
( aInteger0(X1)
=> ( equal(sdtasdt0(X1,sz00),sz00)
& equal(sz00,sdtasdt0(sz00,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmpZcmOst/sel_theBenchmark.p_1',mMulZero) ).
fof(16,axiom,
! [X1] :
( aInteger0(X1)
=> ( equal(sdtpldt0(X1,smndt0(X1)),sz00)
& equal(sz00,sdtpldt0(smndt0(X1),X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmpZcmOst/sel_theBenchmark.p_1',mAddNeg) ).
fof(20,conjecture,
( ? [X1] :
( aInteger0(X1)
& equal(sdtasdt0(xq,X1),sdtpldt0(xa,smndt0(xa))) )
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa)))
| sdteqdtlpzmzozddtrp0(xa,xa,xq) ),
file('/export/starexec/sandbox2/tmp/tmpZcmOst/sel_theBenchmark.p_1',m__) ).
fof(21,axiom,
( aInteger0(xa)
& aInteger0(xq)
& ~ equal(xq,sz00) ),
file('/export/starexec/sandbox2/tmp/tmpZcmOst/sel_theBenchmark.p_1',m__671) ).
fof(22,negated_conjecture,
~ ( ? [X1] :
( aInteger0(X1)
& equal(sdtasdt0(xq,X1),sdtpldt0(xa,smndt0(xa))) )
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa)))
| sdteqdtlpzmzozddtrp0(xa,xa,xq) ),
inference(assume_negation,[status(cth)],[20]) ).
cnf(39,plain,
aInteger0(sz00),
inference(split_conjunct,[status(thm)],[5]) ).
fof(58,plain,
! [X1] :
( ~ aInteger0(X1)
| ( equal(sdtasdt0(X1,sz00),sz00)
& equal(sz00,sdtasdt0(sz00,X1)) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(59,plain,
! [X2] :
( ~ aInteger0(X2)
| ( equal(sdtasdt0(X2,sz00),sz00)
& equal(sz00,sdtasdt0(sz00,X2)) ) ),
inference(variable_rename,[status(thm)],[58]) ).
fof(60,plain,
! [X2] :
( ( equal(sdtasdt0(X2,sz00),sz00)
| ~ aInteger0(X2) )
& ( equal(sz00,sdtasdt0(sz00,X2))
| ~ aInteger0(X2) ) ),
inference(distribute,[status(thm)],[59]) ).
cnf(62,plain,
( sdtasdt0(X1,sz00) = sz00
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[60]) ).
fof(83,plain,
! [X1] :
( ~ aInteger0(X1)
| ( equal(sdtpldt0(X1,smndt0(X1)),sz00)
& equal(sz00,sdtpldt0(smndt0(X1),X1)) ) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(84,plain,
! [X2] :
( ~ aInteger0(X2)
| ( equal(sdtpldt0(X2,smndt0(X2)),sz00)
& equal(sz00,sdtpldt0(smndt0(X2),X2)) ) ),
inference(variable_rename,[status(thm)],[83]) ).
fof(85,plain,
! [X2] :
( ( equal(sdtpldt0(X2,smndt0(X2)),sz00)
| ~ aInteger0(X2) )
& ( equal(sz00,sdtpldt0(smndt0(X2),X2))
| ~ aInteger0(X2) ) ),
inference(distribute,[status(thm)],[84]) ).
cnf(87,plain,
( sdtpldt0(X1,smndt0(X1)) = sz00
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[85]) ).
fof(97,negated_conjecture,
( ! [X1] :
( ~ aInteger0(X1)
| ~ equal(sdtasdt0(xq,X1),sdtpldt0(xa,smndt0(xa))) )
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa)))
& ~ sdteqdtlpzmzozddtrp0(xa,xa,xq) ),
inference(fof_nnf,[status(thm)],[22]) ).
fof(98,negated_conjecture,
( ! [X2] :
( ~ aInteger0(X2)
| ~ equal(sdtasdt0(xq,X2),sdtpldt0(xa,smndt0(xa))) )
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa)))
& ~ sdteqdtlpzmzozddtrp0(xa,xa,xq) ),
inference(variable_rename,[status(thm)],[97]) ).
fof(99,negated_conjecture,
! [X2] :
( ( ~ aInteger0(X2)
| ~ equal(sdtasdt0(xq,X2),sdtpldt0(xa,smndt0(xa))) )
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa)))
& ~ sdteqdtlpzmzozddtrp0(xa,xa,xq) ),
inference(shift_quantors,[status(thm)],[98]) ).
cnf(102,negated_conjecture,
( sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xa))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[99]) ).
cnf(104,plain,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(105,plain,
aInteger0(xa),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(127,negated_conjecture,
( sz00 != sdtasdt0(xq,X1)
| ~ aInteger0(X1)
| ~ aInteger0(xa) ),
inference(spm,[status(thm)],[102,87,theory(equality)]) ).
cnf(132,negated_conjecture,
( sz00 != sdtasdt0(xq,X1)
| ~ aInteger0(X1)
| $false ),
inference(rw,[status(thm)],[127,105,theory(equality)]) ).
cnf(133,negated_conjecture,
( sz00 != sdtasdt0(xq,X1)
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[132,theory(equality)]) ).
cnf(404,negated_conjecture,
( ~ aInteger0(sz00)
| ~ aInteger0(xq) ),
inference(spm,[status(thm)],[133,62,theory(equality)]) ).
cnf(410,negated_conjecture,
( $false
| ~ aInteger0(xq) ),
inference(rw,[status(thm)],[404,39,theory(equality)]) ).
cnf(411,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[410,104,theory(equality)]) ).
cnf(412,negated_conjecture,
$false,
inference(cn,[status(thm)],[411,theory(equality)]) ).
cnf(413,negated_conjecture,
$false,
412,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM423+3 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n119.star.cs.uiowa.edu
% 0.02/0.23 % Model : x86_64 x86_64
% 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23 % Memory : 32218.625MB
% 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Fri Jan 5 03:11:15 CST 2018
% 0.02/0.23 % CPUTime :
% 0.02/0.27 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.27 --creating new selector for []
% 0.06/0.35 -running prover on /export/starexec/sandbox2/tmp/tmpZcmOst/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.35 -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/tmpZcmOst/sel_theBenchmark.p_1']
% 0.06/0.35 -prover status Theorem
% 0.06/0.35 Problem theBenchmark.p solved in phase 0.
% 0.06/0.35 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.35 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.35 Solved 1 out of 1.
% 0.06/0.35 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.35 # SZS status Theorem
% 0.06/0.35 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.36 # SZS output end CNFRefutation
%------------------------------------------------------------------------------