TSTP Solution File: NUM837+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM837+2 : TPTP v7.0.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n107.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:27 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 10 unt; 0 def)
% Number of atoms : 40 ( 3 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 37 ( 18 ~; 13 |; 4 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 33 ( 1 sgn 22 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
less(vd268,vd269),
file('/export/starexec/sandbox/tmp/tmpnE3P36/sel_theBenchmark.p_1','holds(conjunct1(170), 270, 0)') ).
fof(4,axiom,
! [X4,X5] :
( less(X4,X5)
=> greater(X5,X4) ),
file('/export/starexec/sandbox/tmp/tmpnE3P36/sel_theBenchmark.p_1','ass(cond(147, 0), 0)') ).
fof(11,conjecture,
? [X20] : equal(vd269,vplus(vd268,X20)),
file('/export/starexec/sandbox/tmp/tmpnE3P36/sel_theBenchmark.p_1','qe(171)') ).
fof(12,axiom,
! [X21,X22] :
( greater(X22,X21)
<=> ? [X23] : equal(X22,vplus(X21,X23)) ),
file('/export/starexec/sandbox/tmp/tmpnE3P36/sel_theBenchmark.p_1','def(cond(conseq(axiom(3)), 11), 1)') ).
fof(14,negated_conjecture,
~ ? [X20] : equal(vd269,vplus(vd268,X20)),
inference(assume_negation,[status(cth)],[11]) ).
cnf(16,plain,
less(vd268,vd269),
inference(split_conjunct,[status(thm)],[1]) ).
fof(20,plain,
! [X4,X5] :
( ~ less(X4,X5)
| greater(X5,X4) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(21,plain,
! [X6,X7] :
( ~ less(X6,X7)
| greater(X7,X6) ),
inference(variable_rename,[status(thm)],[20]) ).
cnf(22,plain,
( greater(X1,X2)
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[21]) ).
fof(42,negated_conjecture,
! [X20] : ~ equal(vd269,vplus(vd268,X20)),
inference(fof_nnf,[status(thm)],[14]) ).
fof(43,negated_conjecture,
! [X21] : ~ equal(vd269,vplus(vd268,X21)),
inference(variable_rename,[status(thm)],[42]) ).
cnf(44,negated_conjecture,
vd269 != vplus(vd268,X1),
inference(split_conjunct,[status(thm)],[43]) ).
fof(45,plain,
! [X21,X22] :
( ( ~ greater(X22,X21)
| ? [X23] : equal(X22,vplus(X21,X23)) )
& ( ! [X23] : ~ equal(X22,vplus(X21,X23))
| greater(X22,X21) ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(46,plain,
! [X24,X25] :
( ( ~ greater(X25,X24)
| ? [X26] : equal(X25,vplus(X24,X26)) )
& ( ! [X27] : ~ equal(X25,vplus(X24,X27))
| greater(X25,X24) ) ),
inference(variable_rename,[status(thm)],[45]) ).
fof(47,plain,
! [X24,X25] :
( ( ~ greater(X25,X24)
| equal(X25,vplus(X24,esk1_2(X24,X25))) )
& ( ! [X27] : ~ equal(X25,vplus(X24,X27))
| greater(X25,X24) ) ),
inference(skolemize,[status(esa)],[46]) ).
fof(48,plain,
! [X24,X25,X27] :
( ( ~ equal(X25,vplus(X24,X27))
| greater(X25,X24) )
& ( ~ greater(X25,X24)
| equal(X25,vplus(X24,esk1_2(X24,X25))) ) ),
inference(shift_quantors,[status(thm)],[47]) ).
cnf(49,plain,
( X1 = vplus(X2,esk1_2(X2,X1))
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[48]) ).
cnf(72,plain,
greater(vd269,vd268),
inference(spm,[status(thm)],[22,16,theory(equality)]) ).
cnf(78,negated_conjecture,
( X1 != vd269
| ~ greater(X1,vd268) ),
inference(spm,[status(thm)],[44,49,theory(equality)]) ).
cnf(86,negated_conjecture,
$false,
inference(spm,[status(thm)],[78,72,theory(equality)]) ).
cnf(87,negated_conjecture,
$false,
86,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM837+2 : 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 : n107.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:38:35 CST 2018
% 0.03/0.23 % CPUTime :
% 0.03/0.28 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.28 --creating new selector for []
% 0.06/0.35 -running prover on /export/starexec/sandbox/tmp/tmpnE3P36/sel_theBenchmark.p_1 with time limit 29
% 0.06/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/tmpnE3P36/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/sandbox/benchmark/theBenchmark.p
% 0.06/0.35 % SZS status Ended for /export/starexec/sandbox/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
%------------------------------------------------------------------------------