%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM425+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n041.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 : 9
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 6 unt; 0 def)
% Number of atoms : 30 ( 3 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 25 ( 10 ~; 4 |; 11 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 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 : 8 ( 0 sgn 2 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(9,axiom,
( ? [X1] :
( aInteger0(X1)
& equal(sdtasdt0(xq,X1),sdtpldt0(xa,smndt0(xb))) )
& aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xa,xb,xq) ),
file('/export/starexec/sandbox2/tmp/tmpbHYslt/sel_theBenchmark.p_1',m__724) ).
fof(12,conjecture,
? [X1] :
( aInteger0(X1)
& equal(sdtasdt0(xq,X1),sdtpldt0(xa,smndt0(xb))) ),
file('/export/starexec/sandbox2/tmp/tmpbHYslt/sel_theBenchmark.p_1',m__) ).
fof(24,negated_conjecture,
~ ? [X1] :
( aInteger0(X1)
& equal(sdtasdt0(xq,X1),sdtpldt0(xa,smndt0(xb))) ),
inference(assume_negation,[status(cth)],[12]) ).
fof(63,plain,
( ? [X2] :
( aInteger0(X2)
& equal(sdtasdt0(xq,X2),sdtpldt0(xa,smndt0(xb))) )
& aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xa,xb,xq) ),
inference(variable_rename,[status(thm)],[9]) ).
fof(64,plain,
( aInteger0(esk2_0)
& equal(sdtasdt0(xq,esk2_0),sdtpldt0(xa,smndt0(xb)))
& aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xa,xb,xq) ),
inference(skolemize,[status(esa)],[63]) ).
cnf(67,plain,
sdtasdt0(xq,esk2_0) = sdtpldt0(xa,smndt0(xb)),
inference(split_conjunct,[status(thm)],[64]) ).
cnf(68,plain,
aInteger0(esk2_0),
inference(split_conjunct,[status(thm)],[64]) ).
fof(75,negated_conjecture,
! [X1] :
( ~ aInteger0(X1)
| ~ equal(sdtasdt0(xq,X1),sdtpldt0(xa,smndt0(xb))) ),
inference(fof_nnf,[status(thm)],[24]) ).
fof(76,negated_conjecture,
! [X2] :
( ~ aInteger0(X2)
| ~ equal(sdtasdt0(xq,X2),sdtpldt0(xa,smndt0(xb))) ),
inference(variable_rename,[status(thm)],[75]) ).
cnf(77,negated_conjecture,
( sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[76]) ).
cnf(198,negated_conjecture,
( sdtasdt0(xq,esk2_0) != sdtasdt0(xq,X1)
| ~ aInteger0(X1) ),
inference(rw,[status(thm)],[77,67,theory(equality)]) ).
cnf(199,negated_conjecture,
~ aInteger0(esk2_0),
inference(er,[status(thm)],[198,theory(equality)]) ).
cnf(203,negated_conjecture,
$false,
inference(rw,[status(thm)],[199,68,theory(equality)]) ).
cnf(204,negated_conjecture,
$false,
inference(cn,[status(thm)],[203,theory(equality)]) ).
cnf(205,negated_conjecture,
$false,
204,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM425+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 : n041.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:14:15 CST 2018
% 0.03/0.23 % CPUTime :
% 0.03/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.28 --creating new selector for []
% 0.06/0.35 -running prover on /export/starexec/sandbox2/tmp/tmpbHYslt/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/tmpbHYslt/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.36 Solved 1 out of 1.
% 0.06/0.36 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.36 # SZS status Theorem
% 0.06/0.36 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.36 # SZS output end CNFRefutation
%------------------------------------------------------------------------------