TSTP Solution File: NUM427+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM427+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n135.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:18 EST 2018
% Result : Theorem 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 8 unt; 0 def)
% Number of atoms : 42 ( 3 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 44 ( 22 ~; 12 |; 9 &)
% ( 0 <=>; 1 =>; 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn 6 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(9,axiom,
( aInteger0(xn)
& equal(sdtasdt0(xq,xn),sdtpldt0(xa,smndt0(xb))) ),
file('/export/starexec/sandbox/tmp/tmp4xs0ES/sel_theBenchmark.p_1',m__747) ).
fof(13,conjecture,
( ? [X1] :
( aInteger0(X1)
& equal(sdtasdt0(xq,X1),sdtpldt0(xb,smndt0(xa))) )
| aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))
| sdteqdtlpzmzozddtrp0(xb,xa,xq) ),
file('/export/starexec/sandbox/tmp/tmp4xs0ES/sel_theBenchmark.p_1',m__) ).
fof(18,axiom,
! [X1] :
( aInteger0(X1)
=> aInteger0(smndt0(X1)) ),
file('/export/starexec/sandbox/tmp/tmp4xs0ES/sel_theBenchmark.p_1',mIntNeg) ).
fof(20,axiom,
equal(sdtasdt0(xq,smndt0(xn)),sdtpldt0(xb,smndt0(xa))),
file('/export/starexec/sandbox/tmp/tmp4xs0ES/sel_theBenchmark.p_1',m__767) ).
fof(26,negated_conjecture,
~ ( ? [X1] :
( aInteger0(X1)
& equal(sdtasdt0(xq,X1),sdtpldt0(xb,smndt0(xa))) )
| aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))
| sdteqdtlpzmzozddtrp0(xb,xa,xq) ),
inference(assume_negation,[status(cth)],[13]) ).
cnf(66,plain,
aInteger0(xn),
inference(split_conjunct,[status(thm)],[9]) ).
fof(79,negated_conjecture,
( ! [X1] :
( ~ aInteger0(X1)
| ~ equal(sdtasdt0(xq,X1),sdtpldt0(xb,smndt0(xa))) )
& ~ aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))
& ~ sdteqdtlpzmzozddtrp0(xb,xa,xq) ),
inference(fof_nnf,[status(thm)],[26]) ).
fof(80,negated_conjecture,
( ! [X2] :
( ~ aInteger0(X2)
| ~ equal(sdtasdt0(xq,X2),sdtpldt0(xb,smndt0(xa))) )
& ~ aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))
& ~ sdteqdtlpzmzozddtrp0(xb,xa,xq) ),
inference(variable_rename,[status(thm)],[79]) ).
fof(81,negated_conjecture,
! [X2] :
( ( ~ aInteger0(X2)
| ~ equal(sdtasdt0(xq,X2),sdtpldt0(xb,smndt0(xa))) )
& ~ aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))
& ~ sdteqdtlpzmzozddtrp0(xb,xa,xq) ),
inference(shift_quantors,[status(thm)],[80]) ).
cnf(84,negated_conjecture,
( sdtasdt0(xq,X1) != sdtpldt0(xb,smndt0(xa))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[81]) ).
fof(97,plain,
! [X1] :
( ~ aInteger0(X1)
| aInteger0(smndt0(X1)) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(98,plain,
! [X2] :
( ~ aInteger0(X2)
| aInteger0(smndt0(X2)) ),
inference(variable_rename,[status(thm)],[97]) ).
cnf(99,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[98]) ).
cnf(101,plain,
sdtasdt0(xq,smndt0(xn)) = sdtpldt0(xb,smndt0(xa)),
inference(split_conjunct,[status(thm)],[20]) ).
cnf(223,negated_conjecture,
( sdtasdt0(xq,smndt0(xn)) != sdtasdt0(xq,X1)
| ~ aInteger0(X1) ),
inference(rw,[status(thm)],[84,101,theory(equality)]) ).
cnf(224,negated_conjecture,
~ aInteger0(smndt0(xn)),
inference(er,[status(thm)],[223,theory(equality)]) ).
cnf(447,negated_conjecture,
~ aInteger0(xn),
inference(spm,[status(thm)],[224,99,theory(equality)]) ).
cnf(448,negated_conjecture,
$false,
inference(rw,[status(thm)],[447,66,theory(equality)]) ).
cnf(449,negated_conjecture,
$false,
inference(cn,[status(thm)],[448,theory(equality)]) ).
cnf(450,negated_conjecture,
$false,
449,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM427+3 : 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 : n135.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 03:18:00 CST 2018
% 0.03/0.23 % CPUTime :
% 0.07/0.27 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.27 --creating new selector for []
% 0.07/0.35 -running prover on /export/starexec/sandbox/tmp/tmp4xs0ES/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.35 -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox/tmp/tmp4xs0ES/sel_theBenchmark.p_1']
% 0.07/0.35 -prover status Theorem
% 0.07/0.35 Problem theBenchmark.p solved in phase 0.
% 0.07/0.35 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.35 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.35 Solved 1 out of 1.
% 0.07/0.35 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.35 # SZS status Theorem
% 0.07/0.35 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.35 # SZS output end CNFRefutation
%------------------------------------------------------------------------------