%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUN067+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:06 EST 2019
% Result : Theorem 0.08s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 34 ( 8 unt; 0 def)
% Number of atoms : 94 ( 7 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 113 ( 53 ~; 35 |; 25 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 63 ( 11 sgn 33 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X9] :
? [X10] :
! [X11] :
( ( ~ r2(X9,X11)
& ~ equal(X11,X10) )
| ( r2(X9,X11)
& equal(X11,X10) ) ),
file('/export/starexec/sandbox/tmp/tmpVAJGon/sel_theBenchmark.p_1',axiom_2) ).
fof(4,axiom,
? [X12] :
! [X13] :
( ( ~ r1(X13)
& ~ equal(X13,X12) )
| ( r1(X13)
& equal(X13,X12) ) ),
file('/export/starexec/sandbox/tmp/tmpVAJGon/sel_theBenchmark.p_1',axiom_1) ).
fof(5,axiom,
! [X14,X15] :
( ! [X16] :
( ~ r1(X16)
| ~ equal(X16,X15) )
| ~ r2(X14,X15) ),
file('/export/starexec/sandbox/tmp/tmpVAJGon/sel_theBenchmark.p_1',axiom_7a) ).
fof(6,conjecture,
? [X3] :
! [X17] :
( ~ r1(X17)
| ~ equal(X3,X17) ),
file('/export/starexec/sandbox/tmp/tmpVAJGon/sel_theBenchmark.p_1',nonzerosexist) ).
fof(7,negated_conjecture,
~ ? [X3] :
! [X17] :
( ~ r1(X17)
| ~ equal(X3,X17) ),
inference(assume_negation,[status(cth)],[6]) ).
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] :
( ~ r1(X17)
| ~ equal(X3,X17) ),
inference(fof_simplification,[status(thm)],[7,theory(equality)]) ).
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]) ).
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(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] :
( r1(X17)
& equal(X3,X17) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(41,negated_conjecture,
! [X18] :
? [X19] :
( r1(X19)
& equal(X18,X19) ),
inference(variable_rename,[status(thm)],[40]) ).
fof(42,negated_conjecture,
! [X18] :
( r1(esk6_1(X18))
& equal(X18,esk6_1(X18)) ),
inference(skolemize,[status(esa)],[41]) ).
cnf(43,negated_conjecture,
X1 = esk6_1(X1),
inference(split_conjunct,[status(thm)],[42]) ).
cnf(44,negated_conjecture,
r1(esk6_1(X1)),
inference(split_conjunct,[status(thm)],[42]) ).
cnf(45,negated_conjecture,
r1(X1),
inference(rw,[status(thm)],[44,43,theory(equality)]),
[unfolding] ).
cnf(48,plain,
( esk5_0 = X1
| $false ),
inference(rw,[status(thm)],[35,45,theory(equality)]),
[unfolding] ).
cnf(50,plain,
( X2 != X3
| $false
| ~ r2(X1,X2) ),
inference(rw,[status(thm)],[39,45,theory(equality)]),
[unfolding] ).
cnf(56,plain,
~ r2(X1,X2),
inference(er,[status(thm)],[50,theory(equality)]) ).
cnf(57,plain,
( r2(X2,X1)
| esk5_0 != X1 ),
inference(rw,[status(thm)],[27,48,theory(equality)]) ).
cnf(58,plain,
r2(X2,X1),
inference(sr,[status(thm)],[57,48,theory(equality)]) ).
cnf(68,plain,
$false,
inference(rw,[status(thm)],[56,58,theory(equality)]) ).
cnf(69,plain,
$false,
inference(cn,[status(thm)],[68,theory(equality)]) ).
cnf(70,plain,
$false,
69,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUN067+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 : n192.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.24 % DateTime : Sat Feb 23 19:36:43 CST 2019
% 0.03/0.25 % CPUTime :
% 0.08/0.29 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.29 --creating new selector for [NUM008+0.ax]
% 0.08/0.38 -running prover on /export/starexec/sandbox/tmp/tmpVAJGon/sel_theBenchmark.p_1 with time limit 29
% 0.08/0.38 -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/tmpVAJGon/sel_theBenchmark.p_1']
% 0.08/0.38 -prover status Theorem
% 0.08/0.38 Problem theBenchmark.p solved in phase 0.
% 0.08/0.38 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.38 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.38 Solved 1 out of 1.
% 0.08/0.38 # Problem is unsatisfiable (or provable), constructing proof object
% 0.08/0.38 # SZS status Theorem
% 0.08/0.38 # SZS output start CNFRefutation.
% See solution above
% 0.08/0.38 # SZS output end CNFRefutation
%------------------------------------------------------------------------------