TSTP Solution File: SWC328+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC328+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n015.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:04 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 10 unt; 0 def)
% Number of atoms : 49 ( 12 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 47 ( 17 ~; 12 |; 9 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 12 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X3
| X2 != X4
| X1 != X3
| ( segmentP(X2,X1)
& equalelemsP(X1) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax74,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax74) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X3
| X2 != X4
| X1 != X3
| ( segmentP(X2,X1)
& equalelemsP(X1) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_4,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
& ( ~ segmentP(esk2_0,esk1_0)
| ~ equalelemsP(esk1_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)],[c_0_3])])])])]) ).
cnf(c_0_5,negated_conjecture,
( ~ equalelemsP(esk1_0)
| ~ segmentP(esk2_0,esk1_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,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
equalelemsP(nil),
inference(split_conjunct,[status(thm)],[ax74]) ).
cnf(c_0_9,negated_conjecture,
nil = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_10,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).
cnf(c_0_11,negated_conjecture,
( ~ equalelemsP(esk3_0)
| ~ segmentP(esk4_0,esk3_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_7]),c_0_6]) ).
cnf(c_0_12,plain,
equalelemsP(esk3_0),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,negated_conjecture,
~ segmentP(esk4_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).
cnf(c_0_16,plain,
( segmentP(X1,esk3_0)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_14,c_0_7]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC328+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n015.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 12 09:42:06 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.019 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 19
% 0.22/1.41 # Proof object clause steps : 13
% 0.22/1.41 # Proof object formula steps : 6
% 0.22/1.41 # Proof object conjectures : 12
% 0.22/1.41 # Proof object clause conjectures : 9
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 7
% 0.22/1.41 # Proof object initial formulas used : 3
% 0.22/1.41 # Proof object generating inferences : 1
% 0.22/1.41 # Proof object simplifying inferences : 10
% 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 : 69
% 0.22/1.41 # Initial clauses : 51
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 51
% 0.22/1.41 # Processed clauses : 53
% 0.22/1.41 # ...of these trivial : 3
% 0.22/1.41 # ...subsumed : 0
% 0.22/1.41 # ...remaining for further processing : 50
% 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 : 0
% 0.22/1.41 # Backward-rewritten : 1
% 0.22/1.41 # Generated clauses : 147
% 0.22/1.41 # ...of the previous two non-trivial : 121
% 0.22/1.41 # Contextual simplify-reflections : 0
% 0.22/1.41 # Paramodulations : 138
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 9
% 0.22/1.41 # Current number of processed clauses : 49
% 0.22/1.41 # Positive orientable unit clauses : 8
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 2
% 0.22/1.41 # Non-unit-clauses : 39
% 0.22/1.41 # Current number of unprocessed clauses: 119
% 0.22/1.41 # ...number of literals in the above : 749
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 1
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 228
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 66
% 0.22/1.41 # Non-unit clause-clause subsumptions : 0
% 0.22/1.41 # Unit Clause-clause subsumption calls : 2
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 1
% 0.22/1.41 # BW rewrite match successes : 1
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 6843
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.022 s
% 0.22/1.41 # System time : 0.003 s
% 0.22/1.41 # Total time : 0.025 s
% 0.22/1.41 # Maximum resident set size: 3188 pages
%------------------------------------------------------------------------------