TSTP Solution File: SWC013+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC013+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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:09 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 11 unt; 0 def)
% Number of atoms : 169 ( 55 equ)
% Maximal formula atoms : 38 ( 4 avg)
% Number of connectives : 226 ( 91 ~; 86 |; 34 &)
% ( 1 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn 22 !; 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] :
( ssList(X5)
& X3 != X5
& ? [X6] :
( ssItem(X6)
& cons(X6,nil) = X5
& hd(X4) = X6
& neq(nil,X4) ) )
| ? [X7] :
( ssList(X7)
& X1 = X7
& ? [X8] :
( ssItem(X8)
& cons(X8,nil) = X7
& hd(X2) = X8
& neq(nil,X2) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X3 != X5
& ? [X6] :
( ssItem(X6)
& cons(X6,nil) = X5
& hd(X4) = X6
& neq(nil,X4) ) )
| ? [X7] :
( ssList(X7)
& X1 = X7
& ? [X8] :
( ssItem(X8)
& cons(X8,nil) = X7
& hd(X2) = X8
& neq(nil,X2) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_6,negated_conjecture,
! [X13,X14,X15,X16] :
( 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)
| ~ ssList(X13)
| esk3_0 = X13
| ~ ssItem(X14)
| cons(X14,nil) != X13
| hd(esk4_0) != X14
| ~ neq(nil,esk4_0) )
& ( ~ neq(esk4_0,nil)
| ~ ssList(X13)
| esk3_0 = X13
| ~ ssItem(X14)
| cons(X14,nil) != X13
| hd(esk4_0) != X14
| ~ neq(nil,esk4_0) )
& ( neq(esk2_0,nil)
| ~ ssList(X15)
| esk1_0 != X15
| ~ ssItem(X16)
| cons(X16,nil) != X15
| hd(esk2_0) != X16
| ~ neq(nil,esk2_0) )
& ( ~ neq(esk4_0,nil)
| ~ ssList(X15)
| esk1_0 != X15
| ~ ssItem(X16)
| cons(X16,nil) != X15
| hd(esk2_0) != X16
| ~ neq(nil,esk2_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_5])])])])])])])]) ).
cnf(c_0_7,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_8,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_7]) ).
cnf(c_0_9,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( esk3_0 = X2
| ~ neq(nil,esk4_0)
| hd(esk4_0) != X1
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( ~ neq(nil,esk2_0)
| hd(esk2_0) != X1
| cons(X1,nil) != X2
| ~ ssItem(X1)
| esk1_0 != X2
| ~ ssList(X2)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
( esk1_0 = X1
| cons(X2,nil) != X1
| hd(esk4_0) != X2
| ~ ssList(X1)
| ~ neq(nil,esk4_0)
| ~ ssItem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_15,negated_conjecture,
( cons(X1,nil) != X2
| hd(esk4_0) != X1
| ~ ssList(X2)
| ~ neq(nil,esk4_0)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_9]),c_0_9]),c_0_12])]),c_0_14]) ).
fof(c_0_16,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| ssList(cons(X4,X3)) ),
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)],[ax16])])])])]) ).
cnf(c_0_17,negated_conjecture,
( hd(esk4_0) != X1
| ~ ssList(cons(X1,nil))
| ~ neq(nil,esk4_0)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_18,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_20,negated_conjecture,
( hd(esk4_0) != X1
| ~ neq(nil,esk4_0)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
fof(c_0_21,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssItem(hd(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,negated_conjecture,
( ~ neq(nil,esk4_0)
| ~ ssItem(hd(esk4_0)) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_22,c_0_9]) ).
fof(c_0_26,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_27,negated_conjecture,
( nil = esk4_0
| ~ neq(nil,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_28,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,negated_conjecture,
nil = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_25]),c_0_19])]) ).
cnf(c_0_31,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_32,negated_conjecture,
neq(esk4_0,esk4_0),
inference(rw,[status(thm)],[c_0_12,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC013+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n020.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 16:03:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.019 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 34
% 0.22/1.41 # Proof object clause steps : 24
% 0.22/1.41 # Proof object formula steps : 10
% 0.22/1.41 # Proof object conjectures : 21
% 0.22/1.41 # Proof object clause conjectures : 18
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 11
% 0.22/1.41 # Proof object initial formulas used : 5
% 0.22/1.41 # Proof object generating inferences : 6
% 0.22/1.41 # Proof object simplifying inferences : 22
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 96
% 0.22/1.41 # Removed by relevancy pruning/SinE : 73
% 0.22/1.41 # Initial clauses : 44
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 44
% 0.22/1.41 # Processed clauses : 73
% 0.22/1.41 # ...of these trivial : 5
% 0.22/1.41 # ...subsumed : 6
% 0.22/1.41 # ...remaining for further processing : 62
% 0.22/1.41 # Other redundant clauses eliminated : 2
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 3
% 0.22/1.41 # Backward-rewritten : 23
% 0.22/1.41 # Generated clauses : 133
% 0.22/1.41 # ...of the previous two non-trivial : 124
% 0.22/1.41 # Contextual simplify-reflections : 4
% 0.22/1.41 # Paramodulations : 120
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 13
% 0.22/1.41 # Current number of processed clauses : 34
% 0.22/1.41 # Positive orientable unit clauses : 8
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 3
% 0.22/1.41 # Non-unit-clauses : 23
% 0.22/1.41 # Current number of unprocessed clauses: 40
% 0.22/1.41 # ...number of literals in the above : 190
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 26
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 203
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 101
% 0.22/1.41 # Non-unit clause-clause subsumptions : 12
% 0.22/1.41 # Unit Clause-clause subsumption calls : 5
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 1
% 0.22/1.41 # BW rewrite match successes : 1
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 5854
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.026 s
% 0.22/1.41 # System time : 0.002 s
% 0.22/1.41 # Total time : 0.028 s
% 0.22/1.41 # Maximum resident set size: 3172 pages
%------------------------------------------------------------------------------