TSTP Solution File: SWC080+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC080+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n016.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:34 EDT 2022
% Result : Theorem 0.26s 1.42s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 38 ( 14 unt; 0 def)
% Number of atoms : 182 ( 20 equ)
% Maximal formula atoms : 36 ( 4 avg)
% Number of connectives : 242 ( 98 ~; 98 |; 33 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 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 : 47 ( 0 sgn 24 !; 5 ?)
% 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)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ! [X6] :
( ~ ssList(X6)
| ~ neq(X6,nil)
| ~ frontsegP(X4,X6)
| ~ frontsegP(X3,X6) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
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(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax5) ).
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)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ! [X6] :
( ~ ssList(X6)
| ~ neq(X6,nil)
| ~ frontsegP(X4,X6)
| ~ frontsegP(X3,X6) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_6,negated_conjecture,
! [X11] :
( 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(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk2_0,X11)
| ~ segmentP(esk1_0,X11) )
& ( ~ neq(esk4_0,nil)
| ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk2_0,X11)
| ~ segmentP(esk1_0,X11) )
& ( neq(esk2_0,nil)
| ssList(esk5_0) )
& ( ~ neq(esk4_0,nil)
| ssList(esk5_0) )
& ( neq(esk2_0,nil)
| neq(esk5_0,nil) )
& ( ~ neq(esk4_0,nil)
| neq(esk5_0,nil) )
& ( neq(esk2_0,nil)
| frontsegP(esk4_0,esk5_0) )
& ( ~ neq(esk4_0,nil)
| frontsegP(esk4_0,esk5_0) )
& ( neq(esk2_0,nil)
| frontsegP(esk3_0,esk5_0) )
& ( ~ neq(esk4_0,nil)
| frontsegP(esk3_0,esk5_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]) ).
fof(c_0_8,plain,
! [X5,X6,X9,X10] :
( ( ssList(esk9_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk10_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( app(app(esk9_2(X5,X6),X6),esk10_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])])])])])])]) ).
fof(c_0_9,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_10,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,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_8]) ).
cnf(c_0_13,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_15,plain,
! [X4,X5,X7] :
( ( ssList(esk8_2(X4,X5))
| ~ frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( app(X5,esk8_2(X4,X5)) = X4
| ~ frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( ~ ssList(X7)
| app(X5,X7) != X4
| frontsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) ) ),
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)],[ax5])])])])])])]) ).
cnf(c_0_16,negated_conjecture,
( ~ segmentP(esk1_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_19,plain,
( app(X2,esk8_2(X1,X2)) = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( ssList(esk8_2(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,negated_conjecture,
( ~ segmentP(esk1_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_11]),c_0_17])]) ).
cnf(c_0_23,plain,
( segmentP(X1,X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19])]),c_0_20]) ).
cnf(c_0_24,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_21,c_0_11]) ).
cnf(c_0_25,negated_conjecture,
( ~ segmentP(esk1_0,X1)
| ~ frontsegP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_26,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_27,negated_conjecture,
( neq(esk5_0,nil)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_28,negated_conjecture,
( frontsegP(esk4_0,esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_29,negated_conjecture,
( frontsegP(esk3_0,esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_30,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_31,negated_conjecture,
( ssList(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_32,negated_conjecture,
( ~ frontsegP(esk4_0,X1)
| ~ frontsegP(esk1_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_26])]) ).
cnf(c_0_33,negated_conjecture,
neq(esk5_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_17])]) ).
cnf(c_0_34,negated_conjecture,
frontsegP(esk4_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_17])]) ).
cnf(c_0_35,negated_conjecture,
frontsegP(esk1_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_17])]) ).
cnf(c_0_36,negated_conjecture,
ssList(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_17])]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC080+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n016.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 09:54:12 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.26/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.42 # Preprocessing time : 0.021 s
% 0.26/1.42
% 0.26/1.42 # Proof found!
% 0.26/1.42 # SZS status Theorem
% 0.26/1.42 # SZS output start CNFRefutation
% See solution above
% 0.26/1.42 # Proof object total steps : 38
% 0.26/1.42 # Proof object clause steps : 28
% 0.26/1.42 # Proof object formula steps : 10
% 0.26/1.42 # Proof object conjectures : 24
% 0.26/1.42 # Proof object clause conjectures : 21
% 0.26/1.42 # Proof object formula conjectures : 3
% 0.26/1.42 # Proof object initial clauses used : 15
% 0.26/1.42 # Proof object initial formulas used : 5
% 0.26/1.42 # Proof object generating inferences : 5
% 0.26/1.42 # Proof object simplifying inferences : 27
% 0.26/1.42 # Training examples: 0 positive, 0 negative
% 0.26/1.42 # Parsed axioms : 96
% 0.26/1.42 # Removed by relevancy pruning/SinE : 62
% 0.26/1.42 # Initial clauses : 69
% 0.26/1.42 # Removed in clause preprocessing : 0
% 0.26/1.42 # Initial clauses in saturation : 69
% 0.26/1.42 # Processed clauses : 6003
% 0.26/1.42 # ...of these trivial : 201
% 0.26/1.42 # ...subsumed : 4918
% 0.26/1.42 # ...remaining for further processing : 884
% 0.26/1.42 # Other redundant clauses eliminated : 94
% 0.26/1.42 # Clauses deleted for lack of memory : 0
% 0.26/1.42 # Backward-subsumed : 57
% 0.26/1.42 # Backward-rewritten : 2
% 0.26/1.42 # Generated clauses : 20469
% 0.26/1.42 # ...of the previous two non-trivial : 18416
% 0.26/1.42 # Contextual simplify-reflections : 3795
% 0.26/1.42 # Paramodulations : 20309
% 0.26/1.42 # Factorizations : 0
% 0.26/1.42 # Equation resolutions : 160
% 0.26/1.42 # Current number of processed clauses : 822
% 0.26/1.42 # Positive orientable unit clauses : 19
% 0.26/1.42 # Positive unorientable unit clauses: 0
% 0.26/1.42 # Negative unit clauses : 19
% 0.26/1.42 # Non-unit-clauses : 784
% 0.26/1.42 # Current number of unprocessed clauses: 12272
% 0.26/1.42 # ...number of literals in the above : 77837
% 0.26/1.42 # Current number of archived formulas : 0
% 0.26/1.42 # Current number of archived clauses : 59
% 0.26/1.42 # Clause-clause subsumption calls (NU) : 259066
% 0.26/1.42 # Rec. Clause-clause subsumption calls : 154687
% 0.26/1.42 # Non-unit clause-clause subsumptions : 7023
% 0.26/1.42 # Unit Clause-clause subsumption calls : 1639
% 0.26/1.42 # Rewrite failures with RHS unbound : 0
% 0.26/1.42 # BW rewrite match attempts : 6
% 0.26/1.42 # BW rewrite match successes : 6
% 0.26/1.42 # Condensation attempts : 0
% 0.26/1.42 # Condensation successes : 0
% 0.26/1.42 # Termbank termtop insertions : 324640
% 0.26/1.42
% 0.26/1.42 # -------------------------------------------------
% 0.26/1.42 # User time : 0.761 s
% 0.26/1.42 # System time : 0.007 s
% 0.26/1.42 # Total time : 0.768 s
% 0.26/1.42 # Maximum resident set size: 15332 pages
%------------------------------------------------------------------------------