TSTP Solution File: NUN067+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUN067+1 : TPTP v7.3.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sine.py -e eprover -t %d %s
% Computer : n183.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 : 17
% Number of leaves : 6
% Syntax : Number of formulae : 47 ( 10 unt; 0 def)
% Number of atoms : 138 ( 0 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 169 ( 78 ~; 57 |; 34 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 84 ( 13 sgn 47 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
? [X2] :
! [X3] :
( ( id(X3,X2)
& r2(X1,X3) )
| ( ~ r2(X1,X3)
& ~ id(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmpfBikiR/sel_theBenchmark.p_1',axiom_2) ).
fof(4,axiom,
? [X12] :
! [X13] :
( ( id(X13,X12)
& r1(X13) )
| ( ~ r1(X13)
& ~ id(X13,X12) ) ),
file('/export/starexec/sandbox2/tmp/tmpfBikiR/sel_theBenchmark.p_1',axiom_1) ).
fof(5,axiom,
! [X14,X15] :
( ~ id(X14,X15)
| id(X15,X14) ),
file('/export/starexec/sandbox2/tmp/tmpfBikiR/sel_theBenchmark.p_1',axiom_6) ).
fof(8,axiom,
! [X20,X21] :
( ~ id(X20,X21)
| ( ~ r1(X20)
& ~ r1(X21) )
| ( r1(X20)
& r1(X21) ) ),
file('/export/starexec/sandbox2/tmp/tmpfBikiR/sel_theBenchmark.p_1',axiom_8) ).
fof(10,axiom,
! [X26,X27] :
( ! [X28] :
( ~ id(X28,X27)
| ~ r1(X28) )
| ~ r2(X26,X27) ),
file('/export/starexec/sandbox2/tmp/tmpfBikiR/sel_theBenchmark.p_1',axiom_7a) ).
fof(11,conjecture,
? [X10] :
! [X29] :
( ~ id(X10,X29)
| ~ r1(X29) ),
file('/export/starexec/sandbox2/tmp/tmpfBikiR/sel_theBenchmark.p_1',nonzerosexistid) ).
fof(12,negated_conjecture,
~ ? [X10] :
! [X29] :
( ~ id(X10,X29)
| ~ r1(X29) ),
inference(assume_negation,[status(cth)],[11]) ).
fof(13,plain,
! [X1] :
? [X2] :
! [X3] :
( ( id(X3,X2)
& r2(X1,X3) )
| ( ~ r2(X1,X3)
& ~ id(X3,X2) ) ),
inference(fof_simplification,[status(thm)],[1,theory(equality)]) ).
fof(15,plain,
? [X12] :
! [X13] :
( ( id(X13,X12)
& r1(X13) )
| ( ~ r1(X13)
& ~ id(X13,X12) ) ),
inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).
fof(16,plain,
! [X14,X15] :
( ~ id(X14,X15)
| id(X15,X14) ),
inference(fof_simplification,[status(thm)],[5,theory(equality)]) ).
fof(18,plain,
! [X20,X21] :
( ~ id(X20,X21)
| ( ~ r1(X20)
& ~ r1(X21) )
| ( r1(X20)
& r1(X21) ) ),
inference(fof_simplification,[status(thm)],[8,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] :
( ~ id(X10,X29)
| ~ r1(X29) ),
inference(fof_simplification,[status(thm)],[12,theory(equality)]) ).
fof(22,plain,
! [X4] :
? [X5] :
! [X6] :
( ( id(X6,X5)
& r2(X4,X6) )
| ( ~ r2(X4,X6)
& ~ id(X6,X5) ) ),
inference(variable_rename,[status(thm)],[13]) ).
fof(23,plain,
! [X4,X6] :
( ( id(X6,esk1_1(X4))
& r2(X4,X6) )
| ( ~ r2(X4,X6)
& ~ id(X6,esk1_1(X4)) ) ),
inference(skolemize,[status(esa)],[22]) ).
fof(24,plain,
! [X4,X6] :
( ( ~ r2(X4,X6)
| id(X6,esk1_1(X4)) )
& ( ~ id(X6,esk1_1(X4))
| id(X6,esk1_1(X4)) )
& ( ~ r2(X4,X6)
| r2(X4,X6) )
& ( ~ id(X6,esk1_1(X4))
| r2(X4,X6) ) ),
inference(distribute,[status(thm)],[23]) ).
cnf(25,plain,
( r2(X1,X2)
| ~ id(X2,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[24]) ).
fof(39,plain,
? [X14] :
! [X15] :
( ( id(X15,X14)
& r1(X15) )
| ( ~ r1(X15)
& ~ id(X15,X14) ) ),
inference(variable_rename,[status(thm)],[15]) ).
fof(40,plain,
! [X15] :
( ( id(X15,esk5_0)
& r1(X15) )
| ( ~ r1(X15)
& ~ id(X15,esk5_0) ) ),
inference(skolemize,[status(esa)],[39]) ).
fof(41,plain,
! [X15] :
( ( ~ r1(X15)
| id(X15,esk5_0) )
& ( ~ id(X15,esk5_0)
| id(X15,esk5_0) )
& ( ~ r1(X15)
| r1(X15) )
& ( ~ id(X15,esk5_0)
| r1(X15) ) ),
inference(distribute,[status(thm)],[40]) ).
cnf(45,plain,
( id(X1,esk5_0)
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[41]) ).
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(52,plain,
! [X22,X23] :
( ~ id(X22,X23)
| ( ~ r1(X22)
& ~ r1(X23) )
| ( r1(X22)
& r1(X23) ) ),
inference(variable_rename,[status(thm)],[18]) ).
fof(53,plain,
! [X22,X23] :
( ( r1(X22)
| ~ r1(X22)
| ~ id(X22,X23) )
& ( r1(X23)
| ~ r1(X22)
| ~ id(X22,X23) )
& ( r1(X22)
| ~ r1(X23)
| ~ id(X22,X23) )
& ( r1(X23)
| ~ r1(X23)
| ~ id(X22,X23) ) ),
inference(distribute,[status(thm)],[52]) ).
cnf(55,plain,
( r1(X1)
| ~ id(X1,X2)
| ~ r1(X2) ),
inference(split_conjunct,[status(thm)],[53]) ).
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] :
( id(X10,X29)
& r1(X29) ),
inference(fof_nnf,[status(thm)],[21]) ).
fof(68,negated_conjecture,
! [X30] :
? [X31] :
( id(X30,X31)
& r1(X31) ),
inference(variable_rename,[status(thm)],[67]) ).
fof(69,negated_conjecture,
! [X30] :
( id(X30,esk6_1(X30))
& r1(esk6_1(X30)) ),
inference(skolemize,[status(esa)],[68]) ).
cnf(70,negated_conjecture,
r1(esk6_1(X1)),
inference(split_conjunct,[status(thm)],[69]) ).
cnf(71,negated_conjecture,
id(X1,esk6_1(X1)),
inference(split_conjunct,[status(thm)],[69]) ).
cnf(84,negated_conjecture,
( r1(X1)
| ~ r1(esk6_1(X1)) ),
inference(spm,[status(thm)],[55,71,theory(equality)]) ).
cnf(86,negated_conjecture,
( r1(X1)
| $false ),
inference(rw,[status(thm)],[84,70,theory(equality)]) ).
cnf(87,negated_conjecture,
r1(X1),
inference(cn,[status(thm)],[86,theory(equality)]) ).
cnf(131,plain,
( $false
| ~ r2(X2,X3)
| ~ id(X1,X3) ),
inference(rw,[status(thm)],[66,87,theory(equality)]) ).
cnf(132,plain,
( ~ r2(X2,X3)
| ~ id(X1,X3) ),
inference(cn,[status(thm)],[131,theory(equality)]) ).
cnf(141,plain,
( id(X1,esk5_0)
| $false ),
inference(rw,[status(thm)],[45,87,theory(equality)]) ).
cnf(142,plain,
id(X1,esk5_0),
inference(cn,[status(thm)],[141,theory(equality)]) ).
cnf(143,plain,
id(esk5_0,X1),
inference(spm,[status(thm)],[47,142,theory(equality)]) ).
cnf(149,plain,
r2(X1,esk5_0),
inference(spm,[status(thm)],[25,143,theory(equality)]) ).
cnf(176,plain,
~ id(X2,esk5_0),
inference(spm,[status(thm)],[132,149,theory(equality)]) ).
cnf(177,plain,
$false,
inference(rw,[status(thm)],[176,142,theory(equality)]) ).
cnf(178,plain,
$false,
inference(cn,[status(thm)],[177,theory(equality)]) ).
cnf(179,plain,
$false,
178,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUN067+1 : 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 : n183.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 19:29:58 CST 2019
% 0.03/0.25 % CPUTime :
% 0.08/0.29 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.29 --creating new selector for [NUM009+0.ax]
% 0.08/0.38 -running prover on /export/starexec/sandbox2/tmp/tmpfBikiR/sel_theBenchmark.p_1 with time limit 29
% 0.08/0.38 -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/tmpfBikiR/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/sandbox2/benchmark/theBenchmark.p
% 0.08/0.38 % SZS status Ended for /export/starexec/sandbox2/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.39 # SZS output end CNFRefutation
%------------------------------------------------------------------------------