TSTP Solution File: NUM850+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM850+1 : TPTP v7.0.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n131.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:22:30 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 9 unt; 0 def)
% Number of atoms : 31 ( 3 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 30 ( 15 ~; 10 |; 4 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 25 ( 1 sgn 16 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(15,axiom,
! [X30,X31] :
( greater(X31,X30)
<=> ? [X32] : equal(X31,vplus(X30,X32)) ),
file('/export/starexec/sandbox2/tmp/tmphtvIJk/sel_theBenchmark.p_1','def(cond(conseq(axiom(3)), 11), 1)') ).
fof(23,axiom,
greater(vd470,vd471),
file('/export/starexec/sandbox2/tmp/tmphtvIJk/sel_theBenchmark.p_1','holds(antec(302), 472, 0)') ).
fof(38,conjecture,
? [X84] : equal(vd470,vplus(vd471,X84)),
file('/export/starexec/sandbox2/tmp/tmphtvIJk/sel_theBenchmark.p_1','qe(conseq_conjunct1(conseq(302)))') ).
fof(39,negated_conjecture,
~ ? [X84] : equal(vd470,vplus(vd471,X84)),
inference(assume_negation,[status(cth)],[38]) ).
fof(77,plain,
! [X30,X31] :
( ( ~ greater(X31,X30)
| ? [X32] : equal(X31,vplus(X30,X32)) )
& ( ! [X32] : ~ equal(X31,vplus(X30,X32))
| greater(X31,X30) ) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(78,plain,
! [X33,X34] :
( ( ~ greater(X34,X33)
| ? [X35] : equal(X34,vplus(X33,X35)) )
& ( ! [X36] : ~ equal(X34,vplus(X33,X36))
| greater(X34,X33) ) ),
inference(variable_rename,[status(thm)],[77]) ).
fof(79,plain,
! [X33,X34] :
( ( ~ greater(X34,X33)
| equal(X34,vplus(X33,esk1_2(X33,X34))) )
& ( ! [X36] : ~ equal(X34,vplus(X33,X36))
| greater(X34,X33) ) ),
inference(skolemize,[status(esa)],[78]) ).
fof(80,plain,
! [X33,X34,X36] :
( ( ~ equal(X34,vplus(X33,X36))
| greater(X34,X33) )
& ( ~ greater(X34,X33)
| equal(X34,vplus(X33,esk1_2(X33,X34))) ) ),
inference(shift_quantors,[status(thm)],[79]) ).
cnf(81,plain,
( X1 = vplus(X2,esk1_2(X2,X1))
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[80]) ).
cnf(102,plain,
greater(vd470,vd471),
inference(split_conjunct,[status(thm)],[23]) ).
fof(144,negated_conjecture,
! [X84] : ~ equal(vd470,vplus(vd471,X84)),
inference(fof_nnf,[status(thm)],[39]) ).
fof(145,negated_conjecture,
! [X85] : ~ equal(vd470,vplus(vd471,X85)),
inference(variable_rename,[status(thm)],[144]) ).
cnf(146,negated_conjecture,
vd470 != vplus(vd471,X1),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(241,negated_conjecture,
( X1 != vd470
| ~ greater(X1,vd471) ),
inference(spm,[status(thm)],[146,81,theory(equality)]) ).
cnf(519,negated_conjecture,
$false,
inference(spm,[status(thm)],[241,102,theory(equality)]) ).
cnf(522,negated_conjecture,
$false,
519,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM850+1 : TPTP v7.0.0. Released v4.1.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.23 % Computer : n131.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 14:49:34 CST 2018
% 0.03/0.23 % CPUTime :
% 0.03/0.27 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.27 --creating new selector for []
% 0.06/0.35 -running prover on /export/starexec/sandbox2/tmp/tmphtvIJk/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/tmphtvIJk/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
%------------------------------------------------------------------------------