TSTP Solution File: SWC023+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC023+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n025.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:13 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 45 ( 12 unt; 0 def)
% Number of atoms : 144 ( 47 equ)
% Maximal formula atoms : 27 ( 3 avg)
% Number of connectives : 142 ( 43 ~; 62 |; 24 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 22 ( 0 sgn 15 !; 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] :
( ssList(X5)
& neq(X5,nil)
& frontsegP(X2,X5)
& frontsegP(X1,X5) )
| ( ! [X6] :
( ssList(X6)
=> ( ~ neq(X6,nil)
| ~ frontsegP(X4,X6)
| ~ frontsegP(X3,X6) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax42,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax42) ).
fof(ax46,axiom,
! [X1] :
( ssList(X1)
=> ( frontsegP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax46) ).
fof(c_0_3,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)
& frontsegP(X2,X5)
& frontsegP(X1,X5) )
| ( ! [X6] :
( ssList(X6)
=> ( ~ neq(X6,nil)
| ~ frontsegP(X4,X6)
| ~ frontsegP(X3,X6) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_4,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)
& ( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ frontsegP(esk2_0,X11)
| ~ frontsegP(esk1_0,X11) )
& ( nil = esk4_0
| ssList(esk5_0) )
& ( nil = esk3_0
| ssList(esk5_0) )
& ( nil = esk4_0
| neq(esk5_0,nil) )
& ( nil = esk3_0
| neq(esk5_0,nil) )
& ( nil = esk4_0
| frontsegP(esk4_0,esk5_0) )
& ( nil = esk3_0
| frontsegP(esk4_0,esk5_0) )
& ( nil = esk4_0
| frontsegP(esk3_0,esk5_0) )
& ( nil = esk3_0
| 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_3])])])])])])])]) ).
cnf(c_0_5,negated_conjecture,
( neq(esk5_0,nil)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( ssList(esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( frontsegP(esk4_0,esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
( frontsegP(esk3_0,esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
( ~ frontsegP(esk1_0,X1)
| ~ frontsegP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,negated_conjecture,
neq(esk2_0,nil),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_14,plain,
! [X2] :
( ~ ssList(X2)
| frontsegP(X2,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax42])]) ).
fof(c_0_15,plain,
! [X2] :
( ( ~ frontsegP(nil,X2)
| nil = X2
| ~ ssList(X2) )
& ( nil != X2
| frontsegP(nil,X2)
| ~ ssList(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax46])])]) ).
cnf(c_0_16,negated_conjecture,
( nil = esk1_0
| neq(esk5_0,nil) ),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_17,negated_conjecture,
( nil = esk1_0
| ssList(esk5_0) ),
inference(rw,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_18,negated_conjecture,
( nil = esk1_0
| frontsegP(esk2_0,esk5_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_6]),c_0_9]) ).
cnf(c_0_19,negated_conjecture,
( nil = esk1_0
| frontsegP(esk1_0,esk5_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_6]),c_0_6]) ).
cnf(c_0_20,negated_conjecture,
( neq(esk5_0,nil)
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_21,negated_conjecture,
( ~ frontsegP(esk1_0,esk2_0)
| ~ frontsegP(esk2_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_22,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( frontsegP(nil,X1)
| ~ ssList(X1)
| nil != X1 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
nil = esk1_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_16]),c_0_17]),c_0_18]),c_0_19]) ).
cnf(c_0_25,negated_conjecture,
( frontsegP(esk3_0,esk5_0)
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_26,negated_conjecture,
( frontsegP(esk4_0,esk5_0)
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_27,negated_conjecture,
( ssList(esk5_0)
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_28,negated_conjecture,
( nil = esk2_0
| neq(esk5_0,nil) ),
inference(rw,[status(thm)],[c_0_20,c_0_9]) ).
cnf(c_0_29,negated_conjecture,
~ frontsegP(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_13])]) ).
cnf(c_0_30,plain,
( frontsegP(esk1_0,X1)
| esk1_0 != X1
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]) ).
cnf(c_0_31,negated_conjecture,
( nil = esk2_0
| frontsegP(esk1_0,esk5_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_9]),c_0_6]) ).
cnf(c_0_32,negated_conjecture,
( nil = esk2_0
| frontsegP(esk2_0,esk5_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_9]),c_0_9]) ).
cnf(c_0_33,negated_conjecture,
( nil = esk2_0
| ssList(esk5_0) ),
inference(rw,[status(thm)],[c_0_27,c_0_9]) ).
cnf(c_0_34,negated_conjecture,
( esk2_0 = esk1_0
| neq(esk5_0,esk1_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_24]),c_0_24]) ).
cnf(c_0_35,negated_conjecture,
esk2_0 != esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_13])]) ).
cnf(c_0_36,negated_conjecture,
( esk2_0 = esk1_0
| frontsegP(esk1_0,esk5_0) ),
inference(rw,[status(thm)],[c_0_31,c_0_24]) ).
cnf(c_0_37,negated_conjecture,
( esk2_0 = esk1_0
| frontsegP(esk2_0,esk5_0) ),
inference(rw,[status(thm)],[c_0_32,c_0_24]) ).
cnf(c_0_38,negated_conjecture,
( esk2_0 = esk1_0
| ssList(esk5_0) ),
inference(rw,[status(thm)],[c_0_33,c_0_24]) ).
cnf(c_0_39,negated_conjecture,
( ~ frontsegP(esk1_0,X1)
| ~ frontsegP(esk2_0,X1)
| ~ ssList(X1)
| ~ neq(X1,esk1_0) ),
inference(rw,[status(thm)],[c_0_11,c_0_24]) ).
cnf(c_0_40,negated_conjecture,
neq(esk5_0,esk1_0),
inference(sr,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
frontsegP(esk1_0,esk5_0),
inference(sr,[status(thm)],[c_0_36,c_0_35]) ).
cnf(c_0_42,negated_conjecture,
frontsegP(esk2_0,esk5_0),
inference(sr,[status(thm)],[c_0_37,c_0_35]) ).
cnf(c_0_43,negated_conjecture,
ssList(esk5_0),
inference(sr,[status(thm)],[c_0_38,c_0_35]) ).
cnf(c_0_44,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_39,c_0_40]),c_0_41]),c_0_42]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWC023+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 12 06:56:38 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43 # Preprocessing time : 0.021 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.44 # Proof object total steps : 45
% 0.25/1.44 # Proof object clause steps : 38
% 0.25/1.44 # Proof object formula steps : 7
% 0.25/1.44 # Proof object conjectures : 38
% 0.25/1.44 # Proof object clause conjectures : 35
% 0.25/1.44 # Proof object formula conjectures : 3
% 0.25/1.44 # Proof object initial clauses used : 15
% 0.25/1.44 # Proof object initial formulas used : 3
% 0.25/1.44 # Proof object generating inferences : 5
% 0.25/1.44 # Proof object simplifying inferences : 37
% 0.25/1.44 # Training examples: 0 positive, 0 negative
% 0.25/1.44 # Parsed axioms : 96
% 0.25/1.44 # Removed by relevancy pruning/SinE : 69
% 0.25/1.44 # Initial clauses : 56
% 0.25/1.44 # Removed in clause preprocessing : 0
% 0.25/1.44 # Initial clauses in saturation : 56
% 0.25/1.44 # Processed clauses : 83
% 0.25/1.44 # ...of these trivial : 2
% 0.25/1.44 # ...subsumed : 1
% 0.25/1.44 # ...remaining for further processing : 80
% 0.25/1.44 # Other redundant clauses eliminated : 7
% 0.25/1.44 # Clauses deleted for lack of memory : 0
% 0.25/1.44 # Backward-subsumed : 0
% 0.25/1.44 # Backward-rewritten : 28
% 0.25/1.44 # Generated clauses : 184
% 0.25/1.44 # ...of the previous two non-trivial : 172
% 0.25/1.44 # Contextual simplify-reflections : 9
% 0.25/1.44 # Paramodulations : 168
% 0.25/1.44 # Factorizations : 0
% 0.25/1.44 # Equation resolutions : 12
% 0.25/1.44 # Current number of processed clauses : 45
% 0.25/1.44 # Positive orientable unit clauses : 12
% 0.25/1.44 # Positive unorientable unit clauses: 0
% 0.25/1.44 # Negative unit clauses : 3
% 0.25/1.44 # Non-unit-clauses : 30
% 0.25/1.44 # Current number of unprocessed clauses: 66
% 0.25/1.44 # ...number of literals in the above : 350
% 0.25/1.44 # Current number of archived formulas : 0
% 0.25/1.44 # Current number of archived clauses : 32
% 0.25/1.44 # Clause-clause subsumption calls (NU) : 277
% 0.25/1.44 # Rec. Clause-clause subsumption calls : 74
% 0.25/1.44 # Non-unit clause-clause subsumptions : 10
% 0.25/1.44 # Unit Clause-clause subsumption calls : 9
% 0.25/1.44 # Rewrite failures with RHS unbound : 0
% 0.25/1.44 # BW rewrite match attempts : 1
% 0.25/1.44 # BW rewrite match successes : 1
% 0.25/1.44 # Condensation attempts : 0
% 0.25/1.44 # Condensation successes : 0
% 0.25/1.44 # Termbank termtop insertions : 7278
% 0.25/1.44
% 0.25/1.44 # -------------------------------------------------
% 0.25/1.44 # User time : 0.027 s
% 0.25/1.44 # System time : 0.004 s
% 0.25/1.44 # Total time : 0.031 s
% 0.25/1.44 # Maximum resident set size: 3184 pages
%------------------------------------------------------------------------------