TSTP Solution File: NUN054+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUN054+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n026.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:00 EDT 2022
% Result : Theorem 0.22s 1.42s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 44 ( 23 unt; 0 def)
% Number of atoms : 125 ( 38 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 133 ( 52 ~; 42 |; 39 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-2 aty)
% Number of variables : 100 ( 5 sgn 24 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
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_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_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_3,axiom,
! [X6,X7] :
? [X8] :
! [X9] :
( ( ~ r3(X6,X7,X9)
& X9 != X8 )
| ( r3(X6,X7,X9)
& X9 = X8 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_3) ).
fof(zeroplusoneeqone,conjecture,
? [X39] :
( ? [X22] :
( ? [X16] :
( r1(X16)
& r3(X16,X22,X39) )
& ? [X17] :
( r1(X17)
& r2(X17,X22) ) )
& ? [X23] :
( X39 = X23
& ? [X25] :
( r1(X25)
& r2(X25,X23) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',zeroplusoneeqone) ).
fof(c_0_6,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])])])]) ).
fof(c_0_7,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])])])]) ).
cnf(c_0_8,plain,
r3(X1,esk11_1(X1),esk10_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
esk10_1(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( X1 = esk9_0
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
r1(esk11_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_12,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_13,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_14,plain,
! [X10,X11,X13] :
( ( r3(X10,X11,X13)
| ~ r3(X10,X11,X13) )
& ( X13 = esk12_2(X10,X11)
| ~ r3(X10,X11,X13) )
& ( r3(X10,X11,X13)
| X13 != esk12_2(X10,X11) )
& ( X13 = esk12_2(X10,X11)
| X13 != esk12_2(X10,X11) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_3])])])]) ).
cnf(c_0_15,plain,
r3(X1,esk11_1(X1),X1),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_16,plain,
esk11_1(X1) = esk9_0,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_17,negated_conjecture,
~ ? [X39] :
( ? [X22] :
( ? [X16] :
( r1(X16)
& r3(X16,X22,X39) )
& ? [X17] :
( r1(X17)
& r2(X17,X22) ) )
& ? [X23] :
( X39 = X23
& ? [X25] :
( r1(X25)
& r2(X25,X23) ) ) ),
inference(assume_negation,[status(cth)],[zeroplusoneeqone]) ).
cnf(c_0_18,plain,
r3(X1,esk4_2(X1,X2),esk3_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
esk3_2(X1,X2) = esk2_2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( X2 = esk1_1(X1)
| ~ r2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
r2(X1,esk4_2(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,plain,
r2(esk5_2(X1,X2),esk2_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,plain,
( X3 = esk12_2(X1,X2)
| ~ r3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
r3(X1,esk9_0,X1),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_25,plain,
r3(X1,X2,esk5_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_26,negated_conjecture,
! [X40,X41,X42,X43,X44,X45] :
( ~ r1(X42)
| ~ r3(X42,X41,X40)
| ~ r1(X43)
| ~ r2(X43,X41)
| X40 != X44
| ~ 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_17])])])])]) ).
cnf(c_0_27,plain,
r3(X1,esk4_2(X1,X2),esk2_2(X1,X2)),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_28,plain,
esk4_2(X1,X2) = esk1_1(X2),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,plain,
esk2_2(X1,X2) = esk1_1(esk5_2(X1,X2)),
inference(spm,[status(thm)],[c_0_20,c_0_22]) ).
cnf(c_0_30,plain,
esk12_2(X1,esk9_0) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
esk12_2(X1,X2) = esk5_2(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_25]) ).
cnf(c_0_32,negated_conjecture,
( ~ r2(X1,X2)
| ~ r1(X1)
| X3 != X2
| ~ r2(X4,X5)
| ~ r1(X4)
| ~ r3(X6,X5,X3)
| ~ r1(X6) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,plain,
r3(X1,esk1_1(X2),esk1_1(esk5_2(X1,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_34,plain,
esk5_2(X1,esk9_0) = X1,
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( ~ r3(X1,X2,X3)
| ~ r2(X4,X2)
| ~ r2(X5,X3)
| ~ r1(X1)
| ~ r1(X4)
| ~ r1(X5) ),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_36,plain,
r3(X1,esk1_1(esk9_0),esk1_1(X1)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
( r2(X2,X1)
| X1 != esk1_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_38,negated_conjecture,
( ~ r2(X1,esk1_1(esk9_0))
| ~ r2(X2,esk1_1(X3))
| ~ r1(X3)
| ~ r1(X1)
| ~ r1(X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,plain,
r2(X1,esk1_1(X1)),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_40,plain,
r1(esk9_0),
inference(rw,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_41,negated_conjecture,
( ~ r2(X1,esk1_1(X2))
| ~ r1(X2)
| ~ r1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_42,negated_conjecture,
~ r1(X1),
inference(spm,[status(thm)],[c_0_41,c_0_39]) ).
cnf(c_0_43,plain,
$false,
inference(sr,[status(thm)],[c_0_40,c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUN054+2 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n026.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 07:46:57 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.22/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.42 # Preprocessing time : 0.016 s
% 0.22/1.42
% 0.22/1.42 # Proof found!
% 0.22/1.42 # SZS status Theorem
% 0.22/1.42 # SZS output start CNFRefutation
% See solution above
% 0.22/1.42 # Proof object total steps : 44
% 0.22/1.42 # Proof object clause steps : 31
% 0.22/1.42 # Proof object formula steps : 13
% 0.22/1.42 # Proof object conjectures : 8
% 0.22/1.42 # Proof object clause conjectures : 5
% 0.22/1.42 # Proof object formula conjectures : 3
% 0.22/1.42 # Proof object initial clauses used : 13
% 0.22/1.42 # Proof object initial formulas used : 6
% 0.22/1.42 # Proof object generating inferences : 10
% 0.22/1.42 # Proof object simplifying inferences : 11
% 0.22/1.42 # Training examples: 0 positive, 0 negative
% 0.22/1.42 # Parsed axioms : 12
% 0.22/1.42 # Removed by relevancy pruning/SinE : 3
% 0.22/1.42 # Initial clauses : 27
% 0.22/1.42 # Removed in clause preprocessing : 8
% 0.22/1.42 # Initial clauses in saturation : 19
% 0.22/1.42 # Processed clauses : 81
% 0.22/1.42 # ...of these trivial : 1
% 0.22/1.42 # ...subsumed : 16
% 0.22/1.42 # ...remaining for further processing : 64
% 0.22/1.42 # Other redundant clauses eliminated : 6
% 0.22/1.42 # Clauses deleted for lack of memory : 0
% 0.22/1.42 # Backward-subsumed : 2
% 0.22/1.42 # Backward-rewritten : 9
% 0.22/1.42 # Generated clauses : 152
% 0.22/1.42 # ...of the previous two non-trivial : 133
% 0.22/1.42 # Contextual simplify-reflections : 8
% 0.22/1.42 # Paramodulations : 137
% 0.22/1.42 # Factorizations : 0
% 0.22/1.42 # Equation resolutions : 9
% 0.22/1.42 # Current number of processed clauses : 44
% 0.22/1.42 # Positive orientable unit clauses : 12
% 0.22/1.42 # Positive unorientable unit clauses: 0
% 0.22/1.42 # Negative unit clauses : 3
% 0.22/1.42 # Non-unit-clauses : 29
% 0.22/1.42 # Current number of unprocessed clauses: 29
% 0.22/1.42 # ...number of literals in the above : 76
% 0.22/1.42 # Current number of archived formulas : 0
% 0.22/1.42 # Current number of archived clauses : 19
% 0.22/1.42 # Clause-clause subsumption calls (NU) : 330
% 0.22/1.42 # Rec. Clause-clause subsumption calls : 248
% 0.22/1.42 # Non-unit clause-clause subsumptions : 26
% 0.22/1.42 # Unit Clause-clause subsumption calls : 28
% 0.22/1.42 # Rewrite failures with RHS unbound : 0
% 0.22/1.42 # BW rewrite match attempts : 11
% 0.22/1.42 # BW rewrite match successes : 8
% 0.22/1.42 # Condensation attempts : 0
% 0.22/1.42 # Condensation successes : 0
% 0.22/1.42 # Termbank termtop insertions : 2469
% 0.22/1.42
% 0.22/1.42 # -------------------------------------------------
% 0.22/1.42 # User time : 0.020 s
% 0.22/1.42 # System time : 0.001 s
% 0.22/1.42 # Total time : 0.021 s
% 0.22/1.42 # Maximum resident set size: 2852 pages
%------------------------------------------------------------------------------