TSTP Solution File: NUN085+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUN085+2 : TPTP v7.3.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sine.py -e eprover -t %d %s
% Computer : n183.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 : 23
% Number of leaves : 7
% Syntax : Number of formulae : 86 ( 44 unt; 0 def)
% Number of atoms : 211 ( 28 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 209 ( 84 ~; 59 |; 66 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 146 ( 6 sgn 66 !; 31 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
? [X2] :
! [X3] :
( ( ~ r2(X1,X3)
& ~ equal(X3,X2) )
| ( r2(X1,X3)
& equal(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmpL1wLEe/sel_theBenchmark.p_1',axiom_2) ).
fof(4,axiom,
! [X12,X13] :
? [X14] :
! [X15] :
( ( ~ r3(X12,X13,X15)
& ~ equal(X15,X14) )
| ( r3(X12,X13,X15)
& equal(X15,X14) ) ),
file('/export/starexec/sandbox/tmp/tmpL1wLEe/sel_theBenchmark.p_1',axiom_3) ).
fof(5,axiom,
? [X16] :
! [X17] :
( ( ~ r1(X17)
& ~ equal(X17,X16) )
| ( r1(X17)
& equal(X17,X16) ) ),
file('/export/starexec/sandbox/tmp/tmpL1wLEe/sel_theBenchmark.p_1',axiom_1) ).
fof(6,axiom,
! [X18,X19] :
? [X20] :
( ? [X21] :
( ? [X22] :
( r2(X19,X22)
& r3(X18,X22,X21) )
& equal(X21,X20) )
& ? [X23] :
( r2(X23,X20)
& r3(X18,X19,X23) ) ),
file('/export/starexec/sandbox/tmp/tmpL1wLEe/sel_theBenchmark.p_1',axiom_1a) ).
fof(7,axiom,
! [X24] :
? [X25] :
( ? [X26] :
( r1(X26)
& r3(X24,X26,X25) )
& equal(X25,X24) ),
file('/export/starexec/sandbox/tmp/tmpL1wLEe/sel_theBenchmark.p_1',axiom_4a) ).
fof(8,axiom,
! [X27,X28] :
( ! [X29] :
( ~ r1(X29)
| ~ equal(X29,X28) )
| ~ r2(X27,X28) ),
file('/export/starexec/sandbox/tmp/tmpL1wLEe/sel_theBenchmark.p_1',axiom_7a) ).
fof(9,conjecture,
! [X10] :
( ! [X30] :
( ! [X31] :
( ~ r1(X31)
| ~ r3(X31,X30,X10) )
| ! [X20] :
( ~ r1(X20)
| ~ r2(X20,X30) ) )
| ! [X21] :
( ~ equal(X10,X21)
| ~ r1(X21) ) ),
file('/export/starexec/sandbox/tmp/tmpL1wLEe/sel_theBenchmark.p_1',zeroplusoneidzero) ).
fof(10,negated_conjecture,
~ ! [X10] :
( ! [X30] :
( ! [X31] :
( ~ r1(X31)
| ~ r3(X31,X30,X10) )
| ! [X20] :
( ~ r1(X20)
| ~ r2(X20,X30) ) )
| ! [X21] :
( ~ equal(X10,X21)
| ~ r1(X21) ) ),
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(13,plain,
! [X12,X13] :
? [X14] :
! [X15] :
( ( ~ r3(X12,X13,X15)
& ~ equal(X15,X14) )
| ( r3(X12,X13,X15)
& equal(X15,X14) ) ),
inference(fof_simplification,[status(thm)],[4,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(15,plain,
! [X27,X28] :
( ! [X29] :
( ~ r1(X29)
| ~ equal(X29,X28) )
| ~ r2(X27,X28) ),
inference(fof_simplification,[status(thm)],[8,theory(equality)]) ).
fof(16,negated_conjecture,
~ ! [X10] :
( ! [X30] :
( ! [X31] :
( ~ r1(X31)
| ~ r3(X31,X30,X10) )
| ! [X20] :
( ~ r1(X20)
| ~ r2(X20,X30) ) )
| ! [X21] :
( ~ equal(X10,X21)
| ~ r1(X21) ) ),
inference(fof_simplification,[status(thm)],[10,theory(equality)]) ).
fof(17,plain,
! [X4] :
? [X5] :
! [X6] :
( ( ~ r2(X4,X6)
& ~ equal(X6,X5) )
| ( r2(X4,X6)
& equal(X6,X5) ) ),
inference(variable_rename,[status(thm)],[11]) ).
fof(18,plain,
! [X4,X6] :
( ( ~ r2(X4,X6)
& ~ equal(X6,esk1_1(X4)) )
| ( r2(X4,X6)
& equal(X6,esk1_1(X4)) ) ),
inference(skolemize,[status(esa)],[17]) ).
fof(19,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)],[18]) ).
cnf(22,plain,
( X2 = esk1_1(X1)
| ~ r2(X1,X2) ),
inference(split_conjunct,[status(thm)],[19]) ).
fof(34,plain,
! [X16,X17] :
? [X18] :
! [X19] :
( ( ~ r3(X16,X17,X19)
& ~ equal(X19,X18) )
| ( r3(X16,X17,X19)
& equal(X19,X18) ) ),
inference(variable_rename,[status(thm)],[13]) ).
fof(35,plain,
! [X16,X17,X19] :
( ( ~ r3(X16,X17,X19)
& ~ equal(X19,esk5_2(X16,X17)) )
| ( r3(X16,X17,X19)
& equal(X19,esk5_2(X16,X17)) ) ),
inference(skolemize,[status(esa)],[34]) ).
fof(36,plain,
! [X16,X17,X19] :
( ( r3(X16,X17,X19)
| ~ r3(X16,X17,X19) )
& ( equal(X19,esk5_2(X16,X17))
| ~ r3(X16,X17,X19) )
& ( r3(X16,X17,X19)
| ~ equal(X19,esk5_2(X16,X17)) )
& ( equal(X19,esk5_2(X16,X17))
| ~ equal(X19,esk5_2(X16,X17)) ) ),
inference(distribute,[status(thm)],[35]) ).
cnf(39,plain,
( X3 = esk5_2(X1,X2)
| ~ r3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[36]) ).
fof(41,plain,
? [X18] :
! [X19] :
( ( ~ r1(X19)
& ~ equal(X19,X18) )
| ( r1(X19)
& equal(X19,X18) ) ),
inference(variable_rename,[status(thm)],[14]) ).
fof(42,plain,
! [X19] :
( ( ~ r1(X19)
& ~ equal(X19,esk6_0) )
| ( r1(X19)
& equal(X19,esk6_0) ) ),
inference(skolemize,[status(esa)],[41]) ).
fof(43,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)],[42]) ).
cnf(45,plain,
( r1(X1)
| X1 != esk6_0 ),
inference(split_conjunct,[status(thm)],[43]) ).
cnf(46,plain,
( X1 = esk6_0
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[43]) ).
fof(48,plain,
! [X24,X25] :
? [X26] :
( ? [X27] :
( ? [X28] :
( r2(X25,X28)
& r3(X24,X28,X27) )
& equal(X27,X26) )
& ? [X29] :
( r2(X29,X26)
& r3(X24,X25,X29) ) ),
inference(variable_rename,[status(thm)],[6]) ).
fof(49,plain,
! [X24,X25] :
( r2(X25,esk9_2(X24,X25))
& r3(X24,esk9_2(X24,X25),esk8_2(X24,X25))
& equal(esk8_2(X24,X25),esk7_2(X24,X25))
& r2(esk10_2(X24,X25),esk7_2(X24,X25))
& r3(X24,X25,esk10_2(X24,X25)) ),
inference(skolemize,[status(esa)],[48]) ).
cnf(50,plain,
r3(X1,X2,esk10_2(X1,X2)),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(51,plain,
r2(esk10_2(X1,X2),esk7_2(X1,X2)),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(52,plain,
esk8_2(X1,X2) = esk7_2(X1,X2),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(53,plain,
r3(X1,esk9_2(X1,X2),esk8_2(X1,X2)),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(54,plain,
r2(X1,esk9_2(X2,X1)),
inference(split_conjunct,[status(thm)],[49]) ).
fof(55,plain,
! [X27] :
? [X28] :
( ? [X29] :
( r1(X29)
& r3(X27,X29,X28) )
& equal(X28,X27) ),
inference(variable_rename,[status(thm)],[7]) ).
fof(56,plain,
! [X27] :
( r1(esk12_1(X27))
& r3(X27,esk12_1(X27),esk11_1(X27))
& equal(esk11_1(X27),X27) ),
inference(skolemize,[status(esa)],[55]) ).
cnf(57,plain,
esk11_1(X1) = X1,
inference(split_conjunct,[status(thm)],[56]) ).
cnf(58,plain,
r3(X1,esk12_1(X1),esk11_1(X1)),
inference(split_conjunct,[status(thm)],[56]) ).
cnf(59,plain,
r1(esk12_1(X1)),
inference(split_conjunct,[status(thm)],[56]) ).
fof(60,plain,
! [X30,X31] :
( ! [X32] :
( ~ r1(X32)
| ~ equal(X32,X31) )
| ~ r2(X30,X31) ),
inference(variable_rename,[status(thm)],[15]) ).
fof(61,plain,
! [X30,X31,X32] :
( ~ r1(X32)
| ~ equal(X32,X31)
| ~ r2(X30,X31) ),
inference(shift_quantors,[status(thm)],[60]) ).
cnf(62,plain,
( ~ r2(X1,X2)
| X3 != X2
| ~ r1(X3) ),
inference(split_conjunct,[status(thm)],[61]) ).
fof(63,negated_conjecture,
? [X10] :
( ? [X30] :
( ? [X31] :
( r1(X31)
& r3(X31,X30,X10) )
& ? [X20] :
( r1(X20)
& r2(X20,X30) ) )
& ? [X21] :
( equal(X10,X21)
& r1(X21) ) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(64,negated_conjecture,
? [X32] :
( ? [X33] :
( ? [X34] :
( r1(X34)
& r3(X34,X33,X32) )
& ? [X35] :
( r1(X35)
& r2(X35,X33) ) )
& ? [X36] :
( equal(X32,X36)
& r1(X36) ) ),
inference(variable_rename,[status(thm)],[63]) ).
fof(65,negated_conjecture,
( r1(esk15_0)
& r3(esk15_0,esk14_0,esk13_0)
& r1(esk16_0)
& r2(esk16_0,esk14_0)
& equal(esk13_0,esk17_0)
& r1(esk17_0) ),
inference(skolemize,[status(esa)],[64]) ).
cnf(66,negated_conjecture,
r1(esk17_0),
inference(split_conjunct,[status(thm)],[65]) ).
cnf(67,negated_conjecture,
esk13_0 = esk17_0,
inference(split_conjunct,[status(thm)],[65]) ).
cnf(68,negated_conjecture,
r2(esk16_0,esk14_0),
inference(split_conjunct,[status(thm)],[65]) ).
cnf(69,negated_conjecture,
r1(esk16_0),
inference(split_conjunct,[status(thm)],[65]) ).
cnf(70,negated_conjecture,
r3(esk15_0,esk14_0,esk13_0),
inference(split_conjunct,[status(thm)],[65]) ).
cnf(71,negated_conjecture,
r1(esk15_0),
inference(split_conjunct,[status(thm)],[65]) ).
cnf(72,plain,
r3(X1,esk12_1(X1),X1),
inference(rw,[status(thm)],[58,57,theory(equality)]),
[unfolding] ).
cnf(73,plain,
r3(X1,esk9_2(X1,X2),esk7_2(X1,X2)),
inference(rw,[status(thm)],[53,52,theory(equality)]),
[unfolding] ).
cnf(74,negated_conjecture,
r1(esk13_0),
inference(rw,[status(thm)],[66,67,theory(equality)]) ).
cnf(75,negated_conjecture,
esk6_0 = esk15_0,
inference(spm,[status(thm)],[46,71,theory(equality)]) ).
cnf(79,plain,
( ~ r1(X1)
| ~ r2(X2,X1) ),
inference(er,[status(thm)],[62,theory(equality)]) ).
cnf(82,plain,
esk1_1(X1) = esk9_2(X2,X1),
inference(spm,[status(thm)],[22,54,theory(equality)]) ).
cnf(88,plain,
esk5_2(X1,X2) = esk10_2(X1,X2),
inference(spm,[status(thm)],[39,50,theory(equality)]) ).
cnf(96,plain,
( esk15_0 = X1
| ~ r1(X1) ),
inference(rw,[status(thm)],[46,75,theory(equality)]) ).
cnf(97,plain,
( r1(X1)
| esk15_0 != X1 ),
inference(rw,[status(thm)],[45,75,theory(equality)]) ).
cnf(98,negated_conjecture,
esk15_0 = esk16_0,
inference(spm,[status(thm)],[96,69,theory(equality)]) ).
cnf(100,negated_conjecture,
esk15_0 = esk13_0,
inference(spm,[status(thm)],[96,74,theory(equality)]) ).
cnf(102,negated_conjecture,
~ r1(esk14_0),
inference(spm,[status(thm)],[79,68,theory(equality)]) ).
cnf(107,negated_conjecture,
r2(esk15_0,esk14_0),
inference(rw,[status(thm)],[68,98,theory(equality)]) ).
cnf(114,negated_conjecture,
r3(esk13_0,esk14_0,esk13_0),
inference(rw,[status(thm)],[70,100,theory(equality)]) ).
cnf(117,plain,
( esk13_0 = X1
| ~ r1(X1) ),
inference(rw,[status(thm)],[96,100,theory(equality)]) ).
cnf(118,negated_conjecture,
r2(esk13_0,esk14_0),
inference(rw,[status(thm)],[107,100,theory(equality)]) ).
cnf(119,negated_conjecture,
esk1_1(esk13_0) = esk14_0,
inference(spm,[status(thm)],[22,118,theory(equality)]) ).
cnf(121,negated_conjecture,
esk5_2(esk13_0,esk14_0) = esk13_0,
inference(spm,[status(thm)],[39,114,theory(equality)]) ).
cnf(122,plain,
( r1(X1)
| esk13_0 != X1 ),
inference(rw,[status(thm)],[97,100,theory(equality)]) ).
cnf(123,negated_conjecture,
esk13_0 != esk14_0,
inference(spm,[status(thm)],[102,122,theory(equality)]) ).
cnf(127,plain,
esk13_0 = esk12_1(X1),
inference(spm,[status(thm)],[117,59,theory(equality)]) ).
cnf(134,plain,
r3(X1,esk1_1(X2),esk7_2(X1,X2)),
inference(rw,[status(thm)],[73,82,theory(equality)]) ).
cnf(142,plain,
r3(X1,esk13_0,X1),
inference(rw,[status(thm)],[72,127,theory(equality)]) ).
cnf(148,plain,
esk5_2(X1,esk13_0) = X1,
inference(spm,[status(thm)],[39,142,theory(equality)]) ).
cnf(174,plain,
esk10_2(X1,esk13_0) = X1,
inference(rw,[status(thm)],[148,88,theory(equality)]) ).
cnf(175,negated_conjecture,
esk10_2(esk13_0,esk14_0) = esk13_0,
inference(rw,[status(thm)],[121,88,theory(equality)]) ).
cnf(176,plain,
( esk10_2(X1,X2) = X3
| ~ r3(X1,X2,X3) ),
inference(rw,[status(thm)],[39,88,theory(equality)]) ).
cnf(189,plain,
r2(X1,esk7_2(X1,esk13_0)),
inference(spm,[status(thm)],[51,174,theory(equality)]) ).
cnf(201,plain,
esk1_1(X1) = esk7_2(X1,esk13_0),
inference(spm,[status(thm)],[22,189,theory(equality)]) ).
cnf(232,plain,
r3(X1,esk1_1(esk13_0),esk1_1(X1)),
inference(spm,[status(thm)],[134,201,theory(equality)]) ).
cnf(238,plain,
r3(X1,esk14_0,esk1_1(X1)),
inference(rw,[status(thm)],[232,119,theory(equality)]) ).
cnf(254,negated_conjecture,
r3(esk13_0,esk14_0,esk14_0),
inference(spm,[status(thm)],[238,119,theory(equality)]) ).
cnf(268,negated_conjecture,
esk10_2(esk13_0,esk14_0) = esk14_0,
inference(spm,[status(thm)],[176,254,theory(equality)]) ).
cnf(269,negated_conjecture,
esk13_0 = esk14_0,
inference(rw,[status(thm)],[268,175,theory(equality)]) ).
cnf(270,negated_conjecture,
$false,
inference(sr,[status(thm)],[269,123,theory(equality)]) ).
cnf(271,negated_conjecture,
$false,
270,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUN085+2 : TPTP v7.3.0. Released v7.3.0.
% 0.03/0.05 % Command : sine.py -e eprover -t %d %s
% 0.03/0.25 % Computer : n183.star.cs.uiowa.edu
% 0.03/0.25 % Model : x86_64 x86_64
% 0.03/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.25 % Memory : 32218.5MB
% 0.03/0.25 % OS : Linux 3.10.0-862.11.6.el7.x86_64
% 0.03/0.25 % CPULimit : 300
% 0.03/0.25 % DateTime : Sun Feb 24 01:48:28 CST 2019
% 0.03/0.25 % CPUTime :
% 0.09/0.30 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.30 --creating new selector for [NUM008+0.ax]
% 0.09/0.40 -running prover on /export/starexec/sandbox/tmp/tmpL1wLEe/sel_theBenchmark.p_1 with time limit 29
% 0.09/0.40 -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/tmpL1wLEe/sel_theBenchmark.p_1']
% 0.09/0.40 -prover status Theorem
% 0.09/0.40 Problem theBenchmark.p solved in phase 0.
% 0.09/0.40 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.40 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.40 Solved 1 out of 1.
% 0.09/0.40 # Problem is unsatisfiable (or provable), constructing proof object
% 0.09/0.40 # SZS status Theorem
% 0.09/0.40 # SZS output start CNFRefutation.
% See solution above
% 0.09/0.40 # SZS output end CNFRefutation
%------------------------------------------------------------------------------