TSTP Solution File: SWC339+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC339+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:28:08 EDT 2022
% Result : Theorem 0.25s 1.42s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 12 unt; 0 def)
% Number of atoms : 131 ( 36 equ)
% Maximal formula atoms : 28 ( 6 avg)
% Number of connectives : 163 ( 52 ~; 50 |; 46 &)
% ( 1 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn 26 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X5,X3),X6) != X4
| ~ totalorderedP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X5
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X3
& leq(X7,X9) ) ) ) )
| ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(cons(X11,nil),X12) = X6
& ? [X13] :
( ssItem(X13)
& ? [X14] :
( ssList(X14)
& app(X14,cons(X13,nil)) = X3
& leq(X13,X11) ) ) ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( segmentP(X2,X1)
& totalorderedP(X1) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
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(c_0_2,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X5,X3),X6) != X4
| ~ totalorderedP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X5
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X3
& leq(X7,X9) ) ) ) )
| ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(cons(X11,nil),X12) = X6
& ? [X13] :
( ssItem(X13)
& ? [X14] :
( ssList(X14)
& app(X14,cons(X13,nil)) = X3
& leq(X13,X11) ) ) ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( segmentP(X2,X1)
& totalorderedP(X1) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_3,negated_conjecture,
! [X21,X22,X23,X24,X25,X26,X27,X28] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ssList(esk5_0)
& ssList(esk6_0)
& app(app(esk5_0,esk3_0),esk6_0) = esk4_0
& totalorderedP(esk3_0)
& ( ~ ssItem(X21)
| ~ ssList(X22)
| app(X22,cons(X21,nil)) != esk5_0
| ~ ssItem(X23)
| ~ ssList(X24)
| app(cons(X23,nil),X24) != esk3_0
| ~ leq(X21,X23) )
& ( ~ ssItem(X25)
| ~ ssList(X26)
| app(cons(X25,nil),X26) != esk6_0
| ~ ssItem(X27)
| ~ ssList(X28)
| app(X28,cons(X27,nil)) != esk3_0
| ~ leq(X27,X25) )
& ( nil = esk4_0
| nil != esk3_0 )
& ( ~ segmentP(esk2_0,esk1_0)
| ~ totalorderedP(esk1_0) ) ),
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_2])])])])])])]) ).
cnf(c_0_4,negated_conjecture,
totalorderedP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_6,plain,
! [X5,X6,X9,X10] :
( ( ssList(esk12_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk13_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( app(app(esk12_2(X5,X6),X6),esk13_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])])])])])])]) ).
cnf(c_0_7,negated_conjecture,
app(app(esk5_0,esk3_0),esk6_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
( ~ totalorderedP(esk1_0)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,negated_conjecture,
totalorderedP(esk1_0),
inference(rw,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_11,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_6]) ).
cnf(c_0_12,negated_conjecture,
app(app(esk5_0,esk1_0),esk6_0) = esk2_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_5]),c_0_8]) ).
cnf(c_0_13,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_15,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_16,negated_conjecture,
~ segmentP(esk2_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
cnf(c_0_17,negated_conjecture,
( segmentP(X1,esk1_0)
| esk2_0 != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14]),c_0_15])]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC339+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n006.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jun 12 04:57:42 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.25/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.42 # Preprocessing time : 0.024 s
% 0.25/1.42
% 0.25/1.42 # Proof found!
% 0.25/1.42 # SZS status Theorem
% 0.25/1.42 # SZS output start CNFRefutation
% See solution above
% 0.25/1.42 # Proof object total steps : 20
% 0.25/1.42 # Proof object clause steps : 15
% 0.25/1.42 # Proof object formula steps : 5
% 0.25/1.42 # Proof object conjectures : 17
% 0.25/1.42 # Proof object clause conjectures : 14
% 0.25/1.42 # Proof object formula conjectures : 3
% 0.25/1.42 # Proof object initial clauses used : 10
% 0.25/1.42 # Proof object initial formulas used : 2
% 0.25/1.42 # Proof object generating inferences : 2
% 0.25/1.42 # Proof object simplifying inferences : 11
% 0.25/1.42 # Training examples: 0 positive, 0 negative
% 0.25/1.42 # Parsed axioms : 96
% 0.25/1.42 # Removed by relevancy pruning/SinE : 49
% 0.25/1.42 # Initial clauses : 86
% 0.25/1.42 # Removed in clause preprocessing : 1
% 0.25/1.42 # Initial clauses in saturation : 85
% 0.25/1.42 # Processed clauses : 102
% 0.25/1.42 # ...of these trivial : 2
% 0.25/1.42 # ...subsumed : 4
% 0.25/1.42 # ...remaining for further processing : 96
% 0.25/1.42 # Other redundant clauses eliminated : 4
% 0.25/1.42 # Clauses deleted for lack of memory : 0
% 0.25/1.42 # Backward-subsumed : 1
% 0.25/1.42 # Backward-rewritten : 1
% 0.25/1.42 # Generated clauses : 300
% 0.25/1.42 # ...of the previous two non-trivial : 256
% 0.25/1.42 # Contextual simplify-reflections : 7
% 0.25/1.42 # Paramodulations : 289
% 0.25/1.42 # Factorizations : 0
% 0.25/1.42 # Equation resolutions : 11
% 0.25/1.42 # Current number of processed clauses : 93
% 0.25/1.42 # Positive orientable unit clauses : 13
% 0.25/1.42 # Positive unorientable unit clauses: 0
% 0.25/1.42 # Negative unit clauses : 2
% 0.25/1.42 # Non-unit-clauses : 78
% 0.25/1.42 # Current number of unprocessed clauses: 239
% 0.25/1.42 # ...number of literals in the above : 1461
% 0.25/1.42 # Current number of archived formulas : 0
% 0.25/1.42 # Current number of archived clauses : 2
% 0.25/1.42 # Clause-clause subsumption calls (NU) : 989
% 0.25/1.42 # Rec. Clause-clause subsumption calls : 274
% 0.25/1.42 # Non-unit clause-clause subsumptions : 12
% 0.25/1.42 # Unit Clause-clause subsumption calls : 2
% 0.25/1.42 # Rewrite failures with RHS unbound : 0
% 0.25/1.42 # BW rewrite match attempts : 1
% 0.25/1.42 # BW rewrite match successes : 1
% 0.25/1.42 # Condensation attempts : 0
% 0.25/1.42 # Condensation successes : 0
% 0.25/1.42 # Termbank termtop insertions : 12442
% 0.25/1.42
% 0.25/1.42 # -------------------------------------------------
% 0.25/1.42 # User time : 0.039 s
% 0.25/1.42 # System time : 0.003 s
% 0.25/1.42 # Total time : 0.042 s
% 0.25/1.42 # Maximum resident set size: 3508 pages
%------------------------------------------------------------------------------