TSTP Solution File: NUN073+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUN073+1 : TPTP v7.3.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sine.py -e eprover -t %d %s
% Computer : n190.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:07 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 : 35 ( 11 unt; 0 def)
% Number of atoms : 99 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 124 ( 60 ~; 49 |; 15 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 71 ( 1 sgn 49 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X4,X5] :
( ! [X6] :
( ! [X7] :
( ~ id(X7,X6)
| ~ r2(X4,X7) )
| ~ r2(X5,X6) )
| id(X4,X5) ),
file('/export/starexec/sandbox2/tmp/tmphxkdNc/sel_theBenchmark.p_1',axiom_3a) ).
fof(5,axiom,
! [X14,X15] :
( ~ id(X14,X15)
| id(X15,X14) ),
file('/export/starexec/sandbox2/tmp/tmphxkdNc/sel_theBenchmark.p_1',axiom_6) ).
fof(10,axiom,
! [X26,X27] :
( ! [X28] :
( ~ id(X28,X27)
| ~ r1(X28) )
| ~ r2(X26,X27) ),
file('/export/starexec/sandbox2/tmp/tmphxkdNc/sel_theBenchmark.p_1',axiom_7a) ).
fof(11,conjecture,
! [X10] :
( ! [X29] :
( ! [X30] :
( ~ r1(X30)
| ~ r2(X30,X29) )
| ~ id(X29,X10) )
| ! [X31] :
( ! [X32] :
( ~ r1(X32)
| ~ r2(X32,X31) )
| ~ r2(X31,X10) ) ),
file('/export/starexec/sandbox2/tmp/tmphxkdNc/sel_theBenchmark.p_1',oneunidtwo) ).
fof(12,negated_conjecture,
~ ! [X10] :
( ! [X29] :
( ! [X30] :
( ~ r1(X30)
| ~ r2(X30,X29) )
| ~ id(X29,X10) )
| ! [X31] :
( ! [X32] :
( ~ r1(X32)
| ~ r2(X32,X31) )
| ~ r2(X31,X10) ) ),
inference(assume_negation,[status(cth)],[11]) ).
fof(14,plain,
! [X4,X5] :
( ! [X6] :
( ! [X7] :
( ~ id(X7,X6)
| ~ r2(X4,X7) )
| ~ r2(X5,X6) )
| id(X4,X5) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(16,plain,
! [X14,X15] :
( ~ id(X14,X15)
| id(X15,X14) ),
inference(fof_simplification,[status(thm)],[5,theory(equality)]) ).
fof(20,plain,
! [X26,X27] :
( ! [X28] :
( ~ id(X28,X27)
| ~ r1(X28) )
| ~ r2(X26,X27) ),
inference(fof_simplification,[status(thm)],[10,theory(equality)]) ).
fof(21,negated_conjecture,
~ ! [X10] :
( ! [X29] :
( ! [X30] :
( ~ r1(X30)
| ~ r2(X30,X29) )
| ~ id(X29,X10) )
| ! [X31] :
( ! [X32] :
( ~ r1(X32)
| ~ r2(X32,X31) )
| ~ r2(X31,X10) ) ),
inference(fof_simplification,[status(thm)],[12,theory(equality)]) ).
fof(29,plain,
! [X8,X9] :
( ! [X10] :
( ! [X11] :
( ~ id(X11,X10)
| ~ r2(X8,X11) )
| ~ r2(X9,X10) )
| id(X8,X9) ),
inference(variable_rename,[status(thm)],[14]) ).
fof(30,plain,
! [X8,X9,X10,X11] :
( ~ id(X11,X10)
| ~ r2(X8,X11)
| ~ r2(X9,X10)
| id(X8,X9) ),
inference(shift_quantors,[status(thm)],[29]) ).
cnf(31,plain,
( id(X1,X2)
| ~ r2(X2,X3)
| ~ r2(X1,X4)
| ~ id(X4,X3) ),
inference(split_conjunct,[status(thm)],[30]) ).
fof(46,plain,
! [X16,X17] :
( ~ id(X16,X17)
| id(X17,X16) ),
inference(variable_rename,[status(thm)],[16]) ).
cnf(47,plain,
( id(X1,X2)
| ~ id(X2,X1) ),
inference(split_conjunct,[status(thm)],[46]) ).
fof(64,plain,
! [X29,X30] :
( ! [X31] :
( ~ id(X31,X30)
| ~ r1(X31) )
| ~ r2(X29,X30) ),
inference(variable_rename,[status(thm)],[20]) ).
fof(65,plain,
! [X29,X30,X31] :
( ~ id(X31,X30)
| ~ r1(X31)
| ~ r2(X29,X30) ),
inference(shift_quantors,[status(thm)],[64]) ).
cnf(66,plain,
( ~ r2(X1,X2)
| ~ r1(X3)
| ~ id(X3,X2) ),
inference(split_conjunct,[status(thm)],[65]) ).
fof(67,negated_conjecture,
? [X10] :
( ? [X29] :
( ? [X30] :
( r1(X30)
& r2(X30,X29) )
& id(X29,X10) )
& ? [X31] :
( ? [X32] :
( r1(X32)
& r2(X32,X31) )
& r2(X31,X10) ) ),
inference(fof_nnf,[status(thm)],[21]) ).
fof(68,negated_conjecture,
? [X33] :
( ? [X34] :
( ? [X35] :
( r1(X35)
& r2(X35,X34) )
& id(X34,X33) )
& ? [X36] :
( ? [X37] :
( r1(X37)
& r2(X37,X36) )
& r2(X36,X33) ) ),
inference(variable_rename,[status(thm)],[67]) ).
fof(69,negated_conjecture,
( r1(esk8_0)
& r2(esk8_0,esk7_0)
& id(esk7_0,esk6_0)
& r1(esk10_0)
& r2(esk10_0,esk9_0)
& r2(esk9_0,esk6_0) ),
inference(skolemize,[status(esa)],[68]) ).
cnf(70,negated_conjecture,
r2(esk9_0,esk6_0),
inference(split_conjunct,[status(thm)],[69]) ).
cnf(71,negated_conjecture,
r2(esk10_0,esk9_0),
inference(split_conjunct,[status(thm)],[69]) ).
cnf(73,negated_conjecture,
id(esk7_0,esk6_0),
inference(split_conjunct,[status(thm)],[69]) ).
cnf(74,negated_conjecture,
r2(esk8_0,esk7_0),
inference(split_conjunct,[status(thm)],[69]) ).
cnf(75,negated_conjecture,
r1(esk8_0),
inference(split_conjunct,[status(thm)],[69]) ).
cnf(79,negated_conjecture,
id(esk6_0,esk7_0),
inference(spm,[status(thm)],[47,73,theory(equality)]) ).
cnf(88,negated_conjecture,
( ~ r1(X1)
| ~ id(X1,esk9_0) ),
inference(spm,[status(thm)],[66,71,theory(equality)]) ).
cnf(107,negated_conjecture,
( id(X1,esk8_0)
| ~ r2(X1,X2)
| ~ id(X2,esk7_0) ),
inference(spm,[status(thm)],[31,74,theory(equality)]) ).
cnf(172,negated_conjecture,
~ id(esk8_0,esk9_0),
inference(spm,[status(thm)],[88,75,theory(equality)]) ).
cnf(647,negated_conjecture,
( id(esk9_0,esk8_0)
| ~ id(esk6_0,esk7_0) ),
inference(spm,[status(thm)],[107,70,theory(equality)]) ).
cnf(655,negated_conjecture,
( id(esk9_0,esk8_0)
| $false ),
inference(rw,[status(thm)],[647,79,theory(equality)]) ).
cnf(656,negated_conjecture,
id(esk9_0,esk8_0),
inference(cn,[status(thm)],[655,theory(equality)]) ).
cnf(671,negated_conjecture,
id(esk8_0,esk9_0),
inference(spm,[status(thm)],[47,656,theory(equality)]) ).
cnf(677,negated_conjecture,
$false,
inference(sr,[status(thm)],[671,172,theory(equality)]) ).
cnf(678,negated_conjecture,
$false,
677,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.04 % Problem : NUN073+1 : TPTP v7.3.0. Released v7.3.0.
% 0.03/0.05 % Command : sine.py -e eprover -t %d %s
% 0.03/0.26 % Computer : n190.star.cs.uiowa.edu
% 0.03/0.26 % Model : x86_64 x86_64
% 0.03/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.26 % Memory : 32218.5MB
% 0.03/0.26 % OS : Linux 3.10.0-862.11.6.el7.x86_64
% 0.03/0.26 % CPULimit : 300
% 0.03/0.26 % DateTime : Sat Feb 23 20:36:43 CST 2019
% 0.03/0.26 % CPUTime :
% 0.08/0.31 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.31 --creating new selector for [NUM009+0.ax]
% 0.08/0.40 -running prover on /export/starexec/sandbox2/tmp/tmphxkdNc/sel_theBenchmark.p_1 with time limit 29
% 0.08/0.40 -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/tmphxkdNc/sel_theBenchmark.p_1']
% 0.08/0.40 -prover status Theorem
% 0.08/0.40 Problem theBenchmark.p solved in phase 0.
% 0.08/0.40 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.40 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.40 Solved 1 out of 1.
% 0.08/0.40 # Problem is unsatisfiable (or provable), constructing proof object
% 0.08/0.40 # SZS status Theorem
% 0.08/0.40 # SZS output start CNFRefutation.
% See solution above
% 0.08/0.41 # SZS output end CNFRefutation
%------------------------------------------------------------------------------