TSTP Solution File: SWC016+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC016+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n006.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:10 EDT 2022
% Result : Theorem 0.17s 1.37s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 31 ( 6 unt; 0 def)
% Number of atoms : 133 ( 44 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 168 ( 66 ~; 66 |; 26 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 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 : 17 ( 0 sgn 11 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssList(X5)
=> ( ~ neq(X5,nil)
| ~ frontsegP(X4,X5)
| ~ frontsegP(X3,X5) ) )
& neq(X4,nil) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X6] :
( ssList(X6)
& neq(X6,nil)
& frontsegP(X2,X6)
& frontsegP(X1,X6) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssList(X5)
=> ( ~ neq(X5,nil)
| ~ frontsegP(X4,X5)
| ~ frontsegP(X3,X5) ) )
& neq(X4,nil) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X6] :
( ssList(X6)
& neq(X6,nil)
& frontsegP(X2,X6)
& frontsegP(X1,X6) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_2,negated_conjecture,
! [X12] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( nil = esk3_0
| nil != esk4_0 )
& ( ssList(esk5_0)
| ~ neq(esk4_0,nil) )
& ( neq(esk5_0,nil)
| ~ neq(esk4_0,nil) )
& ( frontsegP(esk4_0,esk5_0)
| ~ neq(esk4_0,nil) )
& ( frontsegP(esk3_0,esk5_0)
| ~ neq(esk4_0,nil) )
& ( neq(esk2_0,nil)
| nil = esk2_0 )
& ( ~ ssList(X12)
| ~ neq(X12,nil)
| ~ frontsegP(esk2_0,X12)
| ~ frontsegP(esk1_0,X12)
| nil = esk2_0 )
& ( neq(esk2_0,nil)
| nil != esk1_0 )
& ( ~ ssList(X12)
| ~ neq(X12,nil)
| ~ frontsegP(esk2_0,X12)
| ~ frontsegP(esk1_0,X12)
| nil != esk1_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_1])])])])])])])]) ).
cnf(c_0_3,negated_conjecture,
( neq(esk2_0,nil)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( nil != esk1_0
| ~ frontsegP(esk1_0,X1)
| ~ frontsegP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
( neq(esk5_0,nil)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
( neq(esk4_0,nil)
| nil != esk3_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4]),c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( ssList(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( nil = esk2_0
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( nil != esk3_0
| ~ frontsegP(esk3_0,X1)
| ~ frontsegP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_5]),c_0_5]),c_0_4]) ).
cnf(c_0_12,negated_conjecture,
( neq(esk5_0,nil)
| nil != esk3_0 ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( ssList(esk5_0)
| nil != esk3_0 ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_14,negated_conjecture,
( frontsegP(esk4_0,esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_15,negated_conjecture,
( frontsegP(esk3_0,esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_16,negated_conjecture,
( nil = esk2_0
| ~ frontsegP(esk1_0,X1)
| ~ frontsegP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_17,negated_conjecture,
( nil = esk4_0
| neq(esk4_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_4]),c_0_4]) ).
cnf(c_0_18,negated_conjecture,
( nil != esk3_0
| ~ frontsegP(esk3_0,esk5_0)
| ~ frontsegP(esk4_0,esk5_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( frontsegP(esk4_0,esk5_0)
| nil != esk3_0 ),
inference(spm,[status(thm)],[c_0_14,c_0_8]) ).
cnf(c_0_20,negated_conjecture,
( frontsegP(esk3_0,esk5_0)
| nil != esk3_0 ),
inference(spm,[status(thm)],[c_0_15,c_0_8]) ).
cnf(c_0_21,negated_conjecture,
( nil = esk4_0
| ~ frontsegP(esk3_0,X1)
| ~ frontsegP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_4]),c_0_5]),c_0_4]) ).
cnf(c_0_22,negated_conjecture,
( nil = esk4_0
| neq(esk5_0,nil) ),
inference(spm,[status(thm)],[c_0_7,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
( nil = esk4_0
| ssList(esk5_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
( nil = esk4_0
| frontsegP(esk4_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_25,negated_conjecture,
( nil = esk4_0
| frontsegP(esk3_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_26,negated_conjecture,
nil != esk3_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_27,negated_conjecture,
nil = esk4_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]),c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( nil = esk3_0
| nil != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_29,negated_conjecture,
esk4_0 != esk3_0,
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_27]),c_0_27])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : SWC016+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.11 % Command : run_ET %s %d
% 0.09/0.31 % Computer : n006.cluster.edu
% 0.09/0.31 % Model : x86_64 x86_64
% 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31 % Memory : 8042.1875MB
% 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31 % CPULimit : 300
% 0.09/0.31 % WCLimit : 600
% 0.09/0.31 % DateTime : Sun Jun 12 04:21:12 EDT 2022
% 0.13/0.31 % CPUTime :
% 0.17/1.37 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.17/1.37 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.17/1.37 # Preprocessing time : 0.018 s
% 0.17/1.37
% 0.17/1.37 # Proof found!
% 0.17/1.37 # SZS status Theorem
% 0.17/1.37 # SZS output start CNFRefutation
% See solution above
% 0.17/1.37 # Proof object total steps : 31
% 0.17/1.37 # Proof object clause steps : 28
% 0.17/1.37 # Proof object formula steps : 3
% 0.17/1.37 # Proof object conjectures : 31
% 0.17/1.37 # Proof object clause conjectures : 28
% 0.17/1.37 # Proof object formula conjectures : 3
% 0.17/1.37 # Proof object initial clauses used : 11
% 0.17/1.37 # Proof object initial formulas used : 1
% 0.17/1.37 # Proof object generating inferences : 11
% 0.17/1.37 # Proof object simplifying inferences : 20
% 0.17/1.37 # Training examples: 0 positive, 0 negative
% 0.17/1.37 # Parsed axioms : 96
% 0.17/1.37 # Removed by relevancy pruning/SinE : 69
% 0.17/1.37 # Initial clauses : 55
% 0.17/1.37 # Removed in clause preprocessing : 0
% 0.17/1.37 # Initial clauses in saturation : 55
% 0.17/1.37 # Processed clauses : 77
% 0.17/1.37 # ...of these trivial : 2
% 0.17/1.37 # ...subsumed : 7
% 0.17/1.37 # ...remaining for further processing : 67
% 0.17/1.37 # Other redundant clauses eliminated : 6
% 0.17/1.37 # Clauses deleted for lack of memory : 0
% 0.17/1.37 # Backward-subsumed : 1
% 0.17/1.37 # Backward-rewritten : 34
% 0.17/1.37 # Generated clauses : 166
% 0.17/1.37 # ...of the previous two non-trivial : 169
% 0.17/1.37 # Contextual simplify-reflections : 5
% 0.17/1.37 # Paramodulations : 155
% 0.17/1.37 # Factorizations : 0
% 0.17/1.37 # Equation resolutions : 11
% 0.17/1.37 # Current number of processed clauses : 29
% 0.17/1.37 # Positive orientable unit clauses : 7
% 0.17/1.37 # Positive unorientable unit clauses: 0
% 0.17/1.37 # Negative unit clauses : 2
% 0.17/1.37 # Non-unit-clauses : 20
% 0.17/1.37 # Current number of unprocessed clauses: 58
% 0.17/1.37 # ...number of literals in the above : 284
% 0.17/1.37 # Current number of archived formulas : 0
% 0.17/1.37 # Current number of archived clauses : 35
% 0.17/1.37 # Clause-clause subsumption calls (NU) : 243
% 0.17/1.37 # Rec. Clause-clause subsumption calls : 93
% 0.17/1.37 # Non-unit clause-clause subsumptions : 12
% 0.17/1.37 # Unit Clause-clause subsumption calls : 20
% 0.17/1.37 # Rewrite failures with RHS unbound : 0
% 0.17/1.37 # BW rewrite match attempts : 1
% 0.17/1.37 # BW rewrite match successes : 1
% 0.17/1.37 # Condensation attempts : 0
% 0.17/1.37 # Condensation successes : 0
% 0.17/1.37 # Termbank termtop insertions : 7009
% 0.17/1.37
% 0.17/1.37 # -------------------------------------------------
% 0.17/1.37 # User time : 0.025 s
% 0.17/1.37 # System time : 0.002 s
% 0.17/1.37 # Total time : 0.028 s
% 0.17/1.37 # Maximum resident set size: 3176 pages
%------------------------------------------------------------------------------