TSTP Solution File: NUN068+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUN068+2 : TPTP v7.3.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sine.py -e eprover -t %d %s
% Computer : n191.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:06 EST 2019
% Result : Theorem 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 5
% Syntax : Number of formulae : 71 ( 8 unt; 0 def)
% Number of atoms : 214 ( 35 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 231 ( 88 ~; 104 |; 39 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 140 ( 16 sgn 56 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X5,X6] :
( ! [X7] :
( ! [X8] :
( ~ r2(X5,X8)
| ~ equal(X8,X7) )
| ~ r2(X6,X7) )
| equal(X5,X6) ),
file('/export/starexec/sandbox2/tmp/tmpUgKYCi/sel_theBenchmark.p_1',axiom_3a) ).
fof(3,axiom,
! [X9] :
? [X10] :
! [X11] :
( ( ~ r2(X9,X11)
& ~ equal(X11,X10) )
| ( r2(X9,X11)
& equal(X11,X10) ) ),
file('/export/starexec/sandbox2/tmp/tmpUgKYCi/sel_theBenchmark.p_1',axiom_2) ).
fof(4,axiom,
? [X12] :
! [X13] :
( ( ~ r1(X13)
& ~ equal(X13,X12) )
| ( r1(X13)
& equal(X13,X12) ) ),
file('/export/starexec/sandbox2/tmp/tmpUgKYCi/sel_theBenchmark.p_1',axiom_1) ).
fof(5,axiom,
! [X14,X15] :
( ! [X16] :
( ~ r1(X16)
| ~ equal(X16,X15) )
| ~ r2(X14,X15) ),
file('/export/starexec/sandbox2/tmp/tmpUgKYCi/sel_theBenchmark.p_1',axiom_7a) ).
fof(6,conjecture,
? [X3] :
( ! [X17] :
( ! [X18] :
( ~ r1(X18)
| ~ r2(X18,X17) )
| ~ equal(X3,X17) )
& ! [X19] :
( ~ r1(X19)
| ~ equal(X3,X19) ) ),
file('/export/starexec/sandbox2/tmp/tmpUgKYCi/sel_theBenchmark.p_1',nonzerosnononesexist) ).
fof(7,negated_conjecture,
~ ? [X3] :
( ! [X17] :
( ! [X18] :
( ~ r1(X18)
| ~ r2(X18,X17) )
| ~ equal(X3,X17) )
& ! [X19] :
( ~ r1(X19)
| ~ equal(X3,X19) ) ),
inference(assume_negation,[status(cth)],[6]) ).
fof(8,plain,
! [X5,X6] :
( ! [X7] :
( ! [X8] :
( ~ r2(X5,X8)
| ~ equal(X8,X7) )
| ~ r2(X6,X7) )
| equal(X5,X6) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(9,plain,
! [X9] :
? [X10] :
! [X11] :
( ( ~ r2(X9,X11)
& ~ equal(X11,X10) )
| ( r2(X9,X11)
& equal(X11,X10) ) ),
inference(fof_simplification,[status(thm)],[3,theory(equality)]) ).
fof(10,plain,
? [X12] :
! [X13] :
( ( ~ r1(X13)
& ~ equal(X13,X12) )
| ( r1(X13)
& equal(X13,X12) ) ),
inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).
fof(11,plain,
! [X14,X15] :
( ! [X16] :
( ~ r1(X16)
| ~ equal(X16,X15) )
| ~ r2(X14,X15) ),
inference(fof_simplification,[status(thm)],[5,theory(equality)]) ).
fof(12,negated_conjecture,
~ ? [X3] :
( ! [X17] :
( ! [X18] :
( ~ r1(X18)
| ~ r2(X18,X17) )
| ~ equal(X3,X17) )
& ! [X19] :
( ~ r1(X19)
| ~ equal(X3,X19) ) ),
inference(fof_simplification,[status(thm)],[7,theory(equality)]) ).
fof(20,plain,
! [X9,X10] :
( ! [X11] :
( ! [X12] :
( ~ r2(X9,X12)
| ~ equal(X12,X11) )
| ~ r2(X10,X11) )
| equal(X9,X10) ),
inference(variable_rename,[status(thm)],[8]) ).
fof(21,plain,
! [X9,X10,X11,X12] :
( ~ r2(X9,X12)
| ~ equal(X12,X11)
| ~ r2(X10,X11)
| equal(X9,X10) ),
inference(shift_quantors,[status(thm)],[20]) ).
cnf(22,plain,
( X1 = X2
| ~ r2(X2,X3)
| X4 != X3
| ~ r2(X1,X4) ),
inference(split_conjunct,[status(thm)],[21]) ).
fof(23,plain,
! [X12] :
? [X13] :
! [X14] :
( ( ~ r2(X12,X14)
& ~ equal(X14,X13) )
| ( r2(X12,X14)
& equal(X14,X13) ) ),
inference(variable_rename,[status(thm)],[9]) ).
fof(24,plain,
! [X12,X14] :
( ( ~ r2(X12,X14)
& ~ equal(X14,esk4_1(X12)) )
| ( r2(X12,X14)
& equal(X14,esk4_1(X12)) ) ),
inference(skolemize,[status(esa)],[23]) ).
fof(25,plain,
! [X12,X14] :
( ( r2(X12,X14)
| ~ r2(X12,X14) )
& ( equal(X14,esk4_1(X12))
| ~ r2(X12,X14) )
& ( r2(X12,X14)
| ~ equal(X14,esk4_1(X12)) )
& ( equal(X14,esk4_1(X12))
| ~ equal(X14,esk4_1(X12)) ) ),
inference(distribute,[status(thm)],[24]) ).
cnf(27,plain,
( r2(X2,X1)
| X1 != esk4_1(X2) ),
inference(split_conjunct,[status(thm)],[25]) ).
cnf(28,plain,
( X2 = esk4_1(X1)
| ~ r2(X1,X2) ),
inference(split_conjunct,[status(thm)],[25]) ).
fof(30,plain,
? [X14] :
! [X15] :
( ( ~ r1(X15)
& ~ equal(X15,X14) )
| ( r1(X15)
& equal(X15,X14) ) ),
inference(variable_rename,[status(thm)],[10]) ).
fof(31,plain,
! [X15] :
( ( ~ r1(X15)
& ~ equal(X15,esk5_0) )
| ( r1(X15)
& equal(X15,esk5_0) ) ),
inference(skolemize,[status(esa)],[30]) ).
fof(32,plain,
! [X15] :
( ( r1(X15)
| ~ r1(X15) )
& ( equal(X15,esk5_0)
| ~ r1(X15) )
& ( r1(X15)
| ~ equal(X15,esk5_0) )
& ( equal(X15,esk5_0)
| ~ equal(X15,esk5_0) ) ),
inference(distribute,[status(thm)],[31]) ).
cnf(34,plain,
( r1(X1)
| X1 != esk5_0 ),
inference(split_conjunct,[status(thm)],[32]) ).
cnf(35,plain,
( X1 = esk5_0
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[32]) ).
fof(37,plain,
! [X17,X18] :
( ! [X19] :
( ~ r1(X19)
| ~ equal(X19,X18) )
| ~ r2(X17,X18) ),
inference(variable_rename,[status(thm)],[11]) ).
fof(38,plain,
! [X17,X18,X19] :
( ~ r1(X19)
| ~ equal(X19,X18)
| ~ r2(X17,X18) ),
inference(shift_quantors,[status(thm)],[37]) ).
cnf(39,plain,
( ~ r2(X1,X2)
| X3 != X2
| ~ r1(X3) ),
inference(split_conjunct,[status(thm)],[38]) ).
fof(40,negated_conjecture,
! [X3] :
( ? [X17] :
( ? [X18] :
( r1(X18)
& r2(X18,X17) )
& equal(X3,X17) )
| ? [X19] :
( r1(X19)
& equal(X3,X19) ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(41,negated_conjecture,
! [X20] :
( ? [X21] :
( ? [X22] :
( r1(X22)
& r2(X22,X21) )
& equal(X20,X21) )
| ? [X23] :
( r1(X23)
& equal(X20,X23) ) ),
inference(variable_rename,[status(thm)],[40]) ).
fof(42,negated_conjecture,
! [X20] :
( ( r1(esk7_1(X20))
& r2(esk7_1(X20),esk6_1(X20))
& equal(X20,esk6_1(X20)) )
| ( r1(esk8_1(X20))
& equal(X20,esk8_1(X20)) ) ),
inference(skolemize,[status(esa)],[41]) ).
fof(43,negated_conjecture,
! [X20] :
( ( r1(esk8_1(X20))
| r1(esk7_1(X20)) )
& ( equal(X20,esk8_1(X20))
| r1(esk7_1(X20)) )
& ( r1(esk8_1(X20))
| r2(esk7_1(X20),esk6_1(X20)) )
& ( equal(X20,esk8_1(X20))
| r2(esk7_1(X20),esk6_1(X20)) )
& ( r1(esk8_1(X20))
| equal(X20,esk6_1(X20)) )
& ( equal(X20,esk8_1(X20))
| equal(X20,esk6_1(X20)) ) ),
inference(distribute,[status(thm)],[42]) ).
cnf(44,negated_conjecture,
( X1 = esk6_1(X1)
| X1 = esk8_1(X1) ),
inference(split_conjunct,[status(thm)],[43]) ).
cnf(45,negated_conjecture,
( X1 = esk6_1(X1)
| r1(esk8_1(X1)) ),
inference(split_conjunct,[status(thm)],[43]) ).
cnf(46,negated_conjecture,
( r2(esk7_1(X1),esk6_1(X1))
| X1 = esk8_1(X1) ),
inference(split_conjunct,[status(thm)],[43]) ).
cnf(47,negated_conjecture,
( r2(esk7_1(X1),esk6_1(X1))
| r1(esk8_1(X1)) ),
inference(split_conjunct,[status(thm)],[43]) ).
cnf(48,negated_conjecture,
( r1(esk7_1(X1))
| X1 = esk8_1(X1) ),
inference(split_conjunct,[status(thm)],[43]) ).
cnf(49,negated_conjecture,
( r1(esk7_1(X1))
| r1(esk8_1(X1)) ),
inference(split_conjunct,[status(thm)],[43]) ).
cnf(51,negated_conjecture,
( esk5_0 = esk7_1(X1)
| r1(esk8_1(X1)) ),
inference(spm,[status(thm)],[35,49,theory(equality)]) ).
cnf(52,negated_conjecture,
( esk5_0 = esk7_1(X1)
| esk8_1(X1) = X1 ),
inference(spm,[status(thm)],[35,48,theory(equality)]) ).
cnf(53,negated_conjecture,
( r2(esk7_1(X1),X1)
| r1(esk8_1(X1)) ),
inference(spm,[status(thm)],[47,45,theory(equality)]) ).
cnf(57,plain,
( ~ r2(X1,X2)
| ~ r1(X2) ),
inference(er,[status(thm)],[39,theory(equality)]) ).
cnf(58,plain,
r2(X1,esk4_1(X1)),
inference(er,[status(thm)],[27,theory(equality)]) ).
cnf(61,negated_conjecture,
( esk8_1(X1) = X1
| r2(esk7_1(X1),X1) ),
inference(spm,[status(thm)],[46,44,theory(equality)]) ).
cnf(63,plain,
( X1 = X2
| ~ r2(X2,X3)
| ~ r2(X1,X3) ),
inference(er,[status(thm)],[22,theory(equality)]) ).
cnf(72,negated_conjecture,
( r1(esk8_1(X1))
| ~ r1(esk6_1(X1)) ),
inference(spm,[status(thm)],[57,47,theory(equality)]) ).
cnf(76,negated_conjecture,
( r1(esk8_1(X1))
| ~ r1(X1) ),
inference(spm,[status(thm)],[72,45,theory(equality)]) ).
cnf(78,negated_conjecture,
( esk5_0 = esk8_1(X1)
| ~ r1(X1) ),
inference(spm,[status(thm)],[35,76,theory(equality)]) ).
cnf(81,plain,
~ r1(esk4_1(X1)),
inference(spm,[status(thm)],[57,58,theory(equality)]) ).
cnf(98,negated_conjecture,
( r2(esk5_0,X1)
| r1(esk8_1(X1)) ),
inference(spm,[status(thm)],[53,51,theory(equality)]) ).
cnf(135,negated_conjecture,
( esk8_1(X1) = X1
| r2(esk5_0,X1) ),
inference(spm,[status(thm)],[61,52,theory(equality)]) ).
cnf(156,negated_conjecture,
( X1 = esk5_0
| r2(esk5_0,X1)
| ~ r1(X1) ),
inference(spm,[status(thm)],[78,135,theory(equality)]) ).
cnf(157,negated_conjecture,
( r2(esk5_0,X1)
| r1(X1) ),
inference(spm,[status(thm)],[98,135,theory(equality)]) ).
cnf(160,negated_conjecture,
( esk4_1(esk5_0) = X1
| r1(X1) ),
inference(spm,[status(thm)],[28,157,theory(equality)]) ).
cnf(169,negated_conjecture,
( X1 = esk5_0
| r2(esk5_0,X1) ),
inference(csr,[status(thm)],[156,157]) ).
cnf(170,negated_conjecture,
( esk4_1(esk5_0) = X1
| X1 = esk5_0 ),
inference(spm,[status(thm)],[28,169,theory(equality)]) ).
cnf(286,negated_conjecture,
( X2 = X1
| X1 = esk5_0
| r1(X2) ),
inference(spm,[status(thm)],[170,160,theory(equality)]) ).
cnf(370,negated_conjecture,
( r1(X1)
| X3 = X2
| r1(X3)
| X2 != X1 ),
inference(spm,[status(thm)],[34,286,theory(equality)]) ).
cnf(508,negated_conjecture,
( r1(X1)
| X2 = X1
| r1(X2) ),
inference(er,[status(thm)],[370,theory(equality)]) ).
cnf(585,negated_conjecture,
( r2(X1,X2)
| r1(esk4_1(X1))
| r1(X3)
| X3 != X2 ),
inference(spm,[status(thm)],[27,508,theory(equality)]) ).
cnf(667,negated_conjecture,
( r2(X1,X2)
| r1(X3)
| X3 != X2 ),
inference(sr,[status(thm)],[585,81,theory(equality)]) ).
cnf(668,negated_conjecture,
( r2(X1,X2)
| r1(X2) ),
inference(er,[status(thm)],[667,theory(equality)]) ).
cnf(681,negated_conjecture,
( esk4_1(X1) = X2
| r1(X2) ),
inference(spm,[status(thm)],[28,668,theory(equality)]) ).
cnf(728,negated_conjecture,
( r2(X1,esk4_1(X2))
| r1(esk4_1(X1)) ),
inference(spm,[status(thm)],[58,681,theory(equality)]) ).
cnf(795,negated_conjecture,
r2(X1,esk4_1(X2)),
inference(sr,[status(thm)],[728,81,theory(equality)]) ).
cnf(873,negated_conjecture,
( X1 = X2
| ~ r2(X1,esk4_1(X3)) ),
inference(spm,[status(thm)],[63,795,theory(equality)]) ).
cnf(891,negated_conjecture,
( X1 = X2
| $false ),
inference(rw,[status(thm)],[873,795,theory(equality)]) ).
cnf(892,negated_conjecture,
X1 = X2,
inference(cn,[status(thm)],[891,theory(equality)]) ).
cnf(927,plain,
r1(X1),
inference(sr,[status(thm)],[34,892,theory(equality)]) ).
cnf(930,plain,
$false,
inference(rw,[status(thm)],[81,927,theory(equality)]) ).
cnf(931,plain,
$false,
inference(cn,[status(thm)],[930,theory(equality)]) ).
cnf(932,plain,
$false,
931,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUN068+2 : TPTP v7.3.0. Released v7.3.0.
% 0.00/0.05 % Command : sine.py -e eprover -t %d %s
% 0.03/0.24 % Computer : n191.star.cs.uiowa.edu
% 0.03/0.24 % Model : x86_64 x86_64
% 0.03/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.24 % Memory : 32218.5MB
% 0.03/0.24 % OS : Linux 3.10.0-862.11.6.el7.x86_64
% 0.03/0.24 % CPULimit : 300
% 0.03/0.25 % DateTime : Sat Feb 23 19:45:28 CST 2019
% 0.03/0.25 % CPUTime :
% 0.03/0.29 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.29 --creating new selector for [NUM008+0.ax]
% 0.07/0.38 -running prover on /export/starexec/sandbox2/tmp/tmpUgKYCi/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.38 -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox2/tmp/tmpUgKYCi/sel_theBenchmark.p_1']
% 0.07/0.38 -prover status Theorem
% 0.07/0.38 Problem theBenchmark.p solved in phase 0.
% 0.07/0.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.38 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.38 Solved 1 out of 1.
% 0.07/0.38 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.38 # SZS status Theorem
% 0.07/0.38 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.38 # SZS output end CNFRefutation
%------------------------------------------------------------------------------