TSTP Solution File: SWC241+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC241+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n005.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:27:33 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 21 ( 7 unt; 0 def)
% Number of atoms : 154 ( 41 equ)
% Maximal formula atoms : 46 ( 7 avg)
% Number of connectives : 214 ( 81 ~; 83 |; 37 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 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; 8 con; 0-3 aty)
% Number of variables : 46 ( 0 sgn 24 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ lt(X5,X8)
| leq(X5,X8) ) ) ) )
| ( nil != X3
& ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ~ ssList(X11)
| app(app(X10,cons(X9,nil)),X11) != X3
| ? [X12] :
( ssItem(X12)
& ~ leq(X12,X9)
& memberP(X10,X12)
& memberP(X11,X12)
& leq(X9,X12) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax93,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( X1 != X2
& leq(X1,X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax93) ).
fof(c_0_2,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ lt(X5,X8)
| leq(X5,X8) ) ) ) )
| ( nil != X3
& ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ~ ssList(X11)
| app(app(X10,cons(X9,nil)),X11) != X3
| ? [X12] :
( ssItem(X12)
& ~ leq(X12,X9)
& memberP(X10,X12)
& memberP(X11,X12)
& leq(X9,X12) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_3,plain,
! [X3,X4] :
( ( X3 != X4
| ~ lt(X3,X4)
| ~ ssItem(X4)
| ~ ssItem(X3) )
& ( leq(X3,X4)
| ~ lt(X3,X4)
| ~ ssItem(X4)
| ~ ssItem(X3) )
& ( X3 = X4
| ~ leq(X3,X4)
| lt(X3,X4)
| ~ ssItem(X4)
| ~ ssItem(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax93])])])])])]) ).
fof(c_0_4,negated_conjecture,
! [X17,X18,X19,X24] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& nil != esk1_0
& ( ssItem(esk5_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( memberP(X18,esk5_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( memberP(X19,esk5_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( lt(X17,esk5_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( ~ leq(X17,esk5_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( ssItem(esk6_0)
| nil = esk3_0 )
& ( ssList(esk7_0)
| nil = esk3_0 )
& ( ssList(esk8_0)
| nil = esk3_0 )
& ( app(app(esk7_0,cons(esk6_0,nil)),esk8_0) = esk3_0
| nil = esk3_0 )
& ( ~ ssItem(X24)
| leq(X24,esk6_0)
| ~ memberP(esk7_0,X24)
| ~ memberP(esk8_0,X24)
| ~ leq(esk6_0,X24)
| nil = esk3_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_2])])])])])])])]) ).
cnf(c_0_5,plain,
( leq(X1,X2)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( lt(X1,esk5_3(X1,X2,X3))
| ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk1_0
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( ssItem(esk5_3(X1,X2,X3))
| ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk1_0
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk1_0
| ~ ssList(X3)
| ~ leq(X1,esk5_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
( nil = esk3_0
| app(app(esk7_0,cons(esk6_0,nil)),esk8_0) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
nil != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,negated_conjecture,
( nil = esk3_0
| ssList(esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
( nil = esk3_0
| ssList(esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,negated_conjecture,
( nil = esk3_0
| ssItem(esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk1_0
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]),c_0_8]) ).
cnf(c_0_16,negated_conjecture,
app(app(esk7_0,cons(esk6_0,nil)),esk8_0) = esk1_0,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]),c_0_11]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk8_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_10]),c_0_11]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk7_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_10]),c_0_11]) ).
cnf(c_0_19,negated_conjecture,
ssItem(esk6_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_10]),c_0_11]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC241+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n005.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 : Mon Jun 13 00:50:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.022 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 21
% 0.24/1.42 # Proof object clause steps : 16
% 0.24/1.42 # Proof object formula steps : 5
% 0.24/1.42 # Proof object conjectures : 18
% 0.24/1.42 # Proof object clause conjectures : 15
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 10
% 0.24/1.42 # Proof object initial formulas used : 2
% 0.24/1.42 # Proof object generating inferences : 2
% 0.24/1.42 # Proof object simplifying inferences : 15
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 96
% 0.24/1.42 # Removed by relevancy pruning/SinE : 66
% 0.24/1.42 # Initial clauses : 62
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 62
% 0.24/1.42 # Processed clauses : 63
% 0.24/1.42 # ...of these trivial : 2
% 0.24/1.42 # ...subsumed : 1
% 0.24/1.42 # ...remaining for further processing : 60
% 0.24/1.42 # Other redundant clauses eliminated : 3
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 5
% 0.24/1.42 # Backward-rewritten : 0
% 0.24/1.42 # Generated clauses : 161
% 0.24/1.42 # ...of the previous two non-trivial : 130
% 0.24/1.42 # Contextual simplify-reflections : 2
% 0.24/1.42 # Paramodulations : 153
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 8
% 0.24/1.42 # Current number of processed clauses : 53
% 0.24/1.42 # Positive orientable unit clauses : 11
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 2
% 0.24/1.42 # Non-unit-clauses : 40
% 0.24/1.42 # Current number of unprocessed clauses: 121
% 0.24/1.42 # ...number of literals in the above : 693
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 5
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 526
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 78
% 0.24/1.42 # Non-unit clause-clause subsumptions : 8
% 0.24/1.42 # Unit Clause-clause subsumption calls : 1
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 0
% 0.24/1.42 # BW rewrite match successes : 0
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 8250
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.030 s
% 0.24/1.42 # System time : 0.006 s
% 0.24/1.42 # Total time : 0.036 s
% 0.24/1.42 # Maximum resident set size: 3212 pages
%------------------------------------------------------------------------------