TSTP Solution File: SWC373+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC373+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n009.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:21 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 12 unt; 0 def)
% Number of atoms : 109 ( 20 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 138 ( 56 ~; 52 |; 15 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 21 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
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(ax6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( rearsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax6) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ rearsegP(X4,X3)
| segmentP(X2,X1) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
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(c_0_5,plain,
! [X5,X6,X9,X10] :
( ( ssList(esk5_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk6_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( app(app(esk5_2(X5,X6),X6),esk6_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_6,plain,
! [X4,X5,X7] :
( ( ssList(esk7_2(X4,X5))
| ~ rearsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( app(esk7_2(X4,X5),X5) = X4
| ~ rearsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( ~ ssList(X7)
| app(X7,X5) != X4
| rearsegP(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)],[ax6])])])])])])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ rearsegP(X4,X3)
| segmentP(X2,X1) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
cnf(c_0_8,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_5]) ).
cnf(c_0_9,plain,
( app(esk7_2(X1,X2),X2) = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ssList(esk7_2(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
fof(c_0_12,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& rearsegP(esk4_0,esk3_0)
& ~ segmentP(esk2_0,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)],[inference(fof_simplification,[status(thm)],[c_0_7])])])])])]) ).
cnf(c_0_13,plain,
( segmentP(X1,X2)
| app(X3,X4) != X1
| ~ rearsegP(X3,X2)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_14,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_16,negated_conjecture,
rearsegP(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
~ segmentP(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
( segmentP(X1,X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])])]) ).
cnf(c_0_22,negated_conjecture,
rearsegP(esk4_0,esk1_0),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_24,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
~ segmentP(esk4_0,esk1_0),
inference(rw,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC373+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n009.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 19:43:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.019 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 27
% 0.23/1.42 # Proof object clause steps : 17
% 0.23/1.42 # Proof object formula steps : 10
% 0.23/1.42 # Proof object conjectures : 13
% 0.23/1.42 # Proof object clause conjectures : 10
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 11
% 0.23/1.42 # Proof object initial formulas used : 5
% 0.23/1.42 # Proof object generating inferences : 3
% 0.23/1.42 # Proof object simplifying inferences : 11
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 96
% 0.23/1.42 # Removed by relevancy pruning/SinE : 65
% 0.23/1.42 # Initial clauses : 52
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 52
% 0.23/1.42 # Processed clauses : 1674
% 0.23/1.42 # ...of these trivial : 38
% 0.23/1.42 # ...subsumed : 1311
% 0.23/1.42 # ...remaining for further processing : 325
% 0.23/1.42 # Other redundant clauses eliminated : 59
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 25
% 0.23/1.42 # Backward-rewritten : 1
% 0.23/1.42 # Generated clauses : 6694
% 0.23/1.42 # ...of the previous two non-trivial : 5768
% 0.23/1.42 # Contextual simplify-reflections : 458
% 0.23/1.42 # Paramodulations : 6606
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 88
% 0.23/1.42 # Current number of processed clauses : 299
% 0.23/1.42 # Positive orientable unit clauses : 13
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 25
% 0.23/1.42 # Non-unit-clauses : 261
% 0.23/1.42 # Current number of unprocessed clauses: 4044
% 0.23/1.42 # ...number of literals in the above : 24104
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 26
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 26270
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 19600
% 0.23/1.42 # Non-unit clause-clause subsumptions : 1172
% 0.23/1.42 # Unit Clause-clause subsumption calls : 403
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 3
% 0.23/1.42 # BW rewrite match successes : 3
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 102103
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.176 s
% 0.23/1.42 # System time : 0.005 s
% 0.23/1.42 # Total time : 0.181 s
% 0.23/1.42 # Maximum resident set size: 6864 pages
%------------------------------------------------------------------------------