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