TSTP Solution File: NUN076+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUN076+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:08 EST 2019
% Result : Theorem 0.08s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 59 ( 23 unt; 0 def)
% Number of atoms : 186 ( 13 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 217 ( 90 ~; 67 |; 60 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-2 aty)
% Number of variables : 155 ( 16 sgn 60 !; 35 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
? [X2] :
! [X3] :
( ( ~ r2(X1,X3)
& ~ equal(X3,X2) )
| ( r2(X1,X3)
& equal(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmpcqBYMY/sel_theBenchmark.p_1',axiom_2) ).
fof(6,axiom,
? [X22] :
! [X23] :
( ( ~ r1(X23)
& ~ equal(X23,X22) )
| ( r1(X23)
& equal(X23,X22) ) ),
file('/export/starexec/sandbox2/tmp/tmpcqBYMY/sel_theBenchmark.p_1',axiom_1) ).
fof(8,axiom,
! [X30,X31] :
? [X32] :
! [X33] :
( ( ~ r4(X30,X31,X33)
& ~ equal(X33,X32) )
| ( r4(X30,X31,X33)
& equal(X33,X32) ) ),
file('/export/starexec/sandbox2/tmp/tmpcqBYMY/sel_theBenchmark.p_1',axiom_4) ).
fof(9,axiom,
! [X34] :
? [X35] :
( ? [X36] :
( r1(X36)
& r4(X34,X36,X35) )
& ? [X37] :
( r1(X37)
& equal(X35,X37) ) ),
file('/export/starexec/sandbox2/tmp/tmpcqBYMY/sel_theBenchmark.p_1',axiom_5a) ).
fof(10,axiom,
! [X38] :
? [X39] :
( ? [X40] :
( r1(X40)
& r3(X38,X40,X39) )
& equal(X39,X38) ),
file('/export/starexec/sandbox2/tmp/tmpcqBYMY/sel_theBenchmark.p_1',axiom_4a) ).
fof(12,conjecture,
? [X16,X10,X11] :
( ? [X26] :
( equal(X26,X16)
& ? [X13] :
( r4(X13,X10,X26)
& ? [X29] :
( r2(X29,X13)
& ? [X35] :
( r1(X35)
& r2(X35,X29) ) ) ) )
& ? [X27] :
( r3(X10,X11,X27)
& equal(X27,X16) ) ),
file('/export/starexec/sandbox2/tmp/tmpcqBYMY/sel_theBenchmark.p_1',thereexistsanevennumber) ).
fof(13,negated_conjecture,
~ ? [X16,X10,X11] :
( ? [X26] :
( equal(X26,X16)
& ? [X13] :
( r4(X13,X10,X26)
& ? [X29] :
( r2(X29,X13)
& ? [X35] :
( r1(X35)
& r2(X35,X29) ) ) ) )
& ? [X27] :
( r3(X10,X11,X27)
& equal(X27,X16) ) ),
inference(assume_negation,[status(cth)],[12]) ).
fof(14,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(17,plain,
? [X22] :
! [X23] :
( ( ~ r1(X23)
& ~ equal(X23,X22) )
| ( r1(X23)
& equal(X23,X22) ) ),
inference(fof_simplification,[status(thm)],[6,theory(equality)]) ).
fof(18,plain,
! [X30,X31] :
? [X32] :
! [X33] :
( ( ~ r4(X30,X31,X33)
& ~ equal(X33,X32) )
| ( r4(X30,X31,X33)
& equal(X33,X32) ) ),
inference(fof_simplification,[status(thm)],[8,theory(equality)]) ).
fof(20,plain,
! [X4] :
? [X5] :
! [X6] :
( ( ~ r2(X4,X6)
& ~ equal(X6,X5) )
| ( r2(X4,X6)
& equal(X6,X5) ) ),
inference(variable_rename,[status(thm)],[14]) ).
fof(21,plain,
! [X4,X6] :
( ( ~ r2(X4,X6)
& ~ equal(X6,esk1_1(X4)) )
| ( r2(X4,X6)
& equal(X6,esk1_1(X4)) ) ),
inference(skolemize,[status(esa)],[20]) ).
fof(22,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)],[21]) ).
cnf(24,plain,
( r2(X2,X1)
| X1 != esk1_1(X2) ),
inference(split_conjunct,[status(thm)],[22]) ).
fof(51,plain,
? [X24] :
! [X25] :
( ( ~ r1(X25)
& ~ equal(X25,X24) )
| ( r1(X25)
& equal(X25,X24) ) ),
inference(variable_rename,[status(thm)],[17]) ).
fof(52,plain,
! [X25] :
( ( ~ r1(X25)
& ~ equal(X25,esk10_0) )
| ( r1(X25)
& equal(X25,esk10_0) ) ),
inference(skolemize,[status(esa)],[51]) ).
fof(53,plain,
! [X25] :
( ( r1(X25)
| ~ r1(X25) )
& ( equal(X25,esk10_0)
| ~ r1(X25) )
& ( r1(X25)
| ~ equal(X25,esk10_0) )
& ( equal(X25,esk10_0)
| ~ equal(X25,esk10_0) ) ),
inference(distribute,[status(thm)],[52]) ).
cnf(56,plain,
( X1 = esk10_0
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[53]) ).
fof(65,plain,
! [X34,X35] :
? [X36] :
! [X37] :
( ( ~ r4(X34,X35,X37)
& ~ equal(X37,X36) )
| ( r4(X34,X35,X37)
& equal(X37,X36) ) ),
inference(variable_rename,[status(thm)],[18]) ).
fof(66,plain,
! [X34,X35,X37] :
( ( ~ r4(X34,X35,X37)
& ~ equal(X37,esk15_2(X34,X35)) )
| ( r4(X34,X35,X37)
& equal(X37,esk15_2(X34,X35)) ) ),
inference(skolemize,[status(esa)],[65]) ).
fof(67,plain,
! [X34,X35,X37] :
( ( r4(X34,X35,X37)
| ~ r4(X34,X35,X37) )
& ( equal(X37,esk15_2(X34,X35))
| ~ r4(X34,X35,X37) )
& ( r4(X34,X35,X37)
| ~ equal(X37,esk15_2(X34,X35)) )
& ( equal(X37,esk15_2(X34,X35))
| ~ equal(X37,esk15_2(X34,X35)) ) ),
inference(distribute,[status(thm)],[66]) ).
cnf(69,plain,
( r4(X2,X3,X1)
| X1 != esk15_2(X2,X3) ),
inference(split_conjunct,[status(thm)],[67]) ).
cnf(70,plain,
( X3 = esk15_2(X1,X2)
| ~ r4(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[67]) ).
fof(72,plain,
! [X38] :
? [X39] :
( ? [X40] :
( r1(X40)
& r4(X38,X40,X39) )
& ? [X41] :
( r1(X41)
& equal(X39,X41) ) ),
inference(variable_rename,[status(thm)],[9]) ).
fof(73,plain,
! [X38] :
( r1(esk17_1(X38))
& r4(X38,esk17_1(X38),esk16_1(X38))
& r1(esk18_1(X38))
& equal(esk16_1(X38),esk18_1(X38)) ),
inference(skolemize,[status(esa)],[72]) ).
cnf(74,plain,
esk16_1(X1) = esk18_1(X1),
inference(split_conjunct,[status(thm)],[73]) ).
cnf(75,plain,
r1(esk18_1(X1)),
inference(split_conjunct,[status(thm)],[73]) ).
cnf(76,plain,
r4(X1,esk17_1(X1),esk16_1(X1)),
inference(split_conjunct,[status(thm)],[73]) ).
cnf(77,plain,
r1(esk17_1(X1)),
inference(split_conjunct,[status(thm)],[73]) ).
fof(78,plain,
! [X41] :
? [X42] :
( ? [X43] :
( r1(X43)
& r3(X41,X43,X42) )
& equal(X42,X41) ),
inference(variable_rename,[status(thm)],[10]) ).
fof(79,plain,
! [X41] :
( r1(esk20_1(X41))
& r3(X41,esk20_1(X41),esk19_1(X41))
& equal(esk19_1(X41),X41) ),
inference(skolemize,[status(esa)],[78]) ).
cnf(80,plain,
esk19_1(X1) = X1,
inference(split_conjunct,[status(thm)],[79]) ).
cnf(81,plain,
r3(X1,esk20_1(X1),esk19_1(X1)),
inference(split_conjunct,[status(thm)],[79]) ).
cnf(82,plain,
r1(esk20_1(X1)),
inference(split_conjunct,[status(thm)],[79]) ).
fof(86,negated_conjecture,
! [X16,X10,X11] :
( ! [X26] :
( ~ equal(X26,X16)
| ! [X13] :
( ~ r4(X13,X10,X26)
| ! [X29] :
( ~ r2(X29,X13)
| ! [X35] :
( ~ r1(X35)
| ~ r2(X35,X29) ) ) ) )
| ! [X27] :
( ~ r3(X10,X11,X27)
| ~ equal(X27,X16) ) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(87,negated_conjecture,
! [X36,X37,X38] :
( ! [X39] :
( ~ equal(X39,X36)
| ! [X40] :
( ~ r4(X40,X37,X39)
| ! [X41] :
( ~ r2(X41,X40)
| ! [X42] :
( ~ r1(X42)
| ~ r2(X42,X41) ) ) ) )
| ! [X43] :
( ~ r3(X37,X38,X43)
| ~ equal(X43,X36) ) ),
inference(variable_rename,[status(thm)],[86]) ).
fof(88,negated_conjecture,
! [X36,X37,X38,X39,X40,X41,X42,X43] :
( ~ r3(X37,X38,X43)
| ~ equal(X43,X36)
| ~ r1(X42)
| ~ r2(X42,X41)
| ~ r2(X41,X40)
| ~ r4(X40,X37,X39)
| ~ equal(X39,X36) ),
inference(shift_quantors,[status(thm)],[87]) ).
cnf(89,negated_conjecture,
( X1 != X2
| ~ r4(X3,X4,X1)
| ~ r2(X5,X3)
| ~ r2(X6,X5)
| ~ r1(X6)
| X7 != X2
| ~ r3(X4,X8,X7) ),
inference(split_conjunct,[status(thm)],[88]) ).
cnf(90,plain,
r3(X1,esk20_1(X1),X1),
inference(rw,[status(thm)],[81,80,theory(equality)]),
[unfolding] ).
cnf(91,plain,
r1(esk16_1(X1)),
inference(rw,[status(thm)],[75,74,theory(equality)]),
[unfolding] ).
cnf(94,plain,
esk10_0 = esk16_1(X1),
inference(spm,[status(thm)],[56,91,theory(equality)]) ).
cnf(95,plain,
esk10_0 = esk17_1(X1),
inference(spm,[status(thm)],[56,77,theory(equality)]) ).
cnf(96,plain,
esk10_0 = esk20_1(X1),
inference(spm,[status(thm)],[56,82,theory(equality)]) ).
cnf(99,plain,
r2(X1,esk1_1(X1)),
inference(er,[status(thm)],[24,theory(equality)]) ).
cnf(106,plain,
r4(X1,X2,esk15_2(X1,X2)),
inference(er,[status(thm)],[69,theory(equality)]) ).
cnf(118,negated_conjecture,
( X1 != X2
| ~ r1(X3)
| ~ r3(X4,X5,X2)
| ~ r4(X6,X4,X1)
| ~ r2(X3,X7)
| ~ r2(X7,X6) ),
inference(er,[status(thm)],[89,theory(equality)]) ).
cnf(119,negated_conjecture,
( ~ r1(X1)
| ~ r3(X2,X3,X4)
| ~ r4(X5,X2,X4)
| ~ r2(X1,X6)
| ~ r2(X6,X5) ),
inference(er,[status(thm)],[118,theory(equality)]) ).
cnf(127,plain,
r4(X1,esk17_1(X1),esk10_0),
inference(rw,[status(thm)],[76,94,theory(equality)]) ).
cnf(128,plain,
r1(esk10_0),
inference(rw,[status(thm)],[91,94,theory(equality)]) ).
cnf(131,plain,
r4(X1,esk10_0,esk10_0),
inference(rw,[status(thm)],[127,95,theory(equality)]) ).
cnf(132,plain,
esk15_2(X1,esk10_0) = esk10_0,
inference(spm,[status(thm)],[70,131,theory(equality)]) ).
cnf(133,plain,
r3(X1,esk10_0,X1),
inference(rw,[status(thm)],[90,96,theory(equality)]) ).
cnf(156,plain,
r4(X1,esk10_0,esk10_0),
inference(spm,[status(thm)],[106,132,theory(equality)]) ).
cnf(282,negated_conjecture,
( ~ r1(X1)
| ~ r4(X3,X2,X2)
| ~ r2(X1,X4)
| ~ r2(X4,X3) ),
inference(spm,[status(thm)],[119,133,theory(equality)]) ).
cnf(286,negated_conjecture,
( ~ r1(X1)
| ~ r2(X1,X3)
| ~ r2(X3,X2) ),
inference(spm,[status(thm)],[282,156,theory(equality)]) ).
cnf(289,negated_conjecture,
( ~ r1(X1)
| ~ r2(esk1_1(X1),X2) ),
inference(spm,[status(thm)],[286,99,theory(equality)]) ).
cnf(311,negated_conjecture,
~ r1(X1),
inference(spm,[status(thm)],[289,99,theory(equality)]) ).
cnf(331,plain,
$false,
inference(sr,[status(thm)],[128,311,theory(equality)]) ).
cnf(332,plain,
$false,
331,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUN076+2 : TPTP v7.3.0. Released v7.3.0.
% 0.00/0.05 % Command : sine.py -e eprover -t %d %s
% 0.03/0.25 % Computer : n184.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 : Sat Feb 23 21:28:58 CST 2019
% 0.03/0.25 % CPUTime :
% 0.08/0.30 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.30 --creating new selector for [NUM008+0.ax]
% 0.08/0.39 -running prover on /export/starexec/sandbox2/tmp/tmpcqBYMY/sel_theBenchmark.p_1 with time limit 29
% 0.08/0.39 -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/tmpcqBYMY/sel_theBenchmark.p_1']
% 0.08/0.39 -prover status Theorem
% 0.08/0.39 Problem theBenchmark.p solved in phase 0.
% 0.08/0.39 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.39 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.39 Solved 1 out of 1.
% 0.08/0.39 # Problem is unsatisfiable (or provable), constructing proof object
% 0.08/0.39 # SZS status Theorem
% 0.08/0.39 # SZS output start CNFRefutation.
% See solution above
% 0.08/0.39 # SZS output end CNFRefutation
%------------------------------------------------------------------------------