TSTP Solution File: NUN080+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUN080+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 16:26:06 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 7 unt; 0 def)
% Number of atoms : 80 ( 23 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 91 ( 35 ~; 26 |; 30 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-2 aty)
% Number of variables : 63 ( 9 sgn 18 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(xplustwoeqy,conjecture,
? [X39,X22,X23] :
( X23 = X22
& ? [X16] :
( r3(X39,X16,X23)
& ? [X17] :
( r2(X17,X16)
& ? [X25] :
( r1(X25)
& r2(X25,X17) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',xplustwoeqy) ).
fof(axiom_1a,axiom,
! [X14,X15] :
? [X16] :
( ? [X17] :
( ? [X18] :
( r2(X15,X18)
& r3(X14,X18,X17) )
& X17 = X16 )
& ? [X19] :
( r2(X19,X16)
& r3(X14,X15,X19) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_1a) ).
fof(axiom_2,axiom,
! [X3] :
? [X4] :
! [X5] :
( ( ~ r2(X3,X5)
& X5 != X4 )
| ( r2(X3,X5)
& X5 = X4 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_2) ).
fof(axiom_1,axiom,
? [X1] :
! [X2] :
( ( ~ r1(X2)
& X2 != X1 )
| ( r1(X2)
& X2 = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_1) ).
fof(axiom_4a,axiom,
! [X30] :
? [X31] :
( ? [X32] :
( r1(X32)
& r3(X30,X32,X31) )
& X31 = X30 ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_4a) ).
fof(c_0_5,negated_conjecture,
~ ? [X39,X22,X23] :
( X23 = X22
& ? [X16] :
( r3(X39,X16,X23)
& ? [X17] :
( r2(X17,X16)
& ? [X25] :
( r1(X25)
& r2(X25,X17) ) ) ) ),
inference(assume_negation,[status(cth)],[xplustwoeqy]) ).
fof(c_0_6,negated_conjecture,
! [X40,X41,X42,X43,X44,X45] :
( X42 != X41
| ~ r3(X40,X43,X42)
| ~ r2(X44,X43)
| ~ r1(X45)
| ~ r2(X45,X44) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
cnf(c_0_7,negated_conjecture,
( ~ r2(X1,X2)
| ~ r1(X1)
| ~ r2(X2,X3)
| ~ r3(X4,X3,X5)
| X5 != X6 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_8,plain,
! [X20,X21] :
( r2(X21,esk4_2(X20,X21))
& r3(X20,esk4_2(X20,X21),esk3_2(X20,X21))
& esk3_2(X20,X21) = esk2_2(X20,X21)
& r2(esk5_2(X20,X21),esk2_2(X20,X21))
& r3(X20,X21,esk5_2(X20,X21)) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[axiom_1a])])])]) ).
fof(c_0_9,plain,
! [X6,X8] :
( ( r2(X6,X8)
| ~ r2(X6,X8) )
& ( X8 = esk1_1(X6)
| ~ r2(X6,X8) )
& ( r2(X6,X8)
| X8 != esk1_1(X6) )
& ( X8 = esk1_1(X6)
| X8 != esk1_1(X6) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_2])])])]) ).
fof(c_0_10,plain,
! [X4] :
( ( r1(X4)
| ~ r1(X4) )
& ( X4 = esk9_0
| ~ r1(X4) )
& ( r1(X4)
| X4 != esk9_0 )
& ( X4 = esk9_0
| X4 != esk9_0 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_1])])])]) ).
fof(c_0_11,plain,
! [X33] :
( r1(esk11_1(X33))
& r3(X33,esk11_1(X33),esk10_1(X33))
& esk10_1(X33) = X33 ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[axiom_4a])])])]) ).
cnf(c_0_12,negated_conjecture,
( ~ r3(X1,X2,X3)
| ~ r2(X4,X2)
| ~ r2(X5,X4)
| ~ r1(X5) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
r3(X1,X2,esk5_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( r2(X2,X1)
| X1 != esk1_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( X1 = esk9_0
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
r1(esk11_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( ~ r2(X1,X2)
| ~ r2(X3,X1)
| ~ r1(X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
r2(X1,esk1_1(X1)),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
esk11_1(X1) = esk9_0,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( ~ r2(X1,X2)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
r1(esk9_0),
inference(rw,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
~ r1(X1),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_23,plain,
$false,
inference(sr,[status(thm)],[c_0_21,c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUN080+2 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 2 03:06:34 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41 # Preprocessing time : 0.015 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 24
% 0.24/1.42 # Proof object clause steps : 13
% 0.24/1.42 # Proof object formula steps : 11
% 0.24/1.42 # Proof object conjectures : 8
% 0.24/1.42 # Proof object clause conjectures : 5
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 5
% 0.24/1.42 # Proof object initial formulas used : 5
% 0.24/1.42 # Proof object generating inferences : 5
% 0.24/1.42 # Proof object simplifying inferences : 3
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 12
% 0.24/1.42 # Removed by relevancy pruning/SinE : 3
% 0.24/1.42 # Initial clauses : 27
% 0.24/1.42 # Removed in clause preprocessing : 8
% 0.24/1.42 # Initial clauses in saturation : 19
% 0.24/1.42 # Processed clauses : 41
% 0.24/1.42 # ...of these trivial : 1
% 0.24/1.42 # ...subsumed : 0
% 0.24/1.42 # ...remaining for further processing : 40
% 0.24/1.42 # Other redundant clauses eliminated : 4
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 2
% 0.24/1.42 # Backward-rewritten : 7
% 0.24/1.42 # Generated clauses : 64
% 0.24/1.42 # ...of the previous two non-trivial : 63
% 0.24/1.42 # Contextual simplify-reflections : 0
% 0.24/1.42 # Paramodulations : 54
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 6
% 0.24/1.42 # Current number of processed clauses : 24
% 0.24/1.42 # Positive orientable unit clauses : 9
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 2
% 0.24/1.42 # Non-unit-clauses : 13
% 0.24/1.42 # Current number of unprocessed clauses: 25
% 0.24/1.42 # ...number of literals in the above : 43
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 15
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 57
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 43
% 0.24/1.42 # Non-unit clause-clause subsumptions : 2
% 0.24/1.42 # Unit Clause-clause subsumption calls : 12
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 9
% 0.24/1.42 # BW rewrite match successes : 6
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 1531
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.015 s
% 0.24/1.42 # System time : 0.003 s
% 0.24/1.42 # Total time : 0.018 s
% 0.24/1.42 # Maximum resident set size: 2848 pages
%------------------------------------------------------------------------------