%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC002+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n005.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:26:05 EDT 2022
% Result : Theorem 0.25s 1.45s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 33 ( 14 unt; 0 def)
% Number of atoms : 237 ( 69 equ)
% Maximal formula atoms : 96 ( 7 avg)
% Number of connectives : 341 ( 137 ~; 143 |; 45 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 54 ( 0 sgn 20 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X2
& app(X6,X7) = X1
& ! [X8] :
( ssItem(X8)
=> ( ~ memberP(X2,X8)
| ~ geq(X8,X5)
| X5 = X8 ) ) ) ) )
| ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ssList(X11)
=> ( app(app(X10,cons(X9,nil)),X11) != X4
| app(X10,X11) != X3
| ? [X12] :
( ssItem(X12)
& X9 != X12
& memberP(X4,X12)
& geq(X12,X9) ) ) ) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X2
& app(X6,X7) = X1
& ! [X8] :
( ssItem(X8)
=> ( ~ memberP(X2,X8)
| ~ geq(X8,X5)
| X5 = X8 ) ) ) ) )
| ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ssList(X11)
=> ( app(app(X10,cons(X9,nil)),X11) != X4
| app(X10,X11) != X3
| ? [X12] :
( ssItem(X12)
& X9 != X12
& memberP(X4,X12)
& geq(X12,X9) ) ) ) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_2,negated_conjecture,
! [X17,X18,X19,X24] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( neq(esk2_0,nil)
| neq(esk2_0,nil) )
& ( ~ neq(esk4_0,nil)
| neq(esk2_0,nil) )
& ( neq(esk2_0,nil)
| ssItem(esk5_2(X17,X18))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk2_0
| app(X18,X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( ~ neq(esk4_0,nil)
| ssItem(esk5_2(X17,X18))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk2_0
| app(X18,X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( neq(esk2_0,nil)
| memberP(esk2_0,esk5_2(X17,X18))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk2_0
| app(X18,X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( ~ neq(esk4_0,nil)
| memberP(esk2_0,esk5_2(X17,X18))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk2_0
| app(X18,X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( neq(esk2_0,nil)
| geq(esk5_2(X17,X18),X17)
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk2_0
| app(X18,X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( ~ neq(esk4_0,nil)
| geq(esk5_2(X17,X18),X17)
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk2_0
| app(X18,X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( neq(esk2_0,nil)
| X17 != esk5_2(X17,X18)
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk2_0
| app(X18,X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( ~ neq(esk4_0,nil)
| X17 != esk5_2(X17,X18)
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk2_0
| app(X18,X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( neq(esk2_0,nil)
| ssItem(esk6_0) )
& ( ~ neq(esk4_0,nil)
| ssItem(esk6_0) )
& ( neq(esk2_0,nil)
| ssList(esk7_0) )
& ( ~ neq(esk4_0,nil)
| ssList(esk7_0) )
& ( neq(esk2_0,nil)
| ssList(esk8_0) )
& ( ~ neq(esk4_0,nil)
| ssList(esk8_0) )
& ( neq(esk2_0,nil)
| app(app(esk7_0,cons(esk6_0,nil)),esk8_0) = esk4_0 )
& ( ~ neq(esk4_0,nil)
| app(app(esk7_0,cons(esk6_0,nil)),esk8_0) = esk4_0 )
& ( neq(esk2_0,nil)
| app(esk7_0,esk8_0) = esk3_0 )
& ( ~ neq(esk4_0,nil)
| app(esk7_0,esk8_0) = esk3_0 )
& ( neq(esk2_0,nil)
| ~ ssItem(X24)
| esk6_0 = X24
| ~ memberP(esk4_0,X24)
| ~ geq(X24,esk6_0) )
& ( ~ neq(esk4_0,nil)
| ~ ssItem(X24)
| esk6_0 = X24
| ~ memberP(esk4_0,X24)
| ~ geq(X24,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_1])])])])])])])]) ).
cnf(c_0_3,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( geq(esk5_2(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| app(X2,X3) != esk1_0
| app(app(X2,cons(X1,nil)),X3) != esk2_0
| ~ ssList(X3)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( app(app(esk7_0,cons(esk6_0,nil)),esk8_0) = esk4_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( app(esk7_0,esk8_0) = esk3_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( ssList(esk8_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
( ssList(esk7_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
( ssItem(esk6_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
( memberP(esk2_0,esk5_2(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2)
| app(X2,X3) != esk1_0
| app(app(X2,cons(X1,nil)),X3) != esk2_0
| ~ ssList(X3)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_15,negated_conjecture,
( ssItem(esk5_2(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2)
| app(X2,X3) != esk1_0
| app(app(X2,cons(X1,nil)),X3) != esk2_0
| ~ ssList(X3)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_16,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(X2,X3) != esk1_0
| app(app(X2,cons(X1,nil)),X3) != esk2_0
| ~ ssList(X3)
| X1 != esk5_2(X1,X2)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_17,negated_conjecture,
( esk6_0 = X1
| ~ geq(X1,esk6_0)
| ~ memberP(esk4_0,X1)
| ~ ssItem(X1)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_18,negated_conjecture,
( geq(esk5_2(X1,X2),X1)
| app(app(X2,cons(X1,nil)),X3) != esk4_0
| app(X2,X3) != esk3_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_5]),c_0_8])]) ).
cnf(c_0_19,negated_conjecture,
app(app(esk7_0,cons(esk6_0,nil)),esk8_0) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_8])]) ).
cnf(c_0_20,negated_conjecture,
app(esk7_0,esk8_0) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_8])]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk8_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_8])]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_8])]) ).
cnf(c_0_23,negated_conjecture,
ssItem(esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_8])]) ).
cnf(c_0_24,negated_conjecture,
( memberP(esk4_0,esk5_2(X1,X2))
| app(app(X2,cons(X1,nil)),X3) != esk4_0
| app(X2,X3) != esk3_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_5]),c_0_7]),c_0_5]),c_0_8])]) ).
cnf(c_0_25,negated_conjecture,
( ssItem(esk5_2(X1,X2))
| app(app(X2,cons(X1,nil)),X3) != esk4_0
| app(X2,X3) != esk3_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_7]),c_0_5]),c_0_8])]) ).
cnf(c_0_26,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk4_0
| app(X1,X3) != esk3_0
| esk5_2(X2,X1) != X2
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_7]),c_0_5]),c_0_8])]) ).
cnf(c_0_27,negated_conjecture,
( esk6_0 = X1
| ~ geq(X1,esk6_0)
| ~ memberP(esk4_0,X1)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_8])]) ).
cnf(c_0_28,negated_conjecture,
geq(esk5_2(esk6_0,esk7_0),esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21]),c_0_22])]),c_0_23])]) ).
cnf(c_0_29,negated_conjecture,
memberP(esk4_0,esk5_2(esk6_0,esk7_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_19]),c_0_20]),c_0_21]),c_0_22])]),c_0_23])]) ).
cnf(c_0_30,negated_conjecture,
ssItem(esk5_2(esk6_0,esk7_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_19]),c_0_20]),c_0_21]),c_0_22])]),c_0_23])]) ).
cnf(c_0_31,negated_conjecture,
esk5_2(esk6_0,esk7_0) != esk6_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_19]),c_0_20]),c_0_21]),c_0_22])]),c_0_23])]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC002+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.14/0.36 % Computer : n005.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jun 12 11:32:09 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.25/1.45 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.45 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.45 # Preprocessing time : 0.027 s
% 0.25/1.45
% 0.25/1.45 # Proof found!
% 0.25/1.45 # SZS status Theorem
% 0.25/1.45 # SZS output start CNFRefutation
% See solution above
% 0.25/1.45 # Proof object total steps : 33
% 0.25/1.45 # Proof object clause steps : 30
% 0.25/1.45 # Proof object formula steps : 3
% 0.25/1.45 # Proof object conjectures : 33
% 0.25/1.45 # Proof object clause conjectures : 30
% 0.25/1.45 # Proof object formula conjectures : 3
% 0.25/1.45 # Proof object initial clauses used : 13
% 0.25/1.45 # Proof object initial formulas used : 1
% 0.25/1.45 # Proof object generating inferences : 5
% 0.25/1.45 # Proof object simplifying inferences : 59
% 0.25/1.45 # Training examples: 0 positive, 0 negative
% 0.25/1.45 # Parsed axioms : 96
% 0.25/1.45 # Removed by relevancy pruning/SinE : 60
% 0.25/1.45 # Initial clauses : 82
% 0.25/1.45 # Removed in clause preprocessing : 0
% 0.25/1.45 # Initial clauses in saturation : 82
% 0.25/1.45 # Processed clauses : 147
% 0.25/1.45 # ...of these trivial : 24
% 0.25/1.45 # ...subsumed : 16
% 0.25/1.45 # ...remaining for further processing : 107
% 0.25/1.45 # Other redundant clauses eliminated : 5
% 0.25/1.45 # Clauses deleted for lack of memory : 0
% 0.25/1.45 # Backward-subsumed : 5
% 0.25/1.45 # Backward-rewritten : 1
% 0.25/1.45 # Generated clauses : 431
% 0.25/1.45 # ...of the previous two non-trivial : 363
% 0.25/1.45 # Contextual simplify-reflections : 0
% 0.25/1.45 # Paramodulations : 419
% 0.25/1.45 # Factorizations : 0
% 0.25/1.45 # Equation resolutions : 12
% 0.25/1.45 # Current number of processed clauses : 97
% 0.25/1.45 # Positive orientable unit clauses : 16
% 0.25/1.45 # Positive unorientable unit clauses: 0
% 0.25/1.45 # Negative unit clauses : 2
% 0.25/1.45 # Non-unit-clauses : 79
% 0.25/1.45 # Current number of unprocessed clauses: 276
% 0.25/1.45 # ...number of literals in the above : 1574
% 0.25/1.45 # Current number of archived formulas : 0
% 0.25/1.45 # Current number of archived clauses : 6
% 0.25/1.45 # Clause-clause subsumption calls (NU) : 1298
% 0.25/1.45 # Rec. Clause-clause subsumption calls : 459
% 0.25/1.45 # Non-unit clause-clause subsumptions : 21
% 0.25/1.45 # Unit Clause-clause subsumption calls : 76
% 0.25/1.45 # Rewrite failures with RHS unbound : 0
% 0.25/1.45 # BW rewrite match attempts : 1
% 0.25/1.45 # BW rewrite match successes : 1
% 0.25/1.45 # Condensation attempts : 0
% 0.25/1.45 # Condensation successes : 0
% 0.25/1.45 # Termbank termtop insertions : 12970
% 0.25/1.45
% 0.25/1.45 # -------------------------------------------------
% 0.25/1.45 # User time : 0.073 s
% 0.25/1.45 # System time : 0.003 s
% 0.25/1.45 # Total time : 0.076 s
% 0.25/1.45 # Maximum resident set size: 3508 pages
%------------------------------------------------------------------------------