TSTP Solution File: NUN070+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUN070+1 : 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:06 EST 2019
% Result : Theorem 0.46s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 10 unt; 0 def)
% Number of atoms : 111 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 147 ( 66 ~; 52 |; 29 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 0 con; 1-1 aty)
% Number of variables : 83 ( 2 sgn 33 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X4] :
? [X5] :
! [X6] :
( ( id(X6,X5)
& r2(X4,X6) )
| ( ~ r2(X4,X6)
& ~ id(X6,X5) ) ),
file('/export/starexec/sandbox/tmp/tmpQppAUy/sel_theBenchmark.p_1',axiom_2) ).
fof(10,axiom,
! [X35] : id(X35,X35),
file('/export/starexec/sandbox/tmp/tmpQppAUy/sel_theBenchmark.p_1',axiom_5) ).
fof(13,axiom,
! [X42] :
? [X43] :
( id(X43,X42)
& ? [X44] :
( r1(X44)
& r3(X42,X44,X43) ) ),
file('/export/starexec/sandbox/tmp/tmpQppAUy/sel_theBenchmark.p_1',axiom_4a) ).
fof(15,conjecture,
? [X19] :
( ? [X48] :
( ? [X31] :
( r1(X31)
& r3(X48,X31,X19) )
& ? [X32] :
( r1(X32)
& r2(X32,X48) ) )
& ? [X49] :
( id(X19,X49)
& ? [X50] :
( r1(X50)
& r2(X50,X49) ) ) ),
file('/export/starexec/sandbox/tmp/tmpQppAUy/sel_theBenchmark.p_1',onepluszeroidone) ).
fof(16,negated_conjecture,
~ ? [X19] :
( ? [X48] :
( ? [X31] :
( r1(X31)
& r3(X48,X31,X19) )
& ? [X32] :
( r1(X32)
& r2(X32,X48) ) )
& ? [X49] :
( id(X19,X49)
& ? [X50] :
( r1(X50)
& r2(X50,X49) ) ) ),
inference(assume_negation,[status(cth)],[15]) ).
fof(18,plain,
! [X4] :
? [X5] :
! [X6] :
( ( id(X6,X5)
& r2(X4,X6) )
| ( ~ r2(X4,X6)
& ~ id(X6,X5) ) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(29,plain,
! [X7] :
? [X8] :
! [X9] :
( ( id(X9,X8)
& r2(X7,X9) )
| ( ~ r2(X7,X9)
& ~ id(X9,X8) ) ),
inference(variable_rename,[status(thm)],[18]) ).
fof(30,plain,
! [X7,X9] :
( ( id(X9,esk1_1(X7))
& r2(X7,X9) )
| ( ~ r2(X7,X9)
& ~ id(X9,esk1_1(X7)) ) ),
inference(skolemize,[status(esa)],[29]) ).
fof(31,plain,
! [X7,X9] :
( ( ~ r2(X7,X9)
| id(X9,esk1_1(X7)) )
& ( ~ id(X9,esk1_1(X7))
| id(X9,esk1_1(X7)) )
& ( ~ r2(X7,X9)
| r2(X7,X9) )
& ( ~ id(X9,esk1_1(X7))
| r2(X7,X9) ) ),
inference(distribute,[status(thm)],[30]) ).
cnf(32,plain,
( r2(X1,X2)
| ~ id(X2,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[31]) ).
fof(75,plain,
! [X36] : id(X36,X36),
inference(variable_rename,[status(thm)],[10]) ).
cnf(76,plain,
id(X1,X1),
inference(split_conjunct,[status(thm)],[75]) ).
fof(89,plain,
! [X45] :
? [X46] :
( id(X46,X45)
& ? [X47] :
( r1(X47)
& r3(X45,X47,X46) ) ),
inference(variable_rename,[status(thm)],[13]) ).
fof(90,plain,
! [X45] :
( id(esk11_1(X45),X45)
& r1(esk12_1(X45))
& r3(X45,esk12_1(X45),esk11_1(X45)) ),
inference(skolemize,[status(esa)],[89]) ).
cnf(91,plain,
r3(X1,esk12_1(X1),esk11_1(X1)),
inference(split_conjunct,[status(thm)],[90]) ).
cnf(92,plain,
r1(esk12_1(X1)),
inference(split_conjunct,[status(thm)],[90]) ).
cnf(93,plain,
id(esk11_1(X1),X1),
inference(split_conjunct,[status(thm)],[90]) ).
fof(97,negated_conjecture,
! [X19] :
( ! [X48] :
( ! [X31] :
( ~ r1(X31)
| ~ r3(X48,X31,X19) )
| ! [X32] :
( ~ r1(X32)
| ~ r2(X32,X48) ) )
| ! [X49] :
( ~ id(X19,X49)
| ! [X50] :
( ~ r1(X50)
| ~ r2(X50,X49) ) ) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(98,negated_conjecture,
! [X51] :
( ! [X52] :
( ! [X53] :
( ~ r1(X53)
| ~ r3(X52,X53,X51) )
| ! [X54] :
( ~ r1(X54)
| ~ r2(X54,X52) ) )
| ! [X55] :
( ~ id(X51,X55)
| ! [X56] :
( ~ r1(X56)
| ~ r2(X56,X55) ) ) ),
inference(variable_rename,[status(thm)],[97]) ).
fof(99,negated_conjecture,
! [X51,X52,X53,X54,X55,X56] :
( ~ r1(X56)
| ~ r2(X56,X55)
| ~ id(X51,X55)
| ~ r1(X54)
| ~ r2(X54,X52)
| ~ r1(X53)
| ~ r3(X52,X53,X51) ),
inference(shift_quantors,[status(thm)],[98]) ).
cnf(100,negated_conjecture,
( ~ r3(X1,X2,X3)
| ~ r1(X2)
| ~ r2(X4,X1)
| ~ r1(X4)
| ~ id(X3,X5)
| ~ r2(X6,X5)
| ~ r1(X6) ),
inference(split_conjunct,[status(thm)],[99]) ).
cnf(118,plain,
r2(X1,esk1_1(X1)),
inference(spm,[status(thm)],[32,76,theory(equality)]) ).
cnf(168,negated_conjecture,
( ~ r1(X1)
| ~ r1(X2)
| ~ r1(esk12_1(X3))
| ~ r2(X1,X4)
| ~ r2(X2,X3)
| ~ id(esk11_1(X3),X4) ),
inference(spm,[status(thm)],[100,91,theory(equality)]) ).
cnf(170,negated_conjecture,
( ~ r1(X1)
| ~ r1(X2)
| $false
| ~ r2(X1,X4)
| ~ r2(X2,X3)
| ~ id(esk11_1(X3),X4) ),
inference(rw,[status(thm)],[168,92,theory(equality)]) ).
cnf(171,negated_conjecture,
( ~ r1(X1)
| ~ r1(X2)
| ~ r2(X1,X4)
| ~ r2(X2,X3)
| ~ id(esk11_1(X3),X4) ),
inference(cn,[status(thm)],[170,theory(equality)]) ).
cnf(2418,negated_conjecture,
( ~ r1(X1)
| ~ r1(X2)
| ~ r2(X1,X3)
| ~ r2(X2,X3) ),
inference(spm,[status(thm)],[171,93,theory(equality)]) ).
cnf(29252,negated_conjecture,
( ~ r1(X1)
| ~ r1(X2)
| ~ r2(X2,esk1_1(X1)) ),
inference(spm,[status(thm)],[2418,118,theory(equality)]) ).
cnf(29263,negated_conjecture,
~ r1(X1),
inference(spm,[status(thm)],[29252,118,theory(equality)]) ).
cnf(29315,plain,
$false,
inference(sr,[status(thm)],[92,29263,theory(equality)]) ).
cnf(29316,plain,
$false,
29315,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUN070+1 : TPTP v7.3.0. Released v7.3.0.
% 0.00/0.05 % Command : sine.py -e eprover -t %d %s
% 0.04/0.25 % Computer : n191.star.cs.uiowa.edu
% 0.04/0.25 % Model : x86_64 x86_64
% 0.04/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.04/0.25 % Memory : 32218.5MB
% 0.04/0.25 % OS : Linux 3.10.0-862.11.6.el7.x86_64
% 0.04/0.25 % CPULimit : 300
% 0.04/0.25 % DateTime : Sat Feb 23 19:56:26 CST 2019
% 0.04/0.25 % CPUTime :
% 0.04/0.30 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.04/0.30 --creating new selector for [NUM009+0.ax]
% 0.46/0.76 -running prover on /export/starexec/sandbox/tmp/tmpQppAUy/sel_theBenchmark.p_1 with time limit 29
% 0.46/0.76 -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/tmpQppAUy/sel_theBenchmark.p_1']
% 0.46/0.76 -prover status Theorem
% 0.46/0.76 Problem theBenchmark.p solved in phase 0.
% 0.46/0.76 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.76 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.76 Solved 1 out of 1.
% 0.46/0.76 # Problem is unsatisfiable (or provable), constructing proof object
% 0.46/0.76 # SZS status Theorem
% 0.46/0.76 # SZS output start CNFRefutation.
% See solution above
% 0.46/0.76 # SZS output end CNFRefutation
%------------------------------------------------------------------------------