%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC153+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n022.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 : Tue Jul 19 20:27:00 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 35 ( 17 unt; 0 def)
% Number of atoms : 211 ( 27 equ)
% Maximal formula atoms : 48 ( 6 avg)
% Number of connectives : 293 ( 117 ~; 112 |; 41 &)
% ( 0 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 6 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-2 aty)
% Number of variables : 80 ( 0 sgn 30 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X4 != X2
| X3 != X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) = X3
& leq(X6,X5)
& ( ~ leq(X5,X6)
| ? [X10] :
( ssItem(X10)
& memberP(X8,X10)
& ( ~ leq(X5,X10)
| ~ leq(X10,X6) ) ) ) ) ) ) ) )
| ! [X11] :
( ssItem(X11)
=> ! [X12] :
( ssItem(X12)
=> ! [X13] :
( ssList(X13)
=> ! [X14] :
( ssList(X14)
=> ! [X15] :
( ssList(X15)
=> ( app(app(app(app(X13,cons(X11,nil)),X14),cons(X12,nil)),X15) != X1
| ~ leq(X12,X11)
| ( ! [X16] :
( ssItem(X16)
=> ( ~ memberP(X14,X16)
| ( leq(X16,X12)
& leq(X11,X16) ) ) )
& leq(X11,X12) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax29,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( ( leq(X1,X2)
& leq(X2,X1) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax29) ).
fof(c_0_2,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X4 != X2
| X3 != X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) = X3
& leq(X6,X5)
& ( ~ leq(X5,X6)
| ? [X10] :
( ssItem(X10)
& memberP(X8,X10)
& ( ~ leq(X5,X10)
| ~ leq(X10,X6) ) ) ) ) ) ) ) )
| ! [X11] :
( ssItem(X11)
=> ! [X12] :
( ssItem(X12)
=> ! [X13] :
( ssList(X13)
=> ! [X14] :
( ssList(X14)
=> ! [X15] :
( ssList(X15)
=> ( app(app(app(app(X13,cons(X11,nil)),X14),cons(X12,nil)),X15) != X1
| ~ leq(X12,X11)
| ( ! [X16] :
( ssItem(X16)
=> ( ~ memberP(X14,X16)
| ( leq(X16,X12)
& leq(X11,X16) ) ) )
& leq(X11,X12) ) ) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_3,negated_conjecture,
! [X21,X22,X23,X24,X25,X26] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk4_0 = esk2_0
& esk3_0 = esk1_0
& ( leq(X21,X22)
| ~ ssList(X25)
| app(app(app(app(X23,cons(X21,nil)),X24),cons(X22,nil)),X25) != esk3_0
| ~ leq(X22,X21)
| ~ ssList(X24)
| ~ ssList(X23)
| ~ ssItem(X22)
| ~ ssItem(X21) )
& ( leq(X21,X26)
| ~ ssItem(X26)
| ~ memberP(X24,X26)
| ~ ssList(X25)
| app(app(app(app(X23,cons(X21,nil)),X24),cons(X22,nil)),X25) != esk3_0
| ~ leq(X22,X21)
| ~ ssList(X24)
| ~ ssList(X23)
| ~ ssItem(X22)
| ~ ssItem(X21) )
& ( leq(X26,X22)
| ~ ssItem(X26)
| ~ memberP(X24,X26)
| ~ ssList(X25)
| app(app(app(app(X23,cons(X21,nil)),X24),cons(X22,nil)),X25) != esk3_0
| ~ leq(X22,X21)
| ~ ssList(X24)
| ~ ssList(X23)
| ~ ssItem(X22)
| ~ ssItem(X21) )
& ssItem(esk5_0)
& ssItem(esk6_0)
& ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& app(app(app(app(esk7_0,cons(esk5_0,nil)),esk8_0),cons(esk6_0,nil)),esk9_0) = esk1_0
& leq(esk6_0,esk5_0)
& ( ssItem(esk10_0)
| ~ leq(esk5_0,esk6_0) )
& ( memberP(esk8_0,esk10_0)
| ~ leq(esk5_0,esk6_0) )
& ( ~ leq(esk10_0,esk6_0)
| ~ leq(esk5_0,esk10_0)
| ~ leq(esk5_0,esk6_0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[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_2])])])])])])])]) ).
cnf(c_0_4,negated_conjecture,
( leq(X1,X2)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ leq(X2,X1)
| app(app(app(app(X3,cons(X1,nil)),X4),cons(X2,nil)),X5) != esk3_0
| ~ ssList(X5) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
esk3_0 = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_6,plain,
! [X3,X4] :
( ~ ssItem(X3)
| ~ ssItem(X4)
| ~ leq(X3,X4)
| ~ leq(X4,X3)
| X3 = X4 ),
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)],[ax29])])])])]) ).
cnf(c_0_7,negated_conjecture,
( leq(X1,X2)
| app(app(app(app(X3,cons(X1,nil)),X4),cons(X2,nil)),X5) != esk1_0
| ~ leq(X2,X1)
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,negated_conjecture,
app(app(app(app(esk7_0,cons(esk5_0,nil)),esk8_0),cons(esk6_0,nil)),esk9_0) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
leq(esk6_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,negated_conjecture,
ssList(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,negated_conjecture,
ssList(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_13,negated_conjecture,
ssItem(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,negated_conjecture,
ssItem(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_15,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
leq(esk5_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10]),c_0_11]),c_0_12]),c_0_13]),c_0_14])]) ).
cnf(c_0_17,negated_conjecture,
( leq(X6,X2)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ leq(X2,X1)
| app(app(app(app(X3,cons(X1,nil)),X4),cons(X2,nil)),X5) != esk3_0
| ~ ssList(X5)
| ~ memberP(X4,X6)
| ~ ssItem(X6) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_18,negated_conjecture,
esk6_0 = esk5_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_9]),c_0_14]),c_0_13])]) ).
cnf(c_0_19,negated_conjecture,
( leq(X1,X2)
| app(app(app(app(X3,cons(X4,nil)),X5),cons(X2,nil)),X6) != esk1_0
| ~ leq(X2,X4)
| ~ memberP(X5,X1)
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssItem(X4) ),
inference(rw,[status(thm)],[c_0_17,c_0_5]) ).
cnf(c_0_20,negated_conjecture,
app(app(app(app(esk7_0,cons(esk5_0,nil)),esk8_0),cons(esk5_0,nil)),esk9_0) = esk1_0,
inference(rw,[status(thm)],[c_0_8,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
leq(esk5_0,esk5_0),
inference(rw,[status(thm)],[c_0_16,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( memberP(esk8_0,esk10_0)
| ~ leq(esk5_0,esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_23,negated_conjecture,
( ssItem(esk10_0)
| ~ leq(esk5_0,esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_24,negated_conjecture,
( leq(X1,X6)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ leq(X2,X1)
| app(app(app(app(X3,cons(X1,nil)),X4),cons(X2,nil)),X5) != esk3_0
| ~ ssList(X5)
| ~ memberP(X4,X6)
| ~ ssItem(X6) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_25,negated_conjecture,
( ~ leq(esk5_0,esk6_0)
| ~ leq(esk5_0,esk10_0)
| ~ leq(esk10_0,esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_26,negated_conjecture,
( leq(X1,esk5_0)
| ~ memberP(esk8_0,X1)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_10]),c_0_11]),c_0_12]),c_0_14])]) ).
cnf(c_0_27,negated_conjecture,
memberP(esk8_0,esk10_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_16])]) ).
cnf(c_0_28,negated_conjecture,
ssItem(esk10_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_16])]) ).
cnf(c_0_29,negated_conjecture,
( leq(X1,X2)
| app(app(app(app(X3,cons(X1,nil)),X4),cons(X5,nil)),X6) != esk1_0
| ~ leq(X5,X1)
| ~ memberP(X4,X2)
| ~ ssList(X6)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X5)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_24,c_0_5]) ).
cnf(c_0_30,negated_conjecture,
( ~ leq(esk5_0,esk10_0)
| ~ leq(esk10_0,esk5_0) ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_16])]),c_0_18]) ).
cnf(c_0_31,negated_conjecture,
leq(esk10_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_32,negated_conjecture,
( leq(esk5_0,X1)
| ~ memberP(esk8_0,X1)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_20]),c_0_21]),c_0_10]),c_0_11]),c_0_12]),c_0_14])]) ).
cnf(c_0_33,negated_conjecture,
~ leq(esk5_0,esk10_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_27]),c_0_28])]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC153+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n022.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 : Sun Jun 12 10:14:03 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43 # Preprocessing time : 0.023 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 : 35
% 0.25/1.43 # Proof object clause steps : 30
% 0.25/1.43 # Proof object formula steps : 5
% 0.25/1.43 # Proof object conjectures : 32
% 0.25/1.43 # Proof object clause conjectures : 29
% 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 : 2
% 0.25/1.43 # Proof object generating inferences : 6
% 0.25/1.43 # Proof object simplifying inferences : 42
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 96
% 0.25/1.43 # Removed by relevancy pruning/SinE : 66
% 0.25/1.43 # Initial clauses : 64
% 0.25/1.43 # Removed in clause preprocessing : 0
% 0.25/1.43 # Initial clauses in saturation : 64
% 0.25/1.43 # Processed clauses : 93
% 0.25/1.43 # ...of these trivial : 3
% 0.25/1.43 # ...subsumed : 4
% 0.25/1.43 # ...remaining for further processing : 86
% 0.25/1.43 # Other redundant clauses eliminated : 3
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 4
% 0.25/1.43 # Backward-rewritten : 10
% 0.25/1.43 # Generated clauses : 285
% 0.25/1.43 # ...of the previous two non-trivial : 256
% 0.25/1.43 # Contextual simplify-reflections : 4
% 0.25/1.43 # Paramodulations : 276
% 0.25/1.43 # Factorizations : 0
% 0.25/1.43 # Equation resolutions : 9
% 0.25/1.43 # Current number of processed clauses : 70
% 0.25/1.43 # Positive orientable unit clauses : 17
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 2
% 0.25/1.43 # Non-unit-clauses : 51
% 0.25/1.43 # Current number of unprocessed clauses: 187
% 0.25/1.43 # ...number of literals in the above : 1386
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 14
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 849
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 97
% 0.25/1.43 # Non-unit clause-clause subsumptions : 12
% 0.25/1.43 # Unit Clause-clause subsumption calls : 53
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 3
% 0.25/1.43 # BW rewrite match successes : 3
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 12055
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.049 s
% 0.25/1.43 # System time : 0.004 s
% 0.25/1.43 # Total time : 0.053 s
% 0.25/1.43 # Maximum resident set size: 3508 pages
%------------------------------------------------------------------------------