TSTP Solution File: SWC364+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC364+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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:17 EDT 2022
% Result : Theorem 0.28s 1.45s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 50 ( 15 unt; 0 def)
% Number of atoms : 182 ( 44 equ)
% Maximal formula atoms : 22 ( 3 avg)
% Number of connectives : 220 ( 88 ~; 87 |; 20 &)
% ( 1 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn 38 !; 2 ?)
% 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)
=> app(cons(X5,nil),X3) != X4 )
| segmentP(X2,X1) )
& ( ~ 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(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax79,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X3,X2) = app(X1,X2)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax79) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ! [X5] :
( ssItem(X5)
=> app(cons(X5,nil),X3) != X4 )
| segmentP(X2,X1) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_9,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])])])])]) ).
fof(c_0_10,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| cons(X4,X3) = app(cons(X4,nil),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)],[ax81])])])])]) ).
fof(c_0_11,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssItem(X6)
| cons(X6,app(X5,X4)) = app(cons(X6,X5),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)],[ax27])])])])]) ).
fof(c_0_12,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
fof(c_0_13,negated_conjecture,
( 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_0) )
& ( ~ neq(esk4_0,nil)
| ssItem(esk5_0) )
& ( neq(esk2_0,nil)
| app(cons(esk5_0,nil),esk3_0) = esk4_0 )
& ( ~ neq(esk4_0,nil)
| app(cons(esk5_0,nil),esk3_0) = esk4_0 )
& ( neq(esk2_0,nil)
| ~ segmentP(esk2_0,esk1_0) )
& ( ~ neq(esk4_0,nil)
| ~ segmentP(esk2_0,esk1_0) ) ),
inference(distribute,[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_8])])])])])])]) ).
cnf(c_0_14,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_19,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(X6,X5) != app(X4,X5)
| X6 = 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)],[ax79])])])])]) ).
cnf(c_0_21,plain,
( ssList(app(cons(X1,nil),X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,plain,
( app(cons(X1,X2),nil) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_23,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,plain,
( X1 = X2
| app(X1,X3) != app(X2,X3)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_18])]) ).
cnf(c_0_27,negated_conjecture,
( app(cons(esk5_0,nil),esk3_0) = esk4_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_28,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_29,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( X1 = cons(X2,nil)
| app(X1,X3) != cons(X2,X3)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_15]),c_0_26]) ).
cnf(c_0_31,negated_conjecture,
app(cons(esk5_0,nil),esk1_0) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_32,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_33,negated_conjecture,
( ssItem(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_34,negated_conjecture,
( cons(esk5_0,nil) = cons(X1,nil)
| cons(X1,esk1_0) != esk4_0
| ~ ssList(cons(esk5_0,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_35,negated_conjecture,
ssItem(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_29])]) ).
cnf(c_0_36,negated_conjecture,
( cons(esk5_0,nil) = cons(X1,nil)
| cons(X1,esk1_0) != esk4_0
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_14]),c_0_18]),c_0_35])]) ).
fof(c_0_37,plain,
! [X5,X6,X9,X10] :
( ( ssList(esk8_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk9_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( app(app(esk8_2(X5,X6),X6),esk9_2(X5,X6)) = X5
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ~ ssList(X9)
| ~ ssList(X10)
| app(app(X9,X6),X10) != X5
| segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) ) ),
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)],[ax7])])])])])])]) ).
cnf(c_0_38,negated_conjecture,
( ssList(cons(esk5_0,nil))
| cons(X1,esk1_0) != esk4_0
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_36]),c_0_18])]) ).
cnf(c_0_39,negated_conjecture,
cons(esk5_0,esk1_0) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_15]),c_0_32]),c_0_35])]) ).
cnf(c_0_40,negated_conjecture,
( ~ segmentP(esk2_0,esk1_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_41,plain,
( segmentP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,negated_conjecture,
ssList(cons(esk5_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_35])]) ).
cnf(c_0_43,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_44,negated_conjecture,
( ~ segmentP(esk4_0,esk1_0)
| ~ neq(esk4_0,nil) ),
inference(rw,[status(thm)],[c_0_40,c_0_24]) ).
cnf(c_0_45,negated_conjecture,
( segmentP(X1,esk1_0)
| app(esk4_0,X2) != X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_31]),c_0_32])]),c_0_42])]) ).
cnf(c_0_46,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_43,c_0_24]) ).
cnf(c_0_47,negated_conjecture,
~ segmentP(esk4_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_29])]) ).
cnf(c_0_48,negated_conjecture,
( segmentP(X1,esk1_0)
| esk4_0 != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_17]),c_0_18]),c_0_46])]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWC364+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.14 % Command : run_ET %s %d
% 0.15/0.35 % Computer : n019.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sun Jun 12 10:55:40 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.28/1.45 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.28/1.45 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.28/1.45 # Preprocessing time : 0.020 s
% 0.28/1.45
% 0.28/1.45 # Proof found!
% 0.28/1.45 # SZS status Theorem
% 0.28/1.45 # SZS output start CNFRefutation
% See solution above
% 0.28/1.45 # Proof object total steps : 50
% 0.28/1.45 # Proof object clause steps : 34
% 0.28/1.45 # Proof object formula steps : 16
% 0.28/1.45 # Proof object conjectures : 26
% 0.28/1.45 # Proof object clause conjectures : 23
% 0.28/1.45 # Proof object formula conjectures : 3
% 0.28/1.45 # Proof object initial clauses used : 15
% 0.28/1.45 # Proof object initial formulas used : 8
% 0.28/1.45 # Proof object generating inferences : 12
% 0.28/1.45 # Proof object simplifying inferences : 37
% 0.28/1.45 # Training examples: 0 positive, 0 negative
% 0.28/1.45 # Parsed axioms : 96
% 0.28/1.45 # Removed by relevancy pruning/SinE : 70
% 0.28/1.45 # Initial clauses : 52
% 0.28/1.45 # Removed in clause preprocessing : 0
% 0.28/1.45 # Initial clauses in saturation : 52
% 0.28/1.45 # Processed clauses : 783
% 0.28/1.45 # ...of these trivial : 31
% 0.28/1.45 # ...subsumed : 523
% 0.28/1.45 # ...remaining for further processing : 229
% 0.28/1.45 # Other redundant clauses eliminated : 10
% 0.28/1.45 # Clauses deleted for lack of memory : 0
% 0.28/1.45 # Backward-subsumed : 9
% 0.28/1.45 # Backward-rewritten : 21
% 0.28/1.45 # Generated clauses : 4285
% 0.28/1.45 # ...of the previous two non-trivial : 3773
% 0.28/1.45 # Contextual simplify-reflections : 145
% 0.28/1.45 # Paramodulations : 4259
% 0.28/1.45 # Factorizations : 0
% 0.28/1.45 # Equation resolutions : 26
% 0.28/1.45 # Current number of processed clauses : 197
% 0.28/1.45 # Positive orientable unit clauses : 24
% 0.28/1.45 # Positive unorientable unit clauses: 0
% 0.28/1.45 # Negative unit clauses : 13
% 0.28/1.45 # Non-unit-clauses : 160
% 0.28/1.45 # Current number of unprocessed clauses: 2860
% 0.28/1.45 # ...number of literals in the above : 16480
% 0.28/1.45 # Current number of archived formulas : 0
% 0.28/1.45 # Current number of archived clauses : 30
% 0.28/1.45 # Clause-clause subsumption calls (NU) : 6485
% 0.28/1.45 # Rec. Clause-clause subsumption calls : 2770
% 0.28/1.45 # Non-unit clause-clause subsumptions : 375
% 0.28/1.45 # Unit Clause-clause subsumption calls : 83
% 0.28/1.45 # Rewrite failures with RHS unbound : 0
% 0.28/1.45 # BW rewrite match attempts : 14
% 0.28/1.45 # BW rewrite match successes : 9
% 0.28/1.45 # Condensation attempts : 0
% 0.28/1.45 # Condensation successes : 0
% 0.28/1.45 # Termbank termtop insertions : 76656
% 0.28/1.45
% 0.28/1.45 # -------------------------------------------------
% 0.28/1.45 # User time : 0.167 s
% 0.28/1.45 # System time : 0.007 s
% 0.28/1.45 # Total time : 0.174 s
% 0.28/1.45 # Maximum resident set size: 5824 pages
%------------------------------------------------------------------------------