TSTP Solution File: NUN081+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUN081+2 : TPTP v7.3.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sine.py -e eprover -t %d %s
% Computer : n184.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.5MB
% OS : Linux 3.10.0-862.11.6.el7.x86_64
% CPULimit : 300s
% DateTime : Wed Feb 27 14:27:09 EST 2019
% Result : Theorem 0.09s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 36 ( 11 unt; 0 def)
% Number of atoms : 122 ( 5 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 152 ( 66 ~; 48 |; 38 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 96 ( 10 sgn 39 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
? [X2] :
! [X3] :
( ( ~ r2(X1,X3)
& ~ equal(X3,X2) )
| ( r2(X1,X3)
& equal(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmpjetsE8/sel_theBenchmark.p_1',axiom_2) ).
fof(5,axiom,
? [X16] :
! [X17] :
( ( ~ r1(X17)
& ~ equal(X17,X16) )
| ( r1(X17)
& equal(X17,X16) ) ),
file('/export/starexec/sandbox/tmp/tmpjetsE8/sel_theBenchmark.p_1',axiom_1) ).
fof(7,axiom,
! [X24] :
? [X25] :
( ? [X26] :
( r1(X26)
& r3(X24,X26,X25) )
& equal(X25,X24) ),
file('/export/starexec/sandbox/tmp/tmpjetsE8/sel_theBenchmark.p_1',axiom_4a) ).
fof(9,conjecture,
? [X10,X30,X31] :
( r3(X10,X30,X31)
& ? [X20] :
( equal(X31,X20)
& ? [X21] :
( r2(X21,X20)
& ? [X32] :
( r2(X32,X21)
& ? [X23] :
( r1(X23)
& r2(X23,X32) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmpjetsE8/sel_theBenchmark.p_1',xplusyeqthree) ).
fof(10,negated_conjecture,
~ ? [X10,X30,X31] :
( r3(X10,X30,X31)
& ? [X20] :
( equal(X31,X20)
& ? [X21] :
( r2(X21,X20)
& ? [X32] :
( r2(X32,X21)
& ? [X23] :
( r1(X23)
& r2(X23,X32) ) ) ) ) ),
inference(assume_negation,[status(cth)],[9]) ).
fof(11,plain,
! [X1] :
? [X2] :
! [X3] :
( ( ~ r2(X1,X3)
& ~ equal(X3,X2) )
| ( r2(X1,X3)
& equal(X3,X2) ) ),
inference(fof_simplification,[status(thm)],[1,theory(equality)]) ).
fof(14,plain,
? [X16] :
! [X17] :
( ( ~ r1(X17)
& ~ equal(X17,X16) )
| ( r1(X17)
& equal(X17,X16) ) ),
inference(fof_simplification,[status(thm)],[5,theory(equality)]) ).
fof(16,plain,
! [X4] :
? [X5] :
! [X6] :
( ( ~ r2(X4,X6)
& ~ equal(X6,X5) )
| ( r2(X4,X6)
& equal(X6,X5) ) ),
inference(variable_rename,[status(thm)],[11]) ).
fof(17,plain,
! [X4,X6] :
( ( ~ r2(X4,X6)
& ~ equal(X6,esk1_1(X4)) )
| ( r2(X4,X6)
& equal(X6,esk1_1(X4)) ) ),
inference(skolemize,[status(esa)],[16]) ).
fof(18,plain,
! [X4,X6] :
( ( r2(X4,X6)
| ~ r2(X4,X6) )
& ( equal(X6,esk1_1(X4))
| ~ r2(X4,X6) )
& ( r2(X4,X6)
| ~ equal(X6,esk1_1(X4)) )
& ( equal(X6,esk1_1(X4))
| ~ equal(X6,esk1_1(X4)) ) ),
inference(distribute,[status(thm)],[17]) ).
cnf(20,plain,
( r2(X2,X1)
| X1 != esk1_1(X2) ),
inference(split_conjunct,[status(thm)],[18]) ).
fof(40,plain,
? [X18] :
! [X19] :
( ( ~ r1(X19)
& ~ equal(X19,X18) )
| ( r1(X19)
& equal(X19,X18) ) ),
inference(variable_rename,[status(thm)],[14]) ).
fof(41,plain,
! [X19] :
( ( ~ r1(X19)
& ~ equal(X19,esk6_0) )
| ( r1(X19)
& equal(X19,esk6_0) ) ),
inference(skolemize,[status(esa)],[40]) ).
fof(42,plain,
! [X19] :
( ( r1(X19)
| ~ r1(X19) )
& ( equal(X19,esk6_0)
| ~ r1(X19) )
& ( r1(X19)
| ~ equal(X19,esk6_0) )
& ( equal(X19,esk6_0)
| ~ equal(X19,esk6_0) ) ),
inference(distribute,[status(thm)],[41]) ).
cnf(45,plain,
( X1 = esk6_0
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[42]) ).
fof(54,plain,
! [X27] :
? [X28] :
( ? [X29] :
( r1(X29)
& r3(X27,X29,X28) )
& equal(X28,X27) ),
inference(variable_rename,[status(thm)],[7]) ).
fof(55,plain,
! [X27] :
( r1(esk12_1(X27))
& r3(X27,esk12_1(X27),esk11_1(X27))
& equal(esk11_1(X27),X27) ),
inference(skolemize,[status(esa)],[54]) ).
cnf(56,plain,
esk11_1(X1) = X1,
inference(split_conjunct,[status(thm)],[55]) ).
cnf(57,plain,
r3(X1,esk12_1(X1),esk11_1(X1)),
inference(split_conjunct,[status(thm)],[55]) ).
cnf(58,plain,
r1(esk12_1(X1)),
inference(split_conjunct,[status(thm)],[55]) ).
fof(62,negated_conjecture,
! [X10,X30,X31] :
( ~ r3(X10,X30,X31)
| ! [X20] :
( ~ equal(X31,X20)
| ! [X21] :
( ~ r2(X21,X20)
| ! [X32] :
( ~ r2(X32,X21)
| ! [X23] :
( ~ r1(X23)
| ~ r2(X23,X32) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(63,negated_conjecture,
! [X33,X34,X35] :
( ~ r3(X33,X34,X35)
| ! [X36] :
( ~ equal(X35,X36)
| ! [X37] :
( ~ r2(X37,X36)
| ! [X38] :
( ~ r2(X38,X37)
| ! [X39] :
( ~ r1(X39)
| ~ r2(X39,X38) ) ) ) ) ),
inference(variable_rename,[status(thm)],[62]) ).
fof(64,negated_conjecture,
! [X33,X34,X35,X36,X37,X38,X39] :
( ~ r1(X39)
| ~ r2(X39,X38)
| ~ r2(X38,X37)
| ~ r2(X37,X36)
| ~ equal(X35,X36)
| ~ r3(X33,X34,X35) ),
inference(shift_quantors,[status(thm)],[63]) ).
cnf(65,negated_conjecture,
( ~ r3(X1,X2,X3)
| X3 != X4
| ~ r2(X5,X4)
| ~ r2(X6,X5)
| ~ r2(X7,X6)
| ~ r1(X7) ),
inference(split_conjunct,[status(thm)],[64]) ).
cnf(66,plain,
r3(X1,esk12_1(X1),X1),
inference(rw,[status(thm)],[57,56,theory(equality)]),
[unfolding] ).
cnf(68,plain,
esk6_0 = esk12_1(X1),
inference(spm,[status(thm)],[45,58,theory(equality)]) ).
cnf(70,plain,
r2(X1,esk1_1(X1)),
inference(er,[status(thm)],[20,theory(equality)]) ).
cnf(84,negated_conjecture,
( ~ r3(X1,X2,X3)
| ~ r1(X4)
| ~ r2(X4,X5)
| ~ r2(X5,X6)
| ~ r2(X6,X3) ),
inference(er,[status(thm)],[65,theory(equality)]) ).
cnf(91,plain,
r3(X1,esk6_0,X1),
inference(rw,[status(thm)],[66,68,theory(equality)]) ).
cnf(92,plain,
r1(esk6_0),
inference(rw,[status(thm)],[58,68,theory(equality)]) ).
cnf(244,negated_conjecture,
( ~ r1(X2)
| ~ r2(X2,X3)
| ~ r2(X3,X4)
| ~ r2(X4,X1) ),
inference(spm,[status(thm)],[84,91,theory(equality)]) ).
cnf(263,negated_conjecture,
( ~ r1(X1)
| ~ r2(esk1_1(X1),X2)
| ~ r2(X2,X3) ),
inference(spm,[status(thm)],[244,70,theory(equality)]) ).
cnf(269,negated_conjecture,
( ~ r1(X1)
| ~ r2(esk1_1(esk1_1(X1)),X2) ),
inference(spm,[status(thm)],[263,70,theory(equality)]) ).
cnf(295,negated_conjecture,
~ r1(X1),
inference(spm,[status(thm)],[269,70,theory(equality)]) ).
cnf(310,plain,
$false,
inference(sr,[status(thm)],[92,295,theory(equality)]) ).
cnf(311,plain,
$false,
310,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUN081+2 : TPTP v7.3.0. Released v7.3.0.
% 0.00/0.05 % Command : sine.py -e eprover -t %d %s
% 0.04/0.25 % Computer : n184.star.cs.uiowa.edu
% 0.04/0.25 % Model : x86_64 x86_64
% 0.04/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.04/0.25 % Memory : 32218.5MB
% 0.04/0.25 % OS : Linux 3.10.0-862.11.6.el7.x86_64
% 0.04/0.25 % CPULimit : 300
% 0.04/0.28 % DateTime : Sat Feb 23 22:49:45 CST 2019
% 0.04/0.28 % CPUTime :
% 0.09/0.33 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.33 --creating new selector for [NUM008+0.ax]
% 0.09/0.41 -running prover on /export/starexec/sandbox/tmp/tmpjetsE8/sel_theBenchmark.p_1 with time limit 29
% 0.09/0.41 -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/tmpjetsE8/sel_theBenchmark.p_1']
% 0.09/0.41 -prover status Theorem
% 0.09/0.41 Problem theBenchmark.p solved in phase 0.
% 0.09/0.41 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.41 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.41 Solved 1 out of 1.
% 0.09/0.41 # Problem is unsatisfiable (or provable), constructing proof object
% 0.09/0.41 # SZS status Theorem
% 0.09/0.41 # SZS output start CNFRefutation.
% See solution above
% 0.09/0.42 # SZS output end CNFRefutation
%------------------------------------------------------------------------------