TSTP Solution File: NUN088+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUN088+2 : TPTP v7.3.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sine.py -e eprover -t %d %s
% Computer : n187.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:10 EST 2019
% Result : Theorem 0.08s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 8 unt; 0 def)
% Number of atoms : 49 ( 2 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 61 ( 32 ~; 20 |; 9 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 32 ( 2 sgn 21 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(5,axiom,
! [X14,X15] :
( ! [X16] :
( ~ r1(X16)
| ~ equal(X16,X15) )
| ~ r2(X14,X15) ),
file('/export/starexec/sandbox2/tmp/tmpU1RDq3/sel_theBenchmark.p_1',axiom_7a) ).
fof(6,conjecture,
! [X3] :
( ! [X17] :
( ~ r1(X17)
| ~ equal(X17,X3) )
| ! [X18] :
( ~ r1(X18)
| ~ r2(X18,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmpU1RDq3/sel_theBenchmark.p_1',zerouneqone) ).
fof(7,negated_conjecture,
~ ! [X3] :
( ! [X17] :
( ~ r1(X17)
| ~ equal(X17,X3) )
| ! [X18] :
( ~ r1(X18)
| ~ r2(X18,X3) ) ),
inference(assume_negation,[status(cth)],[6]) ).
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(X17,X3) )
| ! [X18] :
( ~ r1(X18)
| ~ r2(X18,X3) ) ),
inference(fof_simplification,[status(thm)],[7,theory(equality)]) ).
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(X17,X3) )
& ? [X18] :
( r1(X18)
& r2(X18,X3) ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(41,negated_conjecture,
? [X19] :
( ? [X20] :
( r1(X20)
& equal(X20,X19) )
& ? [X21] :
( r1(X21)
& r2(X21,X19) ) ),
inference(variable_rename,[status(thm)],[40]) ).
fof(42,negated_conjecture,
( r1(esk7_0)
& equal(esk7_0,esk6_0)
& r1(esk8_0)
& r2(esk8_0,esk6_0) ),
inference(skolemize,[status(esa)],[41]) ).
cnf(43,negated_conjecture,
r2(esk8_0,esk6_0),
inference(split_conjunct,[status(thm)],[42]) ).
cnf(45,negated_conjecture,
esk7_0 = esk6_0,
inference(split_conjunct,[status(thm)],[42]) ).
cnf(46,negated_conjecture,
r1(esk7_0),
inference(split_conjunct,[status(thm)],[42]) ).
cnf(47,negated_conjecture,
r1(esk6_0),
inference(rw,[status(thm)],[46,45,theory(equality)]) ).
cnf(52,plain,
( ~ r2(X1,X2)
| ~ r1(X2) ),
inference(er,[status(thm)],[39,theory(equality)]) ).
cnf(65,negated_conjecture,
~ r1(esk6_0),
inference(spm,[status(thm)],[52,43,theory(equality)]) ).
cnf(68,negated_conjecture,
$false,
inference(rw,[status(thm)],[65,47,theory(equality)]) ).
cnf(69,negated_conjecture,
$false,
inference(cn,[status(thm)],[68,theory(equality)]) ).
cnf(70,negated_conjecture,
$false,
69,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUN088+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 : n187.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 02:14:59 CST 2019
% 0.03/0.25 % CPUTime :
% 0.03/0.30 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.30 --creating new selector for [NUM008+0.ax]
% 0.08/0.39 -running prover on /export/starexec/sandbox2/tmp/tmpU1RDq3/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/tmpU1RDq3/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
%------------------------------------------------------------------------------