TSTP Solution File: NUM835+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM835+2 : TPTP v7.0.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n077.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 : 13
% Number of leaves : 2
% Syntax : Number of formulae : 23 ( 7 unt; 0 def)
% Number of atoms : 84 ( 17 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 97 ( 36 ~; 39 |; 21 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 50 ( 4 sgn 28 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,conjecture,
( ? [X3] : equal(vd165,vplus(vd151,X3))
| ? [X4] : equal(vd151,vplus(vd165,X4))
| equal(vd151,vd165) ),
file('/export/starexec/sandbox/tmp/tmplwg8CC/sel_theBenchmark.p_1','dis(case_distinction(conseq(110)))') ).
fof(5,axiom,
! [X5,X6] :
( m(X6)
<=> ( equal(X5,X6)
| ? [X7] : equal(X5,vplus(X6,X7))
| ? [X8] : equal(X6,vplus(X5,X8)) ) ),
file('/export/starexec/sandbox/tmp/tmplwg8CC/sel_theBenchmark.p_1','def(cond(conseq(105), 0), 1)') ).
fof(11,negated_conjecture,
~ ( ? [X3] : equal(vd165,vplus(vd151,X3))
| ? [X4] : equal(vd151,vplus(vd165,X4))
| equal(vd151,vd165) ),
inference(assume_negation,[status(cth)],[4]) ).
fof(19,negated_conjecture,
( ! [X3] : ~ equal(vd165,vplus(vd151,X3))
& ! [X4] : ~ equal(vd151,vplus(vd165,X4))
& ~ equal(vd151,vd165) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(20,negated_conjecture,
( ! [X5] : ~ equal(vd165,vplus(vd151,X5))
& ! [X6] : ~ equal(vd151,vplus(vd165,X6))
& ~ equal(vd151,vd165) ),
inference(variable_rename,[status(thm)],[19]) ).
fof(21,negated_conjecture,
! [X5,X6] :
( ~ equal(vd151,vplus(vd165,X6))
& ~ equal(vd165,vplus(vd151,X5))
& ~ equal(vd151,vd165) ),
inference(shift_quantors,[status(thm)],[20]) ).
cnf(22,negated_conjecture,
vd151 != vd165,
inference(split_conjunct,[status(thm)],[21]) ).
cnf(23,negated_conjecture,
vd165 != vplus(vd151,X1),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(24,negated_conjecture,
vd151 != vplus(vd165,X1),
inference(split_conjunct,[status(thm)],[21]) ).
fof(25,plain,
! [X5,X6] :
( ( ~ m(X6)
| equal(X5,X6)
| ? [X7] : equal(X5,vplus(X6,X7))
| ? [X8] : equal(X6,vplus(X5,X8)) )
& ( ( ~ equal(X5,X6)
& ! [X7] : ~ equal(X5,vplus(X6,X7))
& ! [X8] : ~ equal(X6,vplus(X5,X8)) )
| m(X6) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(26,plain,
! [X9,X10] :
( ( ~ m(X10)
| equal(X9,X10)
| ? [X11] : equal(X9,vplus(X10,X11))
| ? [X12] : equal(X10,vplus(X9,X12)) )
& ( ( ~ equal(X9,X10)
& ! [X13] : ~ equal(X9,vplus(X10,X13))
& ! [X14] : ~ equal(X10,vplus(X9,X14)) )
| m(X10) ) ),
inference(variable_rename,[status(thm)],[25]) ).
fof(27,plain,
! [X9,X10] :
( ( ~ m(X10)
| equal(X9,X10)
| equal(X9,vplus(X10,esk1_2(X9,X10)))
| equal(X10,vplus(X9,esk2_2(X9,X10))) )
& ( ( ~ equal(X9,X10)
& ! [X13] : ~ equal(X9,vplus(X10,X13))
& ! [X14] : ~ equal(X10,vplus(X9,X14)) )
| m(X10) ) ),
inference(skolemize,[status(esa)],[26]) ).
fof(28,plain,
! [X9,X10,X13,X14] :
( ( ( ~ equal(X10,vplus(X9,X14))
& ~ equal(X9,vplus(X10,X13))
& ~ equal(X9,X10) )
| m(X10) )
& ( ~ m(X10)
| equal(X9,X10)
| equal(X9,vplus(X10,esk1_2(X9,X10)))
| equal(X10,vplus(X9,esk2_2(X9,X10))) ) ),
inference(shift_quantors,[status(thm)],[27]) ).
fof(29,plain,
! [X9,X10,X13,X14] :
( ( ~ equal(X10,vplus(X9,X14))
| m(X10) )
& ( ~ equal(X9,vplus(X10,X13))
| m(X10) )
& ( ~ equal(X9,X10)
| m(X10) )
& ( ~ m(X10)
| equal(X9,X10)
| equal(X9,vplus(X10,esk1_2(X9,X10)))
| equal(X10,vplus(X9,esk2_2(X9,X10))) ) ),
inference(distribute,[status(thm)],[28]) ).
cnf(30,plain,
( X1 = vplus(X2,esk2_2(X2,X1))
| X2 = vplus(X1,esk1_2(X2,X1))
| X2 = X1
| ~ m(X1) ),
inference(split_conjunct,[status(thm)],[29]) ).
cnf(31,plain,
( m(X1)
| X2 != X1 ),
inference(split_conjunct,[status(thm)],[29]) ).
cnf(61,plain,
m(X1),
inference(er,[status(thm)],[31,theory(equality)]) ).
cnf(89,plain,
( vplus(X1,esk1_2(X2,X1)) = X2
| vplus(X2,esk2_2(X2,X1)) = X1
| X1 = X2
| $false ),
inference(rw,[status(thm)],[30,61,theory(equality)]) ).
cnf(90,plain,
( vplus(X1,esk1_2(X2,X1)) = X2
| vplus(X2,esk2_2(X2,X1)) = X1
| X1 = X2 ),
inference(cn,[status(thm)],[89,theory(equality)]) ).
cnf(142,negated_conjecture,
( vplus(X1,esk1_2(vd151,X1)) = vd151
| X1 = vd151
| X1 != vd165 ),
inference(spm,[status(thm)],[23,90,theory(equality)]) ).
cnf(159,negated_conjecture,
vd165 = vd151,
inference(spm,[status(thm)],[24,142,theory(equality)]) ).
cnf(161,negated_conjecture,
$false,
inference(sr,[status(thm)],[159,22,theory(equality)]) ).
cnf(162,negated_conjecture,
$false,
161,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM835+2 : 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 : n077.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:40:50 CST 2018
% 0.02/0.23 % CPUTime :
% 0.06/0.27 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.27 --creating new selector for []
% 0.06/0.34 -running prover on /export/starexec/sandbox/tmp/tmplwg8CC/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.34 -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/tmplwg8CC/sel_theBenchmark.p_1']
% 0.06/0.34 -prover status Theorem
% 0.06/0.34 Problem theBenchmark.p solved in phase 0.
% 0.06/0.34 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.34 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.34 Solved 1 out of 1.
% 0.06/0.34 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.34 # SZS status Theorem
% 0.06/0.34 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.34 # SZS output end CNFRefutation
%------------------------------------------------------------------------------