TSTP Solution File: NUN062+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUN062+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:05 EST 2019
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 40 ( 11 unt; 0 def)
% Number of atoms : 117 ( 9 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 136 ( 59 ~; 43 |; 34 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 109 ( 7 sgn 49 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
? [X2] :
! [X3] :
( ( ~ r2(X1,X3)
& ~ equal(X3,X2) )
| ( r2(X1,X3)
& equal(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmpNfjhp5/sel_theBenchmark.p_1',axiom_2) ).
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/tmpNfjhp5/sel_theBenchmark.p_1',axiom_1a) ).
fof(8,axiom,
! [X27,X28] :
( ! [X29] :
( ~ r1(X29)
| ~ equal(X29,X28) )
| ~ r2(X27,X28) ),
file('/export/starexec/sandbox2/tmp/tmpNfjhp5/sel_theBenchmark.p_1',axiom_7a) ).
fof(9,conjecture,
! [X18] :
? [X30,X10] :
( ! [X20] :
( ~ r1(X20)
| ~ equal(X10,X20) )
& ? [X31] :
( r3(X18,X10,X31)
& equal(X31,X30) ) ),
file('/export/starexec/sandbox2/tmp/tmpNfjhp5/sel_theBenchmark.p_1',infiniteNumbers) ).
fof(10,negated_conjecture,
~ ! [X18] :
? [X30,X10] :
( ! [X20] :
( ~ r1(X20)
| ~ equal(X10,X20) )
& ? [X31] :
( r3(X18,X10,X31)
& equal(X31,X30) ) ),
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(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,
~ ! [X18] :
? [X30,X10] :
( ! [X20] :
( ~ r1(X20)
| ~ equal(X10,X20) )
& ? [X31] :
( r3(X18,X10,X31)
& equal(X31,X30) ) ),
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(21,plain,
( r2(X2,X1)
| X1 != esk1_1(X2) ),
inference(split_conjunct,[status(thm)],[19]) ).
cnf(22,plain,
( X2 = esk1_1(X1)
| ~ r2(X1,X2) ),
inference(split_conjunct,[status(thm)],[19]) ).
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(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(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,
? [X18] :
! [X30,X10] :
( ? [X20] :
( r1(X20)
& equal(X10,X20) )
| ! [X31] :
( ~ r3(X18,X10,X31)
| ~ equal(X31,X30) ) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(64,negated_conjecture,
? [X32] :
! [X33,X34] :
( ? [X35] :
( r1(X35)
& equal(X34,X35) )
| ! [X36] :
( ~ r3(X32,X34,X36)
| ~ equal(X36,X33) ) ),
inference(variable_rename,[status(thm)],[63]) ).
fof(65,negated_conjecture,
! [X33,X34] :
( ( r1(esk14_2(X33,X34))
& equal(X34,esk14_2(X33,X34)) )
| ! [X36] :
( ~ r3(esk13_0,X34,X36)
| ~ equal(X36,X33) ) ),
inference(skolemize,[status(esa)],[64]) ).
fof(66,negated_conjecture,
! [X33,X34,X36] :
( ~ r3(esk13_0,X34,X36)
| ~ equal(X36,X33)
| ( r1(esk14_2(X33,X34))
& equal(X34,esk14_2(X33,X34)) ) ),
inference(shift_quantors,[status(thm)],[65]) ).
fof(67,negated_conjecture,
! [X33,X34,X36] :
( ( r1(esk14_2(X33,X34))
| ~ r3(esk13_0,X34,X36)
| ~ equal(X36,X33) )
& ( equal(X34,esk14_2(X33,X34))
| ~ r3(esk13_0,X34,X36)
| ~ equal(X36,X33) ) ),
inference(distribute,[status(thm)],[66]) ).
cnf(68,negated_conjecture,
( X3 = esk14_2(X2,X3)
| X1 != X2
| ~ r3(esk13_0,X3,X1) ),
inference(split_conjunct,[status(thm)],[67]) ).
cnf(69,negated_conjecture,
( r1(esk14_2(X2,X3))
| X1 != X2
| ~ r3(esk13_0,X3,X1) ),
inference(split_conjunct,[status(thm)],[67]) ).
cnf(71,plain,
r3(X1,esk9_2(X1,X2),esk7_2(X1,X2)),
inference(rw,[status(thm)],[53,52,theory(equality)]),
[unfolding] ).
cnf(75,plain,
r2(X1,esk1_1(X1)),
inference(er,[status(thm)],[21,theory(equality)]) ).
cnf(76,plain,
( ~ r1(X1)
| ~ r2(X2,X1) ),
inference(er,[status(thm)],[62,theory(equality)]) ).
cnf(77,plain,
esk1_1(X1) = esk9_2(X2,X1),
inference(spm,[status(thm)],[22,54,theory(equality)]) ).
cnf(81,negated_conjecture,
( r1(esk14_2(X1,X2))
| ~ r3(esk13_0,X2,X1) ),
inference(er,[status(thm)],[69,theory(equality)]) ).
cnf(82,negated_conjecture,
( esk14_2(X1,X2) = X2
| ~ r3(esk13_0,X2,X1) ),
inference(er,[status(thm)],[68,theory(equality)]) ).
cnf(98,plain,
~ r1(esk1_1(X1)),
inference(spm,[status(thm)],[76,75,theory(equality)]) ).
cnf(106,plain,
r3(X1,esk1_1(X2),esk7_2(X1,X2)),
inference(rw,[status(thm)],[71,77,theory(equality)]) ).
cnf(139,negated_conjecture,
( r1(X2)
| ~ r3(esk13_0,X2,X1) ),
inference(spm,[status(thm)],[81,82,theory(equality)]) ).
cnf(141,negated_conjecture,
r1(esk1_1(X1)),
inference(spm,[status(thm)],[139,106,theory(equality)]) ).
cnf(144,negated_conjecture,
$false,
inference(sr,[status(thm)],[141,98,theory(equality)]) ).
cnf(145,negated_conjecture,
$false,
144,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUN062+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 : n191.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 18:23:43 CST 2019
% 0.03/0.25 % CPUTime :
% 0.08/0.51 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.51 --creating new selector for [NUM008+0.ax]
% 0.19/0.59 -running prover on /export/starexec/sandbox2/tmp/tmpNfjhp5/sel_theBenchmark.p_1 with time limit 29
% 0.19/0.59 -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/tmpNfjhp5/sel_theBenchmark.p_1']
% 0.19/0.59 -prover status Theorem
% 0.19/0.59 Problem theBenchmark.p solved in phase 0.
% 0.19/0.59 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.59 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.59 Solved 1 out of 1.
% 0.19/0.59 # Problem is unsatisfiable (or provable), constructing proof object
% 0.19/0.59 # SZS status Theorem
% 0.19/0.59 # SZS output start CNFRefutation.
% See solution above
% 0.19/0.59 # SZS output end CNFRefutation
%------------------------------------------------------------------------------