TSTP Solution File: NUN073+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUN073+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n023.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:04 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 37 ( 16 unt; 0 def)
% Number of atoms : 96 ( 38 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 114 ( 55 ~; 44 |; 15 &)
% ( 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 : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 51 ( 2 sgn 30 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(oneuneqtwo,conjecture,
! [X39] :
( ! [X22] :
( ! [X16] :
( ~ r1(X16)
| ~ r2(X16,X22) )
| X22 != X39 )
| ! [X23] :
( ! [X17] :
( ~ r1(X17)
| ~ r2(X17,X23) )
| ~ r2(X23,X39) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',oneuneqtwo) ).
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_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_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_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] :
( ! [X16] :
( ~ r1(X16)
| ~ r2(X16,X22) )
| X22 != X39 )
| ! [X23] :
( ! [X17] :
( ~ r1(X17)
| ~ r2(X17,X23) )
| ~ r2(X23,X39) ) ),
inference(assume_negation,[status(cth)],[oneuneqtwo]) ).
fof(c_0_6,plain,
! [X4] :
( ( r1(X4)
| ~ r1(X4) )
& ( X4 = esk10_0
| ~ r1(X4) )
& ( r1(X4)
| X4 != esk10_0 )
& ( X4 = esk10_0
| X4 != esk10_0 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_1])])])]) ).
fof(c_0_7,negated_conjecture,
( r1(esk3_0)
& r2(esk3_0,esk2_0)
& esk2_0 = esk1_0
& r1(esk5_0)
& r2(esk5_0,esk4_0)
& r2(esk4_0,esk1_0) ),
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])])])])])]) ).
cnf(c_0_8,plain,
( X1 = esk10_0
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
r1(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X6,X8] :
( ( r2(X6,X8)
| ~ r2(X6,X8) )
& ( X8 = esk6_1(X6)
| ~ r2(X6,X8) )
& ( r2(X6,X8)
| X8 != esk6_1(X6) )
& ( X8 = esk6_1(X6)
| X8 != esk6_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_11,negated_conjecture,
esk10_0 = esk5_0,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
r2(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
esk2_0 = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_14,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_15,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_16,plain,
( X2 = esk6_1(X1)
| ~ r2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
r2(esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,plain,
( X1 = esk5_0
| ~ r1(X1) ),
inference(rw,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_19,negated_conjecture,
r1(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,negated_conjecture,
r2(esk3_0,esk1_0),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_21,plain,
( ~ r2(X1,X2)
| X3 != X2
| ~ r1(X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( X1 = X2
| ~ r2(X2,X3)
| X4 != X3
| ~ r2(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
esk6_1(esk5_0) = esk4_0,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
esk5_0 = esk3_0,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
esk6_1(esk3_0) = esk1_0,
inference(spm,[status(thm)],[c_0_16,c_0_20]) ).
cnf(c_0_26,plain,
( ~ r2(X1,X2)
| ~ r1(X2) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_27,negated_conjecture,
r2(esk4_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_28,plain,
( r1(X1)
| X1 != esk10_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_29,plain,
( X1 = X2
| ~ r2(X2,X3)
| ~ r2(X1,X3) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_30,negated_conjecture,
esk4_0 = esk1_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_31,negated_conjecture,
~ r1(esk1_0),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( r1(X1)
| X1 != esk3_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_11]),c_0_24]) ).
cnf(c_0_33,negated_conjecture,
( X1 = esk3_0
| ~ r2(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_29,c_0_20]) ).
cnf(c_0_34,negated_conjecture,
r2(esk1_0,esk1_0),
inference(rw,[status(thm)],[c_0_27,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
esk3_0 != esk1_0,
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUN073+2 : TPTP v8.1.0. Released v7.3.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n023.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 06:54:11 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.015 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 37
% 0.23/1.41 # Proof object clause steps : 26
% 0.23/1.41 # Proof object formula steps : 11
% 0.23/1.41 # Proof object conjectures : 20
% 0.23/1.41 # Proof object clause conjectures : 17
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 11
% 0.23/1.41 # Proof object initial formulas used : 5
% 0.23/1.41 # Proof object generating inferences : 8
% 0.23/1.41 # Proof object simplifying inferences : 10
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 12
% 0.23/1.41 # Removed by relevancy pruning/SinE : 6
% 0.23/1.41 # Initial clauses : 20
% 0.23/1.41 # Removed in clause preprocessing : 4
% 0.23/1.41 # Initial clauses in saturation : 16
% 0.23/1.41 # Processed clauses : 47
% 0.23/1.41 # ...of these trivial : 2
% 0.23/1.41 # ...subsumed : 5
% 0.23/1.41 # ...remaining for further processing : 40
% 0.23/1.41 # Other redundant clauses eliminated : 2
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 10
% 0.23/1.41 # Generated clauses : 58
% 0.23/1.41 # ...of the previous two non-trivial : 59
% 0.23/1.41 # Contextual simplify-reflections : 1
% 0.23/1.41 # Paramodulations : 55
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 3
% 0.23/1.41 # Current number of processed clauses : 28
% 0.23/1.41 # Positive orientable unit clauses : 10
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 2
% 0.23/1.41 # Non-unit-clauses : 16
% 0.23/1.41 # Current number of unprocessed clauses: 23
% 0.23/1.41 # ...number of literals in the above : 52
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 10
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 15
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 15
% 0.23/1.41 # Non-unit clause-clause subsumptions : 2
% 0.23/1.41 # Unit Clause-clause subsumption calls : 11
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 3
% 0.23/1.41 # BW rewrite match successes : 3
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 1212
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.016 s
% 0.23/1.41 # System time : 0.001 s
% 0.23/1.41 # Total time : 0.017 s
% 0.23/1.41 # Maximum resident set size: 2852 pages
%------------------------------------------------------------------------------