%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC386+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n013.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:28:25 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 33 ( 7 unt; 0 def)
% Number of atoms : 131 ( 59 equ)
% Maximal formula atoms : 30 ( 3 avg)
% Number of connectives : 152 ( 54 ~; 60 |; 24 &)
% ( 1 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn 17 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5) ) )
& ( nil != X4
| nil != X3 ) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X6] :
( ssItem(X6)
& cons(X6,nil) = X1
& memberP(X2,X6) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5) ) )
& ( nil != X4
| nil != X3 ) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X6] :
( ssItem(X6)
& cons(X6,nil) = X1
& memberP(X2,X6) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_4,negated_conjecture,
! [X12] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( nil = esk4_0
| ssItem(esk5_0) )
& ( nil = esk3_0
| ssItem(esk5_0) )
& ( nil = esk4_0
| cons(esk5_0,nil) = esk3_0 )
& ( nil = esk3_0
| cons(esk5_0,nil) = esk3_0 )
& ( nil = esk4_0
| memberP(esk4_0,esk5_0) )
& ( nil = esk3_0
| memberP(esk4_0,esk5_0) )
& ( neq(esk2_0,nil)
| nil = esk2_0 )
& ( ~ ssItem(X12)
| cons(X12,nil) != esk1_0
| ~ memberP(esk2_0,X12)
| nil = esk2_0 )
& ( neq(esk2_0,nil)
| nil != esk1_0 )
& ( ~ ssItem(X12)
| cons(X12,nil) != esk1_0
| ~ memberP(esk2_0,X12)
| nil != esk1_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_3])])])])])])])]) ).
cnf(c_0_5,negated_conjecture,
( nil = esk2_0
| ~ memberP(esk2_0,X1)
| cons(X1,nil) != esk1_0
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_9,plain,
! [X2] :
( ~ ssItem(X2)
| ~ memberP(nil,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax38])])]) ).
cnf(c_0_10,negated_conjecture,
( nil = esk4_0
| cons(X1,nil) != esk1_0
| ~ memberP(esk4_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( memberP(esk4_0,esk5_0)
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,negated_conjecture,
( ssItem(esk5_0)
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
( cons(esk5_0,nil) = esk1_0
| nil = esk4_0 ),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_14,negated_conjecture,
( memberP(esk4_0,esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,negated_conjecture,
( ssItem(esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,negated_conjecture,
( neq(esk2_0,nil)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
nil = esk4_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( nil = esk1_0
| memberP(esk4_0,esk5_0) ),
inference(rw,[status(thm)],[c_0_14,c_0_8]) ).
cnf(c_0_20,negated_conjecture,
( nil = esk1_0
| ssItem(esk5_0) ),
inference(rw,[status(thm)],[c_0_15,c_0_8]) ).
fof(c_0_21,plain,
! [X3,X4] :
( ( ~ neq(X3,X4)
| X3 != X4
| ~ ssList(X4)
| ~ ssList(X3) )
& ( X3 = X4
| neq(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) ) ),
inference(distribute,[status(thm)],[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)],[ax15])])])])])]) ).
cnf(c_0_22,negated_conjecture,
( neq(esk4_0,nil)
| nil != esk1_0 ),
inference(rw,[status(thm)],[c_0_16,c_0_6]) ).
cnf(c_0_23,plain,
( ~ memberP(esk4_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( esk4_0 = esk1_0
| memberP(esk4_0,esk5_0) ),
inference(rw,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( esk4_0 = esk1_0
| ssItem(esk5_0) ),
inference(rw,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( neq(esk4_0,esk4_0)
| esk4_0 != esk1_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_18]),c_0_18]) ).
cnf(c_0_28,negated_conjecture,
esk4_0 = esk1_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_30,negated_conjecture,
neq(esk1_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_28]),c_0_28])]) ).
cnf(c_0_31,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC386+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 12 20:28:14 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.020 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 33
% 0.23/1.42 # Proof object clause steps : 26
% 0.23/1.42 # Proof object formula steps : 7
% 0.23/1.42 # Proof object conjectures : 25
% 0.23/1.42 # Proof object clause conjectures : 22
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 12
% 0.23/1.42 # Proof object initial formulas used : 3
% 0.23/1.42 # Proof object generating inferences : 3
% 0.23/1.42 # Proof object simplifying inferences : 21
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 96
% 0.23/1.42 # Removed by relevancy pruning/SinE : 73
% 0.23/1.42 # Initial clauses : 54
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 54
% 0.23/1.42 # Processed clauses : 75
% 0.23/1.42 # ...of these trivial : 2
% 0.23/1.42 # ...subsumed : 1
% 0.23/1.42 # ...remaining for further processing : 72
% 0.23/1.42 # Other redundant clauses eliminated : 4
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 0
% 0.23/1.42 # Backward-rewritten : 33
% 0.23/1.42 # Generated clauses : 205
% 0.23/1.42 # ...of the previous two non-trivial : 184
% 0.23/1.42 # Contextual simplify-reflections : 6
% 0.23/1.42 # Paramodulations : 195
% 0.23/1.42 # Factorizations : 1
% 0.23/1.42 # Equation resolutions : 9
% 0.23/1.42 # Current number of processed clauses : 36
% 0.23/1.42 # Positive orientable unit clauses : 8
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 2
% 0.23/1.42 # Non-unit-clauses : 26
% 0.23/1.42 # Current number of unprocessed clauses: 55
% 0.23/1.42 # ...number of literals in the above : 312
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 33
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 255
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 48
% 0.23/1.42 # Non-unit clause-clause subsumptions : 7
% 0.23/1.42 # Unit Clause-clause subsumption calls : 0
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 2
% 0.23/1.42 # BW rewrite match successes : 2
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 7368
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.028 s
% 0.23/1.42 # System time : 0.003 s
% 0.23/1.42 # Total time : 0.031 s
% 0.23/1.42 # Maximum resident set size: 3172 pages
%------------------------------------------------------------------------------