TSTP Solution File: NUM835+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM835+1 : TPTP v7.0.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n071.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(9,conjecture,
( ? [X16] : equal(vd165,vplus(vd151,X16))
| ? [X17] : equal(vd151,vplus(vd165,X17))
| equal(vd151,vd165) ),
file('/export/starexec/sandbox/tmp/tmpnrO7qd/sel_theBenchmark.p_1','dis(case_distinction(conseq(110)))') ).
fof(11,axiom,
! [X19,X20] :
( m(X20)
<=> ( equal(X19,X20)
| ? [X21] : equal(X19,vplus(X20,X21))
| ? [X22] : equal(X20,vplus(X19,X22)) ) ),
file('/export/starexec/sandbox/tmp/tmpnrO7qd/sel_theBenchmark.p_1','def(cond(conseq(105), 0), 1)') ).
fof(21,negated_conjecture,
~ ( ? [X16] : equal(vd165,vplus(vd151,X16))
| ? [X17] : equal(vd151,vplus(vd165,X17))
| equal(vd151,vd165) ),
inference(assume_negation,[status(cth)],[9]) ).
fof(51,negated_conjecture,
( ! [X16] : ~ equal(vd165,vplus(vd151,X16))
& ! [X17] : ~ equal(vd151,vplus(vd165,X17))
& ~ equal(vd151,vd165) ),
inference(fof_nnf,[status(thm)],[21]) ).
fof(52,negated_conjecture,
( ! [X18] : ~ equal(vd165,vplus(vd151,X18))
& ! [X19] : ~ equal(vd151,vplus(vd165,X19))
& ~ equal(vd151,vd165) ),
inference(variable_rename,[status(thm)],[51]) ).
fof(53,negated_conjecture,
! [X18,X19] :
( ~ equal(vd151,vplus(vd165,X19))
& ~ equal(vd165,vplus(vd151,X18))
& ~ equal(vd151,vd165) ),
inference(shift_quantors,[status(thm)],[52]) ).
cnf(54,negated_conjecture,
vd151 != vd165,
inference(split_conjunct,[status(thm)],[53]) ).
cnf(55,negated_conjecture,
vd165 != vplus(vd151,X1),
inference(split_conjunct,[status(thm)],[53]) ).
cnf(56,negated_conjecture,
vd151 != vplus(vd165,X1),
inference(split_conjunct,[status(thm)],[53]) ).
fof(60,plain,
! [X19,X20] :
( ( ~ m(X20)
| equal(X19,X20)
| ? [X21] : equal(X19,vplus(X20,X21))
| ? [X22] : equal(X20,vplus(X19,X22)) )
& ( ( ~ equal(X19,X20)
& ! [X21] : ~ equal(X19,vplus(X20,X21))
& ! [X22] : ~ equal(X20,vplus(X19,X22)) )
| m(X20) ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(61,plain,
! [X23,X24] :
( ( ~ m(X24)
| equal(X23,X24)
| ? [X25] : equal(X23,vplus(X24,X25))
| ? [X26] : equal(X24,vplus(X23,X26)) )
& ( ( ~ equal(X23,X24)
& ! [X27] : ~ equal(X23,vplus(X24,X27))
& ! [X28] : ~ equal(X24,vplus(X23,X28)) )
| m(X24) ) ),
inference(variable_rename,[status(thm)],[60]) ).
fof(62,plain,
! [X23,X24] :
( ( ~ m(X24)
| equal(X23,X24)
| equal(X23,vplus(X24,esk2_2(X23,X24)))
| equal(X24,vplus(X23,esk3_2(X23,X24))) )
& ( ( ~ equal(X23,X24)
& ! [X27] : ~ equal(X23,vplus(X24,X27))
& ! [X28] : ~ equal(X24,vplus(X23,X28)) )
| m(X24) ) ),
inference(skolemize,[status(esa)],[61]) ).
fof(63,plain,
! [X23,X24,X27,X28] :
( ( ( ~ equal(X24,vplus(X23,X28))
& ~ equal(X23,vplus(X24,X27))
& ~ equal(X23,X24) )
| m(X24) )
& ( ~ m(X24)
| equal(X23,X24)
| equal(X23,vplus(X24,esk2_2(X23,X24)))
| equal(X24,vplus(X23,esk3_2(X23,X24))) ) ),
inference(shift_quantors,[status(thm)],[62]) ).
fof(64,plain,
! [X23,X24,X27,X28] :
( ( ~ equal(X24,vplus(X23,X28))
| m(X24) )
& ( ~ equal(X23,vplus(X24,X27))
| m(X24) )
& ( ~ equal(X23,X24)
| m(X24) )
& ( ~ m(X24)
| equal(X23,X24)
| equal(X23,vplus(X24,esk2_2(X23,X24)))
| equal(X24,vplus(X23,esk3_2(X23,X24))) ) ),
inference(distribute,[status(thm)],[63]) ).
cnf(65,plain,
( X1 = vplus(X2,esk3_2(X2,X1))
| X2 = vplus(X1,esk2_2(X2,X1))
| X2 = X1
| ~ m(X1) ),
inference(split_conjunct,[status(thm)],[64]) ).
cnf(66,plain,
( m(X1)
| X2 != X1 ),
inference(split_conjunct,[status(thm)],[64]) ).
cnf(103,plain,
m(X1),
inference(er,[status(thm)],[66,theory(equality)]) ).
cnf(176,plain,
( vplus(X1,esk2_2(X2,X1)) = X2
| vplus(X2,esk3_2(X2,X1)) = X1
| X1 = X2
| $false ),
inference(rw,[status(thm)],[65,103,theory(equality)]) ).
cnf(177,plain,
( vplus(X1,esk2_2(X2,X1)) = X2
| vplus(X2,esk3_2(X2,X1)) = X1
| X1 = X2 ),
inference(cn,[status(thm)],[176,theory(equality)]) ).
cnf(184,negated_conjecture,
( vplus(X1,esk2_2(vd151,X1)) = vd151
| X1 = vd151
| X1 != vd165 ),
inference(spm,[status(thm)],[55,177,theory(equality)]) ).
cnf(1550,negated_conjecture,
vd165 = vd151,
inference(spm,[status(thm)],[56,184,theory(equality)]) ).
cnf(1585,negated_conjecture,
$false,
inference(sr,[status(thm)],[1550,54,theory(equality)]) ).
cnf(1586,negated_conjecture,
$false,
1585,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM835+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 : n071.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 : Mon Jan 8 08:13:58 CST 2018
% 0.03/0.23 % CPUTime :
% 0.03/0.27 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.28 --creating new selector for []
% 0.06/0.37 -running prover on /export/starexec/sandbox/tmp/tmpnrO7qd/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.37 -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/tmpnrO7qd/sel_theBenchmark.p_1']
% 0.06/0.37 -prover status Theorem
% 0.06/0.37 Problem theBenchmark.p solved in phase 0.
% 0.06/0.37 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.37 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.37 Solved 1 out of 1.
% 0.06/0.37 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.37 # SZS status Theorem
% 0.06/0.37 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.37 # SZS output end CNFRefutation
%------------------------------------------------------------------------------