TSTP Solution File: NUN060+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUN060+2 : TPTP v7.3.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sine.py -e eprover -t %d %s
% Computer : n192.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:04 EST 2019
% Result : Theorem 0.08s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 47 ( 11 unt; 0 def)
% Number of atoms : 177 ( 7 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 220 ( 90 ~; 67 |; 63 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-2 aty)
% Number of variables : 150 ( 11 sgn 63 !; 37 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
? [X2] :
! [X3] :
( ( ~ r2(X1,X3)
& ~ equal(X3,X2) )
| ( r2(X1,X3)
& equal(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmpVMg5SZ/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/sandbox2/tmp/tmpVMg5SZ/sel_theBenchmark.p_1',axiom_3) ).
fof(5,axiom,
? [X16] :
! [X17] :
( ( ~ r1(X17)
& ~ equal(X17,X16) )
| ( r1(X17)
& equal(X17,X16) ) ),
file('/export/starexec/sandbox2/tmp/tmpVMg5SZ/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/sandbox2/tmp/tmpVMg5SZ/sel_theBenchmark.p_1',axiom_1a) ).
fof(7,axiom,
! [X24] :
? [X25] :
( ? [X26] :
( r1(X26)
& r3(X24,X26,X25) )
& equal(X25,X24) ),
file('/export/starexec/sandbox2/tmp/tmpVMg5SZ/sel_theBenchmark.p_1',axiom_4a) ).
fof(9,conjecture,
? [X10,X30,X31] :
( equal(X31,X10)
& ? [X20] :
( r3(X30,X20,X31)
& ? [X21] :
( r2(X21,X20)
& ? [X32] :
( r2(X32,X21)
& ? [X23] :
( r2(X23,X32)
& ? [X33] :
( r1(X33)
& r2(X33,X23) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpVMg5SZ/sel_theBenchmark.p_1',greq4) ).
fof(10,negated_conjecture,
~ ? [X10,X30,X31] :
( equal(X31,X10)
& ? [X20] :
( r3(X30,X20,X31)
& ? [X21] :
( r2(X21,X20)
& ? [X32] :
( r2(X32,X21)
& ? [X23] :
( r2(X23,X32)
& ? [X33] :
( r1(X33)
& r2(X33,X23) ) ) ) ) ) ),
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(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(33,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(34,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)],[33]) ).
fof(35,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)],[34]) ).
cnf(37,plain,
( r3(X2,X3,X1)
| X1 != esk5_2(X2,X3) ),
inference(split_conjunct,[status(thm)],[35]) ).
cnf(38,plain,
( X3 = esk5_2(X1,X2)
| ~ r3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[35]) ).
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(47,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(48,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)],[47]) ).
cnf(49,plain,
r3(X1,X2,esk10_2(X1,X2)),
inference(split_conjunct,[status(thm)],[48]) ).
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(58,plain,
r1(esk12_1(X1)),
inference(split_conjunct,[status(thm)],[55]) ).
fof(62,negated_conjecture,
! [X10,X30,X31] :
( ~ equal(X31,X10)
| ! [X20] :
( ~ r3(X30,X20,X31)
| ! [X21] :
( ~ r2(X21,X20)
| ! [X32] :
( ~ r2(X32,X21)
| ! [X23] :
( ~ r2(X23,X32)
| ! [X33] :
( ~ r1(X33)
| ~ r2(X33,X23) ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(63,negated_conjecture,
! [X34,X35,X36] :
( ~ equal(X36,X34)
| ! [X37] :
( ~ r3(X35,X37,X36)
| ! [X38] :
( ~ r2(X38,X37)
| ! [X39] :
( ~ r2(X39,X38)
| ! [X40] :
( ~ r2(X40,X39)
| ! [X41] :
( ~ r1(X41)
| ~ r2(X41,X40) ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[62]) ).
fof(64,negated_conjecture,
! [X34,X35,X36,X37,X38,X39,X40,X41] :
( ~ r1(X41)
| ~ r2(X41,X40)
| ~ r2(X40,X39)
| ~ r2(X39,X38)
| ~ r2(X38,X37)
| ~ r3(X35,X37,X36)
| ~ equal(X36,X34) ),
inference(shift_quantors,[status(thm)],[63]) ).
cnf(65,negated_conjecture,
( X1 != X2
| ~ r3(X3,X4,X1)
| ~ r2(X5,X4)
| ~ r2(X6,X5)
| ~ r2(X7,X6)
| ~ r2(X8,X7)
| ~ r1(X8) ),
inference(split_conjunct,[status(thm)],[64]) ).
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(75,plain,
r3(X1,X2,esk5_2(X1,X2)),
inference(er,[status(thm)],[37,theory(equality)]) ).
cnf(77,plain,
esk5_2(X1,X2) = esk10_2(X1,X2),
inference(spm,[status(thm)],[38,49,theory(equality)]) ).
cnf(84,negated_conjecture,
( ~ r3(X1,X2,X3)
| ~ r1(X4)
| ~ r2(X4,X5)
| ~ r2(X5,X6)
| ~ r2(X6,X7)
| ~ r2(X7,X2) ),
inference(er,[status(thm)],[65,theory(equality)]) ).
cnf(92,plain,
r1(esk6_0),
inference(rw,[status(thm)],[58,68,theory(equality)]) ).
cnf(105,plain,
r3(X1,X2,esk10_2(X1,X2)),
inference(rw,[status(thm)],[75,77,theory(equality)]) ).
cnf(246,negated_conjecture,
( ~ r1(X3)
| ~ r2(X3,X4)
| ~ r2(X4,X5)
| ~ r2(X5,X6)
| ~ r2(X6,X2) ),
inference(spm,[status(thm)],[84,105,theory(equality)]) ).
cnf(263,negated_conjecture,
( ~ r1(X1)
| ~ r2(esk1_1(X1),X2)
| ~ r2(X2,X3)
| ~ r2(X3,X4) ),
inference(spm,[status(thm)],[246,70,theory(equality)]) ).
cnf(269,negated_conjecture,
( ~ r1(X1)
| ~ r2(esk1_1(esk1_1(X1)),X2)
| ~ r2(X2,X3) ),
inference(spm,[status(thm)],[263,70,theory(equality)]) ).
cnf(295,negated_conjecture,
( ~ r1(X1)
| ~ r2(esk1_1(esk1_1(esk1_1(X1))),X2) ),
inference(spm,[status(thm)],[269,70,theory(equality)]) ).
cnf(301,negated_conjecture,
~ r1(X1),
inference(spm,[status(thm)],[295,70,theory(equality)]) ).
cnf(316,plain,
$false,
inference(sr,[status(thm)],[92,301,theory(equality)]) ).
cnf(317,plain,
$false,
316,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUN060+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 : n192.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 17:52:00 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.08/0.37 -running prover on /export/starexec/sandbox2/tmp/tmpVMg5SZ/sel_theBenchmark.p_1 with time limit 29
% 0.08/0.37 -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/tmpVMg5SZ/sel_theBenchmark.p_1']
% 0.08/0.37 -prover status Theorem
% 0.08/0.37 Problem theBenchmark.p solved in phase 0.
% 0.08/0.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.37 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.37 Solved 1 out of 1.
% 0.08/0.37 # Problem is unsatisfiable (or provable), constructing proof object
% 0.08/0.37 # SZS status Theorem
% 0.08/0.37 # SZS output start CNFRefutation.
% See solution above
% 0.08/0.38 # SZS output end CNFRefutation
%------------------------------------------------------------------------------