TSTP Solution File: SWC257+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC257+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:27:39 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 6 unt; 0 def)
% Number of atoms : 81 ( 34 equ)
% Maximal formula atoms : 29 ( 5 avg)
% Number of connectives : 94 ( 29 ~; 36 |; 22 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 13 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| totalorderedP(X1)
| ( ! [X5] :
( ~ ssItem(X5)
| cons(X5,nil) != X3
| ~ memberP(X4,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X5,X6) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax65,axiom,
! [X1] :
( ssItem(X1)
=> totalorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax65) ).
fof(ax66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax66) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| totalorderedP(X1)
| ( ! [X5] :
( ~ ssItem(X5)
| cons(X5,nil) != X3
| ~ memberP(X4,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X5,X6) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_4,negated_conjecture,
! [X12] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ~ totalorderedP(esk1_0)
& ( nil = esk4_0
| ssItem(esk5_0) )
& ( nil = esk3_0
| ssItem(esk5_0) )
& ( nil = esk4_0
| cons(esk5_0,nil) = esk3_0 )
& ( nil = esk3_0
| cons(esk5_0,nil) = esk3_0 )
& ( nil = esk4_0
| memberP(esk4_0,esk5_0) )
& ( nil = esk3_0
| memberP(esk4_0,esk5_0) )
& ( nil = esk4_0
| ~ ssItem(X12)
| esk5_0 = X12
| ~ memberP(esk4_0,X12)
| ~ leq(esk5_0,X12) )
& ( nil = esk3_0
| ~ ssItem(X12)
| esk5_0 = X12
| ~ memberP(esk4_0,X12)
| ~ leq(esk5_0,X12) ) ),
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_3])])])])])])])]) ).
fof(c_0_5,plain,
! [X2] :
( ~ ssItem(X2)
| totalorderedP(cons(X2,nil)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax65])]) ).
cnf(c_0_6,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( ssItem(esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( cons(esk5_0,nil) = esk1_0
| nil = esk1_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_7]) ).
cnf(c_0_11,negated_conjecture,
~ totalorderedP(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,negated_conjecture,
( nil = esk1_0
| ssItem(esk5_0) ),
inference(rw,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_13,plain,
totalorderedP(nil),
inference(split_conjunct,[status(thm)],[ax66]) ).
cnf(c_0_14,negated_conjecture,
nil = esk1_0,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]) ).
cnf(c_0_15,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC257+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n006.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 08:44:57 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 : 16
% 0.24/1.41 # Proof object clause steps : 10
% 0.24/1.41 # Proof object formula steps : 6
% 0.24/1.41 # Proof object conjectures : 10
% 0.24/1.41 # Proof object clause conjectures : 7
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 6
% 0.24/1.41 # Proof object initial formulas used : 3
% 0.24/1.41 # Proof object generating inferences : 1
% 0.24/1.41 # Proof object simplifying inferences : 7
% 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 : 52
% 0.24/1.41 # Initial clauses : 87
% 0.24/1.41 # Removed in clause preprocessing : 1
% 0.24/1.41 # Initial clauses in saturation : 86
% 0.24/1.41 # Processed clauses : 87
% 0.24/1.41 # ...of these trivial : 2
% 0.24/1.41 # ...subsumed : 1
% 0.24/1.41 # ...remaining for further processing : 84
% 0.24/1.41 # Other redundant clauses eliminated : 5
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 0
% 0.24/1.41 # Backward-rewritten : 35
% 0.24/1.41 # Generated clauses : 242
% 0.24/1.41 # ...of the previous two non-trivial : 226
% 0.24/1.41 # Contextual simplify-reflections : 2
% 0.24/1.41 # Paramodulations : 230
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 12
% 0.24/1.41 # Current number of processed clauses : 47
% 0.24/1.41 # Positive orientable unit clauses : 7
% 0.24/1.41 # Positive unorientable unit clauses: 0
% 0.24/1.41 # Negative unit clauses : 2
% 0.24/1.41 # Non-unit-clauses : 38
% 0.24/1.41 # Current number of unprocessed clauses: 80
% 0.24/1.41 # ...number of literals in the above : 467
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 35
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 927
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 149
% 0.24/1.41 # Non-unit clause-clause subsumptions : 3
% 0.24/1.41 # Unit Clause-clause subsumption calls : 1
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 1
% 0.24/1.41 # BW rewrite match successes : 1
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 11018
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.033 s
% 0.24/1.41 # System time : 0.004 s
% 0.24/1.41 # Total time : 0.037 s
% 0.24/1.41 # Maximum resident set size: 3488 pages
%------------------------------------------------------------------------------