TSTP Solution File: NUN068+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUN068+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n024.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:03 EDT 2022
% Result : Theorem 0.25s 1.44s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 38 ( 5 unt; 0 def)
% Number of atoms : 113 ( 49 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 126 ( 51 ~; 58 |; 17 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 67 ( 5 sgn 27 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(nonzerosnononesexist,conjecture,
? [X39] :
( ! [X22] :
( ! [X23] :
( ~ r1(X23)
| ~ r2(X23,X22) )
| X39 != X22 )
& ! [X16] :
( ~ r1(X16)
| X39 != X16 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',nonzerosnononesexist) ).
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_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_3a,axiom,
! [X26,X27] :
( ! [X28] :
( ! [X29] :
( ~ r2(X26,X29)
| X29 != X28 )
| ~ r2(X27,X28) )
| X26 = X27 ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_3a) ).
fof(c_0_5,negated_conjecture,
~ ? [X39] :
( ! [X22] :
( ! [X23] :
( ~ r1(X23)
| ~ r2(X23,X22) )
| X39 != X22 )
& ! [X16] :
( ~ r1(X16)
| X39 != X16 ) ),
inference(assume_negation,[status(cth)],[nonzerosnononesexist]) ).
fof(c_0_6,negated_conjecture,
! [X40] :
( ( r1(esk3_1(X40))
| r1(esk2_1(X40)) )
& ( X40 = esk3_1(X40)
| r1(esk2_1(X40)) )
& ( r1(esk3_1(X40))
| r2(esk2_1(X40),esk1_1(X40)) )
& ( X40 = esk3_1(X40)
| r2(esk2_1(X40),esk1_1(X40)) )
& ( r1(esk3_1(X40))
| X40 = esk1_1(X40) )
& ( X40 = esk3_1(X40)
| X40 = esk1_1(X40) ) ),
inference(distribute,[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_5])])])])])])]) ).
fof(c_0_7,plain,
! [X4] :
( ( r1(X4)
| ~ r1(X4) )
& ( X4 = esk4_0
| ~ r1(X4) )
& ( r1(X4)
| X4 != esk4_0 )
& ( X4 = esk4_0
| X4 != esk4_0 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_1])])])]) ).
cnf(c_0_8,negated_conjecture,
( r2(esk2_1(X1),esk1_1(X1))
| r1(esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( X1 = esk1_1(X1)
| r1(esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( X1 = esk4_0
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( r1(esk2_1(X1))
| r1(esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_12,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_13,plain,
! [X6,X8] :
( ( r2(X6,X8)
| ~ r2(X6,X8) )
& ( X8 = esk8_1(X6)
| ~ r2(X6,X8) )
& ( r2(X6,X8)
| X8 != esk8_1(X6) )
& ( X8 = esk8_1(X6)
| X8 != esk8_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_14,plain,
! [X30,X31,X32,X33] :
( ~ r2(X30,X33)
| X33 != X32
| ~ r2(X31,X32)
| X30 = X31 ),
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_3a])])])])]) ).
cnf(c_0_15,negated_conjecture,
( r2(esk2_1(X1),X1)
| r1(esk3_1(X1)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_16,negated_conjecture,
( esk2_1(X1) = esk4_0
| r1(esk3_1(X1)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( r2(esk2_1(X1),esk1_1(X1))
| X1 = esk3_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
( X1 = esk1_1(X1)
| X1 = esk3_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
( r1(esk2_1(X1))
| X1 = esk3_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,plain,
( ~ r2(X1,X2)
| X3 != X2
| ~ r1(X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
( r2(X2,X1)
| X1 != esk8_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
( X1 = X2
| ~ r2(X2,X3)
| X4 != X3
| ~ r2(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,negated_conjecture,
( r2(esk4_0,X1)
| r1(esk3_1(X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,negated_conjecture,
( esk3_1(X1) = X1
| r2(esk2_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( esk2_1(X1) = esk4_0
| esk3_1(X1) = X1 ),
inference(spm,[status(thm)],[c_0_10,c_0_19]) ).
cnf(c_0_26,plain,
( ~ r2(X1,X2)
| ~ r1(X2) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
r2(X1,esk8_1(X1)),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
( X1 = X2
| ~ r2(X2,X3)
| ~ r2(X1,X3) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( esk3_1(X1) = esk4_0
| r2(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( esk3_1(X1) = X1
| r2(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
~ r1(esk8_1(X1)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( r1(X1)
| X1 != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_33,plain,
( X1 = X2
| ~ r2(X1,esk8_1(X2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( X1 = esk4_0
| r2(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
esk8_1(X1) != esk4_0,
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
esk4_0 = X1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_37,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NUN068+2 : TPTP v8.1.0. Released v7.3.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Thu Jun 2 08:21:06 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.25/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.44 # Preprocessing time : 0.015 s
% 0.25/1.44
% 0.25/1.44 # Proof found!
% 0.25/1.44 # SZS status Theorem
% 0.25/1.44 # SZS output start CNFRefutation
% See solution above
% 0.25/1.44 # Proof object total steps : 38
% 0.25/1.44 # Proof object clause steps : 27
% 0.25/1.44 # Proof object formula steps : 11
% 0.25/1.44 # Proof object conjectures : 18
% 0.25/1.44 # Proof object clause conjectures : 15
% 0.25/1.44 # Proof object formula conjectures : 3
% 0.25/1.44 # Proof object initial clauses used : 11
% 0.25/1.44 # Proof object initial formulas used : 5
% 0.25/1.44 # Proof object generating inferences : 13
% 0.25/1.44 # Proof object simplifying inferences : 5
% 0.25/1.44 # Training examples: 0 positive, 0 negative
% 0.25/1.44 # Parsed axioms : 12
% 0.25/1.44 # Removed by relevancy pruning/SinE : 6
% 0.25/1.44 # Initial clauses : 20
% 0.25/1.44 # Removed in clause preprocessing : 4
% 0.25/1.44 # Initial clauses in saturation : 16
% 0.25/1.44 # Processed clauses : 80
% 0.25/1.44 # ...of these trivial : 0
% 0.25/1.44 # ...subsumed : 23
% 0.25/1.44 # ...remaining for further processing : 57
% 0.25/1.44 # Other redundant clauses eliminated : 3
% 0.25/1.44 # Clauses deleted for lack of memory : 0
% 0.25/1.44 # Backward-subsumed : 3
% 0.25/1.44 # Backward-rewritten : 47
% 0.25/1.44 # Generated clauses : 156
% 0.25/1.44 # ...of the previous two non-trivial : 139
% 0.25/1.44 # Contextual simplify-reflections : 8
% 0.25/1.44 # Paramodulations : 151
% 0.25/1.44 # Factorizations : 0
% 0.25/1.44 # Equation resolutions : 4
% 0.25/1.44 # Current number of processed clauses : 4
% 0.25/1.44 # Positive orientable unit clauses : 1
% 0.25/1.44 # Positive unorientable unit clauses: 1
% 0.25/1.44 # Negative unit clauses : 0
% 0.25/1.44 # Non-unit-clauses : 2
% 0.25/1.44 # Current number of unprocessed clauses: 13
% 0.25/1.44 # ...number of literals in the above : 22
% 0.25/1.44 # Current number of archived formulas : 0
% 0.25/1.44 # Current number of archived clauses : 51
% 0.25/1.44 # Clause-clause subsumption calls (NU) : 196
% 0.25/1.44 # Rec. Clause-clause subsumption calls : 187
% 0.25/1.44 # Non-unit clause-clause subsumptions : 32
% 0.25/1.44 # Unit Clause-clause subsumption calls : 4
% 0.25/1.44 # Rewrite failures with RHS unbound : 3
% 0.25/1.44 # BW rewrite match attempts : 13
% 0.25/1.44 # BW rewrite match successes : 13
% 0.25/1.44 # Condensation attempts : 0
% 0.25/1.44 # Condensation successes : 0
% 0.25/1.44 # Termbank termtop insertions : 2088
% 0.25/1.44
% 0.25/1.44 # -------------------------------------------------
% 0.25/1.44 # User time : 0.015 s
% 0.25/1.44 # System time : 0.004 s
% 0.25/1.44 # Total time : 0.019 s
% 0.25/1.44 # Maximum resident set size: 2848 pages
%------------------------------------------------------------------------------