TSTP Solution File: NUN076+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUN076+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n032.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:05 EDT 2022
% Result : Theorem 0.12s 1.31s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 18 unt; 0 def)
% Number of atoms : 102 ( 31 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 110 ( 44 ~; 34 |; 32 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-1 aty)
% Number of variables : 83 ( 15 sgn 18 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_5a,axiom,
! [X33] :
? [X34] :
( ? [X35] :
( r1(X35)
& r4(X33,X35,X34) )
& ? [X36] :
( r1(X36)
& X34 = X36 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_5a) ).
fof(thereexistsanevennumber,conjecture,
? [X39,X22,X23] :
( ? [X16] :
( X16 = X39
& ? [X25] :
( r4(X25,X22,X16)
& ? [X19] :
( r2(X19,X25)
& ? [X34] :
( r1(X34)
& r2(X34,X19) ) ) ) )
& ? [X17] :
( r3(X22,X23,X17)
& X17 = X39 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thereexistsanevennumber) ).
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(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(c_0_5,plain,
! [X37] :
( r1(esk19_1(X37))
& r4(X37,esk19_1(X37),esk18_1(X37))
& r1(esk20_1(X37))
& esk18_1(X37) = esk20_1(X37) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[axiom_5a])])])]) ).
fof(c_0_6,negated_conjecture,
~ ? [X39,X22,X23] :
( ? [X16] :
( X16 = X39
& ? [X25] :
( r4(X25,X22,X16)
& ? [X19] :
( r2(X19,X25)
& ? [X34] :
( r1(X34)
& r2(X34,X19) ) ) ) )
& ? [X17] :
( r3(X22,X23,X17)
& X17 = X39 ) ),
inference(assume_negation,[status(cth)],[thereexistsanevennumber]) ).
fof(c_0_7,plain,
! [X4] :
( ( r1(X4)
| ~ r1(X4) )
& ( X4 = esk16_0
| ~ r1(X4) )
& ( r1(X4)
| X4 != esk16_0 )
& ( X4 = esk16_0
| X4 != esk16_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,plain,
r1(esk20_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
esk18_1(X1) = esk20_1(X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_10,negated_conjecture,
! [X40,X41,X43,X44,X45,X46,X42,X47] :
( X43 != X40
| ~ r4(X44,X41,X43)
| ~ r2(X45,X44)
| ~ r1(X46)
| ~ r2(X46,X45)
| ~ r3(X41,X42,X47)
| X47 != X40 ),
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_6])])])])]) ).
cnf(c_0_11,plain,
( X1 = esk16_0
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
r1(esk18_1(X1)),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
r1(esk19_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_14,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_15,negated_conjecture,
( X1 != X2
| ~ r3(X3,X4,X1)
| ~ r2(X5,X6)
| ~ r1(X5)
| ~ r2(X6,X7)
| ~ r4(X7,X3,X8)
| X8 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
r4(X1,esk19_1(X1),esk18_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,plain,
esk18_1(X1) = esk16_0,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
esk19_1(X1) = esk16_0,
inference(spm,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_19,plain,
r3(X1,esk11_1(X1),esk10_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
esk10_1(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
r1(esk11_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
( ~ r4(X1,X2,X3)
| ~ r3(X2,X4,X3)
| ~ r2(X5,X1)
| ~ r2(X6,X5)
| ~ r1(X6) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_15])]) ).
cnf(c_0_23,plain,
r4(X1,esk16_0,esk16_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_24,plain,
r3(X1,esk11_1(X1),X1),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
esk11_1(X1) = esk16_0,
inference(spm,[status(thm)],[c_0_11,c_0_21]) ).
fof(c_0_26,plain,
! [X6,X8] :
( ( r2(X6,X8)
| ~ r2(X6,X8) )
& ( X8 = esk12_1(X6)
| ~ r2(X6,X8) )
& ( r2(X6,X8)
| X8 != esk12_1(X6) )
& ( X8 = esk12_1(X6)
| X8 != esk12_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_27,negated_conjecture,
( ~ r3(esk16_0,X1,esk16_0)
| ~ r2(X2,X3)
| ~ r2(X4,X2)
| ~ r1(X4) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
r3(X1,esk16_0,X1),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( r2(X2,X1)
| X1 != esk12_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( ~ r2(X1,X2)
| ~ r2(X3,X1)
| ~ r1(X3) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
r2(X1,esk12_1(X1)),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( ~ r2(X1,X2)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,plain,
r1(esk16_0),
inference(rw,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_34,negated_conjecture,
~ r1(X1),
inference(spm,[status(thm)],[c_0_32,c_0_31]) ).
cnf(c_0_35,plain,
$false,
inference(sr,[status(thm)],[c_0_33,c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.07 % Problem : NUN076+2 : TPTP v8.1.0. Released v7.3.0.
% 0.04/0.08 % Command : run_ET %s %d
% 0.07/0.26 % Computer : n032.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 600
% 0.07/0.26 % DateTime : Thu Jun 2 10:44:15 EDT 2022
% 0.07/0.26 % CPUTime :
% 0.12/1.31 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.12/1.31 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.12/1.31 # Preprocessing time : 0.010 s
% 0.12/1.31
% 0.12/1.31 # Proof found!
% 0.12/1.31 # SZS status Theorem
% 0.12/1.31 # SZS output start CNFRefutation
% See solution above
% 0.12/1.31 # Proof object total steps : 36
% 0.12/1.31 # Proof object clause steps : 25
% 0.12/1.31 # Proof object formula steps : 11
% 0.12/1.31 # Proof object conjectures : 9
% 0.12/1.31 # Proof object clause conjectures : 6
% 0.12/1.31 # Proof object formula conjectures : 3
% 0.12/1.31 # Proof object initial clauses used : 10
% 0.12/1.31 # Proof object initial formulas used : 5
% 0.12/1.31 # Proof object generating inferences : 8
% 0.12/1.31 # Proof object simplifying inferences : 9
% 0.12/1.31 # Training examples: 0 positive, 0 negative
% 0.12/1.31 # Parsed axioms : 12
% 0.12/1.31 # Removed by relevancy pruning/SinE : 0
% 0.12/1.31 # Initial clauses : 40
% 0.12/1.31 # Removed in clause preprocessing : 12
% 0.12/1.31 # Initial clauses in saturation : 28
% 0.12/1.31 # Processed clauses : 94
% 0.12/1.31 # ...of these trivial : 3
% 0.12/1.31 # ...subsumed : 8
% 0.12/1.31 # ...remaining for further processing : 83
% 0.12/1.31 # Other redundant clauses eliminated : 6
% 0.12/1.31 # Clauses deleted for lack of memory : 0
% 0.12/1.31 # Backward-subsumed : 4
% 0.12/1.31 # Backward-rewritten : 24
% 0.12/1.31 # Generated clauses : 143
% 0.12/1.31 # ...of the previous two non-trivial : 130
% 0.12/1.31 # Contextual simplify-reflections : 1
% 0.12/1.31 # Paramodulations : 128
% 0.12/1.31 # Factorizations : 0
% 0.12/1.31 # Equation resolutions : 11
% 0.12/1.31 # Current number of processed clauses : 47
% 0.12/1.31 # Positive orientable unit clauses : 17
% 0.12/1.31 # Positive unorientable unit clauses: 0
% 0.12/1.31 # Negative unit clauses : 3
% 0.12/1.31 # Non-unit-clauses : 27
% 0.12/1.31 # Current number of unprocessed clauses: 24
% 0.12/1.31 # ...number of literals in the above : 48
% 0.12/1.31 # Current number of archived formulas : 0
% 0.12/1.31 # Current number of archived clauses : 37
% 0.12/1.31 # Clause-clause subsumption calls (NU) : 236
% 0.12/1.31 # Rec. Clause-clause subsumption calls : 175
% 0.12/1.31 # Non-unit clause-clause subsumptions : 10
% 0.12/1.31 # Unit Clause-clause subsumption calls : 31
% 0.12/1.31 # Rewrite failures with RHS unbound : 0
% 0.12/1.31 # BW rewrite match attempts : 34
% 0.12/1.31 # BW rewrite match successes : 19
% 0.12/1.31 # Condensation attempts : 0
% 0.12/1.31 # Condensation successes : 0
% 0.12/1.31 # Termbank termtop insertions : 2678
% 0.12/1.31
% 0.12/1.31 # -------------------------------------------------
% 0.12/1.31 # User time : 0.011 s
% 0.12/1.31 # System time : 0.001 s
% 0.12/1.31 # Total time : 0.012 s
% 0.12/1.31 # Maximum resident set size: 2996 pages
%------------------------------------------------------------------------------