TSTP Solution File: SWC182+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC182+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n008.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:11 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 48 ( 15 unt; 0 def)
% Number of atoms : 148 ( 49 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 164 ( 64 ~; 58 |; 16 &)
% ( 1 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 55 ( 0 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X3
| X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(app(X6,cons(X5,nil)),X7) != X1
| ( ~ memberP(X6,X5)
& ~ memberP(X7,X5) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
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(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X3
| X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(app(X6,cons(X5,nil)),X7) != X1
| ( ~ memberP(X6,X5)
& ~ memberP(X7,X5) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_9,plain,
! [X3,X4] :
( ( nil = X4
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil = X3
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil != X4
| nil != X3
| nil = app(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)],[ax83])])])])])]) ).
fof(c_0_10,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& nil = esk3_0
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ssItem(esk5_0)
& ssList(esk6_0)
& ssList(esk7_0)
& app(app(esk6_0,cons(esk5_0,nil)),esk7_0) = esk1_0
& ( memberP(esk6_0,esk5_0)
| memberP(esk7_0,esk5_0) ) ),
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_8])])])])])]) ).
cnf(c_0_11,plain,
( nil = X2
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
nil = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
app(app(esk6_0,cons(esk5_0,nil)),esk7_0) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( esk3_0 = X1
| app(X2,X1) != esk3_0
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_12]) ).
cnf(c_0_16,negated_conjecture,
app(app(esk6_0,cons(esk5_0,esk3_0)),esk7_0) = esk3_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_12]),c_0_14]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_18,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssList(X4)
| ssList(app(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)],[ax26])])])])]) ).
cnf(c_0_19,negated_conjecture,
( esk7_0 = esk3_0
| ~ ssList(app(esk6_0,cons(esk5_0,esk3_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_20,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_22,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_23,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_24,negated_conjecture,
( esk7_0 = esk3_0
| ~ ssList(cons(esk5_0,esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_25,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_23,c_0_12]) ).
cnf(c_0_27,negated_conjecture,
ssItem(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_28,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,X5),X6) = app(X4,app(X5,X6)) ),
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)],[ax82])])])])]) ).
cnf(c_0_29,negated_conjecture,
esk7_0 = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).
fof(c_0_30,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
cnf(c_0_31,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,negated_conjecture,
app(app(esk6_0,cons(esk5_0,esk3_0)),esk3_0) = esk3_0,
inference(rw,[status(thm)],[c_0_16,c_0_29]) ).
cnf(c_0_33,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,plain,
( nil = X1
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_35,negated_conjecture,
( app(esk6_0,app(cons(esk5_0,esk3_0),esk3_0)) = esk3_0
| ~ ssList(cons(esk5_0,esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_26]),c_0_21])]) ).
cnf(c_0_36,plain,
( app(X1,esk3_0) = X1
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_33,c_0_12]) ).
cnf(c_0_37,plain,
( esk3_0 = X1
| app(X1,X2) != esk3_0
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_12]),c_0_12]) ).
cnf(c_0_38,negated_conjecture,
( app(esk6_0,cons(esk5_0,esk3_0)) = esk3_0
| ~ ssList(cons(esk5_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
fof(c_0_39,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_40,negated_conjecture,
( memberP(esk7_0,esk5_0)
| memberP(esk6_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_41,negated_conjecture,
( esk6_0 = esk3_0
| ~ ssList(cons(esk5_0,esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_21])]) ).
cnf(c_0_42,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( memberP(esk6_0,esk5_0)
| memberP(esk3_0,esk5_0) ),
inference(rw,[status(thm)],[c_0_40,c_0_29]) ).
cnf(c_0_44,negated_conjecture,
esk6_0 = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_45,plain,
( ~ memberP(esk3_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_42,c_0_12]) ).
cnf(c_0_46,negated_conjecture,
memberP(esk3_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC182+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n008.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 12 06:42:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.019 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 48
% 0.22/1.41 # Proof object clause steps : 32
% 0.22/1.41 # Proof object formula steps : 16
% 0.22/1.41 # Proof object conjectures : 22
% 0.22/1.41 # Proof object clause conjectures : 19
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 15
% 0.22/1.41 # Proof object initial formulas used : 8
% 0.22/1.41 # Proof object generating inferences : 8
% 0.22/1.41 # Proof object simplifying inferences : 30
% 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 : 75
% 0.22/1.41 # Initial clauses : 46
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 46
% 0.22/1.41 # Processed clauses : 63
% 0.22/1.41 # ...of these trivial : 3
% 0.22/1.41 # ...subsumed : 2
% 0.22/1.41 # ...remaining for further processing : 58
% 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 : 1
% 0.22/1.41 # Backward-rewritten : 12
% 0.22/1.41 # Generated clauses : 190
% 0.22/1.41 # ...of the previous two non-trivial : 165
% 0.22/1.41 # Contextual simplify-reflections : 7
% 0.22/1.41 # Paramodulations : 183
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 7
% 0.22/1.41 # Current number of processed clauses : 44
% 0.22/1.41 # Positive orientable unit clauses : 11
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 1
% 0.22/1.41 # Non-unit-clauses : 32
% 0.22/1.41 # Current number of unprocessed clauses: 101
% 0.22/1.41 # ...number of literals in the above : 599
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 13
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 365
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 108
% 0.22/1.41 # Non-unit clause-clause subsumptions : 10
% 0.22/1.41 # Unit Clause-clause subsumption calls : 54
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 2
% 0.22/1.41 # BW rewrite match successes : 2
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 7162
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.026 s
% 0.22/1.41 # System time : 0.001 s
% 0.22/1.41 # Total time : 0.027 s
% 0.22/1.41 # Maximum resident set size: 3172 pages
%------------------------------------------------------------------------------