TSTP Solution File: NUM841+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM841+2 : TPTP v7.0.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n096.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:28 EST 2018
% Result : Theorem 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 9
% Syntax : Number of formulae : 52 ( 28 unt; 0 def)
% Number of atoms : 86 ( 6 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 67 ( 33 ~; 27 |; 4 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 93 ( 10 sgn 42 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
greater(vplus(vd344,vd347),vplus(vd345,vd348)),
file('/export/starexec/sandbox/tmp/tmpzScfB_/sel_theBenchmark.p_1','holds(214, 352, 0)') ).
fof(5,axiom,
greater(vplus(vd344,vd347),vplus(vd345,vd347)),
file('/export/starexec/sandbox/tmp/tmpzScfB_/sel_theBenchmark.p_1','holds(212, 350, 0)') ).
fof(6,axiom,
equal(vplus(vd345,vd347),vplus(vd347,vd345)),
file('/export/starexec/sandbox/tmp/tmpzScfB_/sel_theBenchmark.p_1','holds(213, 351, 0)') ).
fof(10,axiom,
! [X10,X11,X12] :
( greater(X10,X11)
=> greater(vplus(X10,X12),vplus(X11,X12)) ),
file('/export/starexec/sandbox/tmp/tmpzScfB_/sel_theBenchmark.p_1','ass(cond(goal(193), 0), 2)') ).
fof(14,axiom,
! [X19,X20,X21] : equal(vplus(vplus(X19,X20),X21),vplus(X19,vplus(X20,X21))),
file('/export/starexec/sandbox/tmp/tmpzScfB_/sel_theBenchmark.p_1','ass(cond(33, 0), 0)') ).
fof(15,axiom,
greater(vd347,vd348),
file('/export/starexec/sandbox/tmp/tmpzScfB_/sel_theBenchmark.p_1','holds(conjunct2(211), 349, 0)') ).
fof(16,axiom,
! [X22,X23] :
( greater(X23,X22)
<=> ? [X24] : equal(X23,vplus(X22,X24)) ),
file('/export/starexec/sandbox/tmp/tmpzScfB_/sel_theBenchmark.p_1','def(cond(conseq(axiom(3)), 11), 1)') ).
fof(17,axiom,
! [X25,X26,X27] :
( greater(vplus(X25,X27),vplus(X26,X27))
=> greater(X25,X26) ),
file('/export/starexec/sandbox/tmp/tmpzScfB_/sel_theBenchmark.p_1','ass(cond(goal(202), 0), 2)') ).
fof(18,axiom,
! [X28,X29] : equal(vplus(X29,X28),vplus(X28,X29)),
file('/export/starexec/sandbox/tmp/tmpzScfB_/sel_theBenchmark.p_1','ass(cond(61, 0), 0)') ).
fof(20,negated_conjecture,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
inference(assume_negation,[status(cth)],[1]) ).
fof(21,negated_conjecture,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
inference(fof_simplification,[status(thm)],[20,theory(equality)]) ).
cnf(23,negated_conjecture,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(32,plain,
greater(vplus(vd344,vd347),vplus(vd345,vd347)),
inference(split_conjunct,[status(thm)],[5]) ).
cnf(33,plain,
vplus(vd345,vd347) = vplus(vd347,vd345),
inference(split_conjunct,[status(thm)],[6]) ).
fof(40,plain,
! [X10,X11,X12] :
( ~ greater(X10,X11)
| greater(vplus(X10,X12),vplus(X11,X12)) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(41,plain,
! [X13,X14,X15] :
( ~ greater(X13,X14)
| greater(vplus(X13,X15),vplus(X14,X15)) ),
inference(variable_rename,[status(thm)],[40]) ).
cnf(42,plain,
( greater(vplus(X1,X2),vplus(X3,X2))
| ~ greater(X1,X3) ),
inference(split_conjunct,[status(thm)],[41]) ).
fof(51,plain,
! [X22,X23,X24] : equal(vplus(vplus(X22,X23),X24),vplus(X22,vplus(X23,X24))),
inference(variable_rename,[status(thm)],[14]) ).
cnf(52,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
inference(split_conjunct,[status(thm)],[51]) ).
cnf(53,plain,
greater(vd347,vd348),
inference(split_conjunct,[status(thm)],[15]) ).
fof(54,plain,
! [X22,X23] :
( ( ~ greater(X23,X22)
| ? [X24] : equal(X23,vplus(X22,X24)) )
& ( ! [X24] : ~ equal(X23,vplus(X22,X24))
| greater(X23,X22) ) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(55,plain,
! [X25,X26] :
( ( ~ greater(X26,X25)
| ? [X27] : equal(X26,vplus(X25,X27)) )
& ( ! [X28] : ~ equal(X26,vplus(X25,X28))
| greater(X26,X25) ) ),
inference(variable_rename,[status(thm)],[54]) ).
fof(56,plain,
! [X25,X26] :
( ( ~ greater(X26,X25)
| equal(X26,vplus(X25,esk1_2(X25,X26))) )
& ( ! [X28] : ~ equal(X26,vplus(X25,X28))
| greater(X26,X25) ) ),
inference(skolemize,[status(esa)],[55]) ).
fof(57,plain,
! [X25,X26,X28] :
( ( ~ equal(X26,vplus(X25,X28))
| greater(X26,X25) )
& ( ~ greater(X26,X25)
| equal(X26,vplus(X25,esk1_2(X25,X26))) ) ),
inference(shift_quantors,[status(thm)],[56]) ).
cnf(58,plain,
( X1 = vplus(X2,esk1_2(X2,X1))
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[57]) ).
cnf(59,plain,
( greater(X1,X2)
| X1 != vplus(X2,X3) ),
inference(split_conjunct,[status(thm)],[57]) ).
fof(60,plain,
! [X25,X26,X27] :
( ~ greater(vplus(X25,X27),vplus(X26,X27))
| greater(X25,X26) ),
inference(fof_nnf,[status(thm)],[17]) ).
fof(61,plain,
! [X28,X29,X30] :
( ~ greater(vplus(X28,X30),vplus(X29,X30))
| greater(X28,X29) ),
inference(variable_rename,[status(thm)],[60]) ).
cnf(62,plain,
( greater(X1,X2)
| ~ greater(vplus(X1,X3),vplus(X2,X3)) ),
inference(split_conjunct,[status(thm)],[61]) ).
fof(63,plain,
! [X30,X31] : equal(vplus(X31,X30),vplus(X30,X31)),
inference(variable_rename,[status(thm)],[18]) ).
cnf(64,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[63]) ).
cnf(73,plain,
greater(vplus(vd344,vd347),vplus(vd347,vd345)),
inference(rw,[status(thm)],[32,33,theory(equality)]) ).
cnf(78,plain,
greater(vplus(vd347,vd344),vplus(vd347,vd345)),
inference(rw,[status(thm)],[73,64,theory(equality)]) ).
cnf(84,plain,
( greater(X1,X2)
| vplus(X3,X2) != X1 ),
inference(spm,[status(thm)],[59,64,theory(equality)]) ).
cnf(88,negated_conjecture,
~ greater(vplus(vd347,vd344),vplus(vd345,vd348)),
inference(rw,[status(thm)],[23,64,theory(equality)]) ).
cnf(91,plain,
( greater(vplus(X1,X2),vplus(X2,X3))
| ~ greater(X1,X3) ),
inference(spm,[status(thm)],[42,64,theory(equality)]) ).
cnf(97,plain,
( greater(X1,X2)
| ~ greater(vplus(X3,X1),vplus(X2,X3)) ),
inference(spm,[status(thm)],[62,64,theory(equality)]) ).
cnf(149,plain,
greater(vplus(X1,X2),X2),
inference(er,[status(thm)],[84,theory(equality)]) ).
cnf(162,plain,
greater(vplus(X1,vplus(X2,X3)),X3),
inference(spm,[status(thm)],[149,52,theory(equality)]) ).
cnf(207,plain,
greater(vplus(X1,vplus(X3,X2)),X3),
inference(spm,[status(thm)],[162,64,theory(equality)]) ).
cnf(223,plain,
( greater(vplus(X1,X3),X2)
| ~ greater(X3,X2) ),
inference(spm,[status(thm)],[207,58,theory(equality)]) ).
cnf(341,plain,
( greater(X1,X2)
| ~ greater(vplus(esk1_2(X2,X3),X1),X3)
| ~ greater(X3,X2) ),
inference(spm,[status(thm)],[97,58,theory(equality)]) ).
cnf(434,plain,
( greater(vplus(X2,X1),X3)
| ~ greater(X2,X3) ),
inference(spm,[status(thm)],[223,64,theory(equality)]) ).
cnf(466,plain,
( greater(X2,X3)
| ~ greater(X1,X3)
| ~ greater(X2,X1) ),
inference(spm,[status(thm)],[434,58,theory(equality)]) ).
cnf(2675,plain,
( greater(X1,vplus(vd347,vd345))
| ~ greater(X1,vplus(vd347,vd344)) ),
inference(spm,[status(thm)],[466,78,theory(equality)]) ).
cnf(4905,plain,
greater(vplus(X1,vplus(vd347,vd344)),vplus(vd347,vd345)),
inference(spm,[status(thm)],[2675,149,theory(equality)]) ).
cnf(6309,plain,
( greater(vplus(vd347,vd344),X1)
| ~ greater(vplus(vd347,vd345),X1) ),
inference(spm,[status(thm)],[341,4905,theory(equality)]) ).
cnf(6884,negated_conjecture,
~ greater(vplus(vd347,vd345),vplus(vd345,vd348)),
inference(spm,[status(thm)],[88,6309,theory(equality)]) ).
cnf(8375,negated_conjecture,
~ greater(vd347,vd348),
inference(spm,[status(thm)],[6884,91,theory(equality)]) ).
cnf(8379,negated_conjecture,
$false,
inference(rw,[status(thm)],[8375,53,theory(equality)]) ).
cnf(8380,negated_conjecture,
$false,
inference(cn,[status(thm)],[8379,theory(equality)]) ).
cnf(8381,negated_conjecture,
$false,
8380,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM841+2 : TPTP v7.0.0. Released v4.1.0.
% 0.00/0.03 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n096.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 15:14:19 CST 2018
% 0.02/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.45 -running prover on /export/starexec/sandbox/tmp/tmpzScfB_/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.45 -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/tmpzScfB_/sel_theBenchmark.p_1']
% 0.07/0.45 -prover status Theorem
% 0.07/0.45 Problem theBenchmark.p solved in phase 0.
% 0.07/0.45 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.45 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.45 Solved 1 out of 1.
% 0.07/0.45 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.45 # SZS status Theorem
% 0.07/0.45 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.46 # SZS output end CNFRefutation
%------------------------------------------------------------------------------