TSTP Solution File: NUM841+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM841+1 : TPTP v7.0.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n068.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 : 16
% Number of leaves : 10
% Syntax : Number of formulae : 53 ( 31 unt; 0 def)
% Number of atoms : 85 ( 4 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 63 ( 31 ~; 25 |; 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 ( 9 sgn 46 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X2,X3,X4] :
( greater(X2,X3)
=> greater(vplus(X2,X4),vplus(X3,X4)) ),
file('/export/starexec/sandbox/tmp/tmpweiQ4G/sel_theBenchmark.p_1','ass(cond(goal(193), 0), 2)') ).
fof(3,axiom,
! [X5,X6] : greater(vplus(X5,X6),X5),
file('/export/starexec/sandbox/tmp/tmpweiQ4G/sel_theBenchmark.p_1','ass(cond(189, 0), 0)') ).
fof(5,axiom,
! [X8,X9] : equal(vplus(X9,X8),vplus(X8,X9)),
file('/export/starexec/sandbox/tmp/tmpweiQ4G/sel_theBenchmark.p_1','ass(cond(61, 0), 0)') ).
fof(7,conjecture,
greater(vplus(vd344,vd347),vplus(vd345,vd348)),
file('/export/starexec/sandbox/tmp/tmpweiQ4G/sel_theBenchmark.p_1','holds(214, 352, 0)') ).
fof(9,axiom,
greater(vplus(vd344,vd347),vplus(vd345,vd347)),
file('/export/starexec/sandbox/tmp/tmpweiQ4G/sel_theBenchmark.p_1','holds(212, 350, 0)') ).
fof(10,axiom,
equal(vplus(vd345,vd347),vplus(vd347,vd345)),
file('/export/starexec/sandbox/tmp/tmpweiQ4G/sel_theBenchmark.p_1','holds(213, 351, 0)') ).
fof(15,axiom,
! [X24,X25] :
( greater(X25,X24)
<=> ? [X26] : equal(X25,vplus(X24,X26)) ),
file('/export/starexec/sandbox/tmp/tmpweiQ4G/sel_theBenchmark.p_1','def(cond(conseq(axiom(3)), 11), 1)') ).
fof(16,axiom,
! [X27,X28,X29] :
( greater(vplus(X27,X29),vplus(X28,X29))
=> greater(X27,X28) ),
file('/export/starexec/sandbox/tmp/tmpweiQ4G/sel_theBenchmark.p_1','ass(cond(goal(202), 0), 2)') ).
fof(18,axiom,
greater(vd347,vd348),
file('/export/starexec/sandbox/tmp/tmpweiQ4G/sel_theBenchmark.p_1','holds(conjunct2(211), 349, 0)') ).
fof(22,axiom,
! [X39,X40,X41] : equal(vplus(vplus(X39,X40),X41),vplus(X39,vplus(X40,X41))),
file('/export/starexec/sandbox/tmp/tmpweiQ4G/sel_theBenchmark.p_1','ass(cond(33, 0), 0)') ).
fof(31,negated_conjecture,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
inference(assume_negation,[status(cth)],[7]) ).
fof(32,negated_conjecture,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
inference(fof_simplification,[status(thm)],[31,theory(equality)]) ).
fof(36,plain,
! [X2,X3,X4] :
( ~ greater(X2,X3)
| greater(vplus(X2,X4),vplus(X3,X4)) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(37,plain,
! [X5,X6,X7] :
( ~ greater(X5,X6)
| greater(vplus(X5,X7),vplus(X6,X7)) ),
inference(variable_rename,[status(thm)],[36]) ).
cnf(38,plain,
( greater(vplus(X1,X2),vplus(X3,X2))
| ~ greater(X1,X3) ),
inference(split_conjunct,[status(thm)],[37]) ).
fof(39,plain,
! [X7,X8] : greater(vplus(X7,X8),X7),
inference(variable_rename,[status(thm)],[3]) ).
cnf(40,plain,
greater(vplus(X1,X2),X1),
inference(split_conjunct,[status(thm)],[39]) ).
fof(43,plain,
! [X10,X11] : equal(vplus(X11,X10),vplus(X10,X11)),
inference(variable_rename,[status(thm)],[5]) ).
cnf(44,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[43]) ).
cnf(48,negated_conjecture,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
inference(split_conjunct,[status(thm)],[32]) ).
cnf(52,plain,
greater(vplus(vd344,vd347),vplus(vd345,vd347)),
inference(split_conjunct,[status(thm)],[9]) ).
cnf(53,plain,
vplus(vd345,vd347) = vplus(vd347,vd345),
inference(split_conjunct,[status(thm)],[10]) ).
fof(67,plain,
! [X24,X25] :
( ( ~ greater(X25,X24)
| ? [X26] : equal(X25,vplus(X24,X26)) )
& ( ! [X26] : ~ equal(X25,vplus(X24,X26))
| greater(X25,X24) ) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(68,plain,
! [X27,X28] :
( ( ~ greater(X28,X27)
| ? [X29] : equal(X28,vplus(X27,X29)) )
& ( ! [X30] : ~ equal(X28,vplus(X27,X30))
| greater(X28,X27) ) ),
inference(variable_rename,[status(thm)],[67]) ).
fof(69,plain,
! [X27,X28] :
( ( ~ greater(X28,X27)
| equal(X28,vplus(X27,esk1_2(X27,X28))) )
& ( ! [X30] : ~ equal(X28,vplus(X27,X30))
| greater(X28,X27) ) ),
inference(skolemize,[status(esa)],[68]) ).
fof(70,plain,
! [X27,X28,X30] :
( ( ~ equal(X28,vplus(X27,X30))
| greater(X28,X27) )
& ( ~ greater(X28,X27)
| equal(X28,vplus(X27,esk1_2(X27,X28))) ) ),
inference(shift_quantors,[status(thm)],[69]) ).
cnf(71,plain,
( X1 = vplus(X2,esk1_2(X2,X1))
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[70]) ).
fof(73,plain,
! [X27,X28,X29] :
( ~ greater(vplus(X27,X29),vplus(X28,X29))
| greater(X27,X28) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(74,plain,
! [X30,X31,X32] :
( ~ greater(vplus(X30,X32),vplus(X31,X32))
| greater(X30,X31) ),
inference(variable_rename,[status(thm)],[73]) ).
cnf(75,plain,
( greater(X1,X2)
| ~ greater(vplus(X1,X3),vplus(X2,X3)) ),
inference(split_conjunct,[status(thm)],[74]) ).
cnf(79,plain,
greater(vd347,vd348),
inference(split_conjunct,[status(thm)],[18]) ).
fof(89,plain,
! [X42,X43,X44] : equal(vplus(vplus(X42,X43),X44),vplus(X42,vplus(X43,X44))),
inference(variable_rename,[status(thm)],[22]) ).
cnf(90,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
inference(split_conjunct,[status(thm)],[89]) ).
cnf(122,plain,
greater(vplus(vd344,vd347),vplus(vd347,vd345)),
inference(rw,[status(thm)],[52,53,theory(equality)]) ).
cnf(128,plain,
greater(vplus(X2,X1),X1),
inference(spm,[status(thm)],[40,44,theory(equality)]) ).
cnf(134,plain,
greater(vplus(vd347,vd344),vplus(vd347,vd345)),
inference(rw,[status(thm)],[122,44,theory(equality)]) ).
cnf(143,negated_conjecture,
~ greater(vplus(vd347,vd344),vplus(vd345,vd348)),
inference(rw,[status(thm)],[48,44,theory(equality)]) ).
cnf(150,plain,
( greater(vplus(X1,X2),vplus(X2,X3))
| ~ greater(X1,X3) ),
inference(spm,[status(thm)],[38,44,theory(equality)]) ).
cnf(154,plain,
( greater(X1,X2)
| ~ greater(vplus(X3,X1),vplus(X2,X3)) ),
inference(spm,[status(thm)],[75,44,theory(equality)]) ).
cnf(204,plain,
greater(vplus(X1,vplus(X2,X3)),X3),
inference(spm,[status(thm)],[128,90,theory(equality)]) ).
cnf(243,plain,
greater(vplus(X1,vplus(X3,X2)),X3),
inference(spm,[status(thm)],[204,44,theory(equality)]) ).
cnf(257,plain,
( greater(vplus(X1,X3),X2)
| ~ greater(X3,X2) ),
inference(spm,[status(thm)],[243,71,theory(equality)]) ).
cnf(462,plain,
( greater(vplus(X2,X1),X3)
| ~ greater(X2,X3) ),
inference(spm,[status(thm)],[257,44,theory(equality)]) ).
cnf(491,plain,
( greater(X2,X3)
| ~ greater(X1,X3)
| ~ greater(X2,X1) ),
inference(spm,[status(thm)],[462,71,theory(equality)]) ).
cnf(512,plain,
( greater(X1,X2)
| ~ greater(vplus(esk1_2(X2,X3),X1),X3)
| ~ greater(X3,X2) ),
inference(spm,[status(thm)],[154,71,theory(equality)]) ).
cnf(7113,plain,
( greater(X1,vplus(vd347,vd345))
| ~ greater(X1,vplus(vd347,vd344)) ),
inference(spm,[status(thm)],[491,134,theory(equality)]) ).
cnf(10148,plain,
greater(vplus(X1,vplus(vd347,vd344)),vplus(vd347,vd345)),
inference(spm,[status(thm)],[7113,128,theory(equality)]) ).
cnf(10300,plain,
( greater(vplus(vd347,vd344),X1)
| ~ greater(vplus(vd347,vd345),X1) ),
inference(spm,[status(thm)],[512,10148,theory(equality)]) ).
cnf(10494,negated_conjecture,
~ greater(vplus(vd347,vd345),vplus(vd345,vd348)),
inference(spm,[status(thm)],[143,10300,theory(equality)]) ).
cnf(11427,negated_conjecture,
~ greater(vd347,vd348),
inference(spm,[status(thm)],[10494,150,theory(equality)]) ).
cnf(11431,negated_conjecture,
$false,
inference(rw,[status(thm)],[11427,79,theory(equality)]) ).
cnf(11432,negated_conjecture,
$false,
inference(cn,[status(thm)],[11431,theory(equality)]) ).
cnf(11433,negated_conjecture,
$false,
11432,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM841+1 : TPTP v7.0.0. Released v4.1.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n068.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 14:41:50 CST 2018
% 0.02/0.23 % CPUTime :
% 0.02/0.28 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.02/0.28 --creating new selector for []
% 0.07/0.52 -running prover on /export/starexec/sandbox/tmp/tmpweiQ4G/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.52 -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/tmpweiQ4G/sel_theBenchmark.p_1']
% 0.07/0.52 -prover status Theorem
% 0.07/0.52 Problem theBenchmark.p solved in phase 0.
% 0.07/0.52 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.52 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.52 Solved 1 out of 1.
% 0.07/0.52 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.52 # SZS status Theorem
% 0.07/0.52 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.52 # SZS output end CNFRefutation
%------------------------------------------------------------------------------