TSTP Solution File: NUN057+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUN057+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n029.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.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 57 ( 25 unt; 0 def)
% Number of atoms : 199 ( 54 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 250 ( 108 ~; 91 |; 51 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 1 con; 0-2 aty)
% Number of variables : 166 ( 7 sgn 29 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(twoplustwoeqfour,conjecture,
? [X39] :
( ? [X22] :
( X39 = X22
& ? [X23] :
( r2(X23,X22)
& ? [X16] :
( r2(X16,X23)
& ? [X25] :
( r2(X25,X16)
& ? [X34] :
( r1(X34)
& r2(X34,X25) ) ) ) ) )
& ? [X17] :
( r3(X17,X17,X39)
& ? [X19] :
( r2(X19,X17)
& ? [X31] :
( r1(X31)
& r2(X31,X19) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',twoplustwoeqfour) ).
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(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_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(c_0_7,negated_conjecture,
~ ? [X39] :
( ? [X22] :
( X39 = X22
& ? [X23] :
( r2(X23,X22)
& ? [X16] :
( r2(X16,X23)
& ? [X25] :
( r2(X25,X16)
& ? [X34] :
( r1(X34)
& r2(X34,X25) ) ) ) ) )
& ? [X17] :
( r3(X17,X17,X39)
& ? [X19] :
( r2(X19,X17)
& ? [X31] :
( r1(X31)
& r2(X31,X19) ) ) ) ),
inference(assume_negation,[status(cth)],[twoplustwoeqfour]) ).
fof(c_0_8,negated_conjecture,
! [X40,X41,X42,X43,X44,X45,X46,X47,X48] :
( X40 != X41
| ~ r2(X42,X41)
| ~ r2(X43,X42)
| ~ r2(X44,X43)
| ~ r1(X45)
| ~ r2(X45,X44)
| ~ r3(X46,X46,X40)
| ~ r2(X47,X46)
| ~ r1(X48)
| ~ r2(X48,X47) ),
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_7])])])])]) ).
cnf(c_0_9,negated_conjecture,
( ~ r2(X1,X2)
| ~ r1(X1)
| ~ r2(X2,X3)
| ~ r3(X3,X3,X4)
| ~ r2(X5,X6)
| ~ r1(X5)
| ~ r2(X6,X7)
| ~ r2(X7,X8)
| ~ r2(X8,X9)
| X4 != X9 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_10,plain,
! [X20,X21] :
( r2(X21,esk7_2(X20,X21))
& r3(X20,esk7_2(X20,X21),esk6_2(X20,X21))
& esk6_2(X20,X21) = esk5_2(X20,X21)
& r2(esk8_2(X20,X21),esk5_2(X20,X21))
& r3(X20,X21,esk8_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_11,plain,
! [X6,X8] :
( ( r2(X6,X8)
| ~ r2(X6,X8) )
& ( X8 = esk2_1(X6)
| ~ r2(X6,X8) )
& ( r2(X6,X8)
| X8 != esk2_1(X6) )
& ( X8 = esk2_1(X6)
| X8 != esk2_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_12,negated_conjecture,
( ~ r3(X1,X1,X2)
| ~ r2(X3,X2)
| ~ r2(X4,X3)
| ~ r2(X5,X4)
| ~ r2(X6,X5)
| ~ r2(X7,X1)
| ~ r2(X8,X7)
| ~ r1(X6)
| ~ r1(X8) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
r3(X1,X2,esk8_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( X2 = esk2_1(X1)
| ~ r2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
r2(X1,esk7_2(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( ~ r2(X1,esk8_2(X2,X2))
| ~ r2(X3,X1)
| ~ r2(X4,X3)
| ~ r2(X5,X4)
| ~ r2(X6,X2)
| ~ r2(X7,X6)
| ~ r1(X5)
| ~ r1(X7) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( r2(X2,X1)
| X1 != esk2_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
esk7_2(X1,X2) = esk2_1(X2),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( esk8_2(X1,X1) != esk2_1(X2)
| ~ r2(X3,X2)
| ~ r2(X4,X3)
| ~ r2(X5,X4)
| ~ r2(X6,X1)
| ~ r2(X7,X6)
| ~ r1(X5)
| ~ r1(X7) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
r2(X1,esk2_1(X1)),
inference(rw,[status(thm)],[c_0_15,c_0_18]) ).
fof(c_0_21,plain,
! [X10,X11,X13] :
( ( r3(X10,X11,X13)
| ~ r3(X10,X11,X13) )
& ( X13 = esk3_2(X10,X11)
| ~ r3(X10,X11,X13) )
& ( r3(X10,X11,X13)
| X13 != esk3_2(X10,X11) )
& ( X13 = esk3_2(X10,X11)
| X13 != esk3_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_22,negated_conjecture,
( esk8_2(X1,X1) != esk2_1(esk2_1(X2))
| ~ r2(X3,X2)
| ~ r2(X4,X3)
| ~ r2(X5,X1)
| ~ r2(X6,X5)
| ~ r1(X4)
| ~ r1(X6) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( X3 = esk3_2(X1,X2)
| ~ r3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,plain,
r3(X1,esk7_2(X1,X2),esk6_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_25,plain,
esk6_2(X1,X2) = esk5_2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,plain,
r2(esk8_2(X1,X2),esk5_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_27,negated_conjecture,
( esk8_2(X1,X1) != esk2_1(esk2_1(X2))
| X2 != esk2_1(X3)
| ~ r2(X4,X3)
| ~ r2(X5,X1)
| ~ r2(X6,X5)
| ~ r1(X4)
| ~ r1(X6) ),
inference(spm,[status(thm)],[c_0_22,c_0_17]) ).
cnf(c_0_28,plain,
esk3_2(X1,X2) = esk8_2(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_13]) ).
cnf(c_0_29,plain,
r3(X1,esk7_2(X1,X2),esk5_2(X1,X2)),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
esk5_2(X1,X2) = esk2_1(esk8_2(X1,X2)),
inference(spm,[status(thm)],[c_0_14,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( esk8_2(X1,X1) != esk2_1(esk2_1(X2))
| X2 != esk2_1(esk2_1(X3))
| ~ r2(X4,X1)
| ~ r2(X5,X4)
| ~ r1(X3)
| ~ r1(X5) ),
inference(spm,[status(thm)],[c_0_27,c_0_20]) ).
cnf(c_0_32,plain,
( X1 = esk8_2(X2,X3)
| ~ r3(X2,X3,X1) ),
inference(rw,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_33,plain,
r3(X1,esk2_1(X2),esk2_1(esk8_2(X1,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_18]),c_0_30]) ).
fof(c_0_34,plain,
! [X33] :
( r1(esk14_1(X33))
& r3(X33,esk14_1(X33),esk13_1(X33))
& esk13_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_35,plain,
! [X4] :
( ( r1(X4)
| ~ r1(X4) )
& ( X4 = esk1_0
| ~ r1(X4) )
& ( r1(X4)
| X4 != esk1_0 )
& ( X4 = esk1_0
| X4 != esk1_0 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_1])])])]) ).
fof(c_0_36,plain,
! [X37] :
( r1(esk16_1(X37))
& r4(X37,esk16_1(X37),esk15_1(X37))
& r1(esk17_1(X37))
& esk15_1(X37) = esk17_1(X37) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[axiom_5a])])])]) ).
cnf(c_0_37,negated_conjecture,
( esk8_2(X1,X1) != esk2_1(esk2_1(esk2_1(esk2_1(X2))))
| ~ r2(X3,X1)
| ~ r2(X4,X3)
| ~ r1(X2)
| ~ r1(X4) ),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_38,plain,
esk8_2(X1,esk2_1(X2)) = esk2_1(esk8_2(X1,X2)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,plain,
r3(X1,esk14_1(X1),esk13_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,plain,
esk13_1(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,plain,
( X1 = esk1_0
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_42,plain,
r1(esk14_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_43,plain,
r1(esk17_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_44,plain,
esk15_1(X1) = esk17_1(X1),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_45,negated_conjecture,
( esk2_1(esk8_2(esk2_1(X1),X1)) != esk2_1(esk2_1(esk2_1(esk2_1(X2))))
| ~ r2(X3,esk2_1(X1))
| ~ r2(X4,X3)
| ~ r1(X2)
| ~ r1(X4) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_46,plain,
r3(X1,esk14_1(X1),X1),
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_47,plain,
esk14_1(X1) = esk1_0,
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,plain,
r1(esk15_1(X1)),
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
( esk2_1(esk8_2(esk2_1(X1),X1)) != esk2_1(esk2_1(esk2_1(esk2_1(X2))))
| ~ r2(X3,X1)
| ~ r1(X2)
| ~ r1(X3) ),
inference(spm,[status(thm)],[c_0_45,c_0_20]) ).
cnf(c_0_50,plain,
r3(X1,esk1_0,X1),
inference(rw,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,plain,
esk15_1(X1) = esk1_0,
inference(spm,[status(thm)],[c_0_41,c_0_48]) ).
cnf(c_0_52,negated_conjecture,
( esk2_1(esk2_1(esk8_2(esk2_1(esk2_1(X1)),X1))) != esk2_1(esk2_1(esk2_1(esk2_1(X2))))
| ~ r1(X2)
| ~ r1(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_20]),c_0_38]) ).
cnf(c_0_53,plain,
esk8_2(X1,esk1_0) = X1,
inference(spm,[status(thm)],[c_0_32,c_0_50]) ).
cnf(c_0_54,plain,
r1(esk1_0),
inference(rw,[status(thm)],[c_0_48,c_0_51]) ).
cnf(c_0_55,negated_conjecture,
( esk2_1(esk2_1(esk2_1(esk2_1(esk1_0)))) != esk2_1(esk2_1(esk2_1(esk2_1(X1))))
| ~ r1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_55]),c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUN057+2 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n029.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 04:32:46 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.25/1.43 # Preprocessing time : 0.017 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 57
% 0.25/1.43 # Proof object clause steps : 42
% 0.25/1.43 # Proof object formula steps : 15
% 0.25/1.43 # Proof object conjectures : 16
% 0.25/1.43 # Proof object clause conjectures : 13
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 15
% 0.25/1.43 # Proof object initial formulas used : 7
% 0.25/1.43 # Proof object generating inferences : 18
% 0.25/1.43 # Proof object simplifying inferences : 15
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 12
% 0.25/1.43 # Removed by relevancy pruning/SinE : 0
% 0.25/1.43 # Initial clauses : 40
% 0.25/1.43 # Removed in clause preprocessing : 12
% 0.25/1.43 # Initial clauses in saturation : 28
% 0.25/1.43 # Processed clauses : 2873
% 0.25/1.43 # ...of these trivial : 0
% 0.25/1.43 # ...subsumed : 1992
% 0.25/1.43 # ...remaining for further processing : 881
% 0.25/1.43 # Other redundant clauses eliminated : 289
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 17
% 0.25/1.43 # Backward-rewritten : 24
% 0.25/1.43 # Generated clauses : 40399
% 0.25/1.43 # ...of the previous two non-trivial : 39135
% 0.25/1.43 # Contextual simplify-reflections : 967
% 0.25/1.43 # Paramodulations : 39910
% 0.25/1.43 # Factorizations : 0
% 0.25/1.43 # Equation resolutions : 483
% 0.25/1.43 # Current number of processed clauses : 834
% 0.25/1.43 # Positive orientable unit clauses : 36
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 2
% 0.25/1.43 # Non-unit-clauses : 796
% 0.25/1.43 # Current number of unprocessed clauses: 34984
% 0.25/1.43 # ...number of literals in the above : 173117
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 45
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 449377
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 211031
% 0.25/1.43 # Non-unit clause-clause subsumptions : 2863
% 0.25/1.43 # Unit Clause-clause subsumption calls : 52
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 49
% 0.25/1.43 # BW rewrite match successes : 16
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 760669
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.601 s
% 0.25/1.43 # System time : 0.024 s
% 0.25/1.43 # Total time : 0.625 s
% 0.25/1.43 # Maximum resident set size: 30388 pages
% 0.25/23.43 eprover: CPU time limit exceeded, terminating
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49 eprover: No such file or directory
% 0.25/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.50 eprover: No such file or directory
% 0.25/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.50 eprover: No such file or directory
% 0.25/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.51 eprover: No such file or directory
% 0.25/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.51 eprover: No such file or directory
%------------------------------------------------------------------------------