TSTP Solution File: SWC333+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC333+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:06 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 10 unt; 0 def)
% Number of atoms : 98 ( 8 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 126 ( 47 ~; 44 |; 25 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 14 ( 0 sgn 11 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ totalorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& segmentP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| ( ! [X6] :
( ssList(X6)
=> ( ~ neq(X1,X6)
| ~ segmentP(X2,X6)
| ~ segmentP(X6,X1)
| ~ totalorderedP(X6) ) )
& segmentP(X2,X1)
& totalorderedP(X1) ) ) ) ) ) ),
file('/export/starexec/sandbox2/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
| ~ segmentP(X4,X3)
| ~ totalorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& segmentP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| ( ! [X6] :
( ssList(X6)
=> ( ~ neq(X1,X6)
| ~ segmentP(X2,X6)
| ~ segmentP(X6,X1)
| ~ totalorderedP(X6) ) )
& segmentP(X2,X1)
& totalorderedP(X1) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_2,negated_conjecture,
! [X11] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& segmentP(esk4_0,esk3_0)
& totalorderedP(esk3_0)
& ( ~ ssList(X11)
| ~ neq(esk3_0,X11)
| ~ segmentP(esk4_0,X11)
| ~ segmentP(X11,esk3_0)
| ~ totalorderedP(X11) )
& ( ssList(esk5_0)
| ~ segmentP(esk2_0,esk1_0)
| ~ totalorderedP(esk1_0) )
& ( neq(esk1_0,esk5_0)
| ~ segmentP(esk2_0,esk1_0)
| ~ totalorderedP(esk1_0) )
& ( segmentP(esk2_0,esk5_0)
| ~ segmentP(esk2_0,esk1_0)
| ~ totalorderedP(esk1_0) )
& ( segmentP(esk5_0,esk1_0)
| ~ segmentP(esk2_0,esk1_0)
| ~ totalorderedP(esk1_0) )
& ( totalorderedP(esk5_0)
| ~ segmentP(esk2_0,esk1_0)
| ~ totalorderedP(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(esk1_0,esk5_0)
| ~ totalorderedP(esk1_0)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
totalorderedP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
segmentP(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
( totalorderedP(esk5_0)
| ~ totalorderedP(esk1_0)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
( segmentP(esk5_0,esk1_0)
| ~ totalorderedP(esk1_0)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( segmentP(esk2_0,esk5_0)
| ~ totalorderedP(esk1_0)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( ssList(esk5_0)
| ~ totalorderedP(esk1_0)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
( ~ totalorderedP(X1)
| ~ segmentP(X1,esk3_0)
| ~ segmentP(esk4_0,X1)
| ~ neq(esk3_0,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
neq(esk3_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4]),c_0_4]),c_0_5]),c_0_6]),c_0_4]),c_0_7])]) ).
cnf(c_0_14,negated_conjecture,
totalorderedP(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_4]),c_0_5]),c_0_6]),c_0_4]),c_0_7])]) ).
cnf(c_0_15,negated_conjecture,
segmentP(esk5_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_4]),c_0_4]),c_0_5]),c_0_6]),c_0_4]),c_0_7])]) ).
cnf(c_0_16,negated_conjecture,
segmentP(esk4_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_6]),c_0_4]),c_0_5]),c_0_6]),c_0_4]),c_0_7])]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_4]),c_0_5]),c_0_6]),c_0_4]),c_0_7])]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC333+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 11 23:09:21 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41 # Preprocessing time : 0.022 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.41 # Proof object total steps : 19
% 0.24/1.41 # Proof object clause steps : 16
% 0.24/1.41 # Proof object formula steps : 3
% 0.24/1.41 # Proof object conjectures : 19
% 0.24/1.41 # Proof object clause conjectures : 16
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 10
% 0.24/1.41 # Proof object initial formulas used : 1
% 0.24/1.41 # Proof object generating inferences : 1
% 0.24/1.41 # Proof object simplifying inferences : 38
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 96
% 0.24/1.41 # Removed by relevancy pruning/SinE : 47
% 0.24/1.41 # Initial clauses : 90
% 0.24/1.41 # Removed in clause preprocessing : 1
% 0.24/1.41 # Initial clauses in saturation : 89
% 0.24/1.41 # Processed clauses : 23
% 0.24/1.41 # ...of these trivial : 2
% 0.24/1.41 # ...subsumed : 0
% 0.24/1.41 # ...remaining for further processing : 21
% 0.24/1.41 # Other redundant clauses eliminated : 0
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 0
% 0.24/1.41 # Backward-rewritten : 0
% 0.24/1.41 # Generated clauses : 1
% 0.24/1.41 # ...of the previous two non-trivial : 0
% 0.24/1.41 # Contextual simplify-reflections : 0
% 0.24/1.41 # Paramodulations : 1
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 0
% 0.24/1.41 # Current number of processed clauses : 21
% 0.24/1.41 # Positive orientable unit clauses : 15
% 0.24/1.41 # Positive unorientable unit clauses: 0
% 0.24/1.41 # Negative unit clauses : 1
% 0.24/1.41 # Non-unit-clauses : 5
% 0.24/1.41 # Current number of unprocessed clauses: 66
% 0.24/1.41 # ...number of literals in the above : 265
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 0
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 3
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 1
% 0.24/1.41 # Non-unit clause-clause subsumptions : 0
% 0.24/1.41 # Unit Clause-clause subsumption calls : 0
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 0
% 0.24/1.41 # BW rewrite match successes : 0
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 6933
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.021 s
% 0.24/1.41 # System time : 0.002 s
% 0.24/1.41 # Total time : 0.023 s
% 0.24/1.41 # Maximum resident set size: 3256 pages
%------------------------------------------------------------------------------