TSTP Solution File: SWC098+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC098+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n010.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:26:40 EDT 2022
% Result : Theorem 0.25s 1.42s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 35 ( 10 unt; 0 def)
% Number of atoms : 167 ( 77 equ)
% Maximal formula atoms : 46 ( 4 avg)
% Number of connectives : 204 ( 72 ~; 84 |; 34 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn 18 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& cons(X5,nil) = X1
& ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X2,X6)
| ~ leq(X5,X6)
| X5 = X6 ) )
& memberP(X2,X5) )
| ( nil = X2
& nil = X1 )
| ( ! [X7] :
( ssItem(X7)
=> ( cons(X7,nil) != X3
| ~ memberP(X4,X7)
| ? [X8] :
( ssItem(X8)
& X7 != X8
& memberP(X4,X8)
& leq(X7,X8) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& cons(X5,nil) = X1
& ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X2,X6)
| ~ leq(X5,X6)
| X5 = X6 ) )
& memberP(X2,X5) )
| ( nil = X2
& nil = X1 )
| ( ! [X7] :
( ssItem(X7)
=> ( cons(X7,nil) != X3
| ~ memberP(X4,X7)
| ? [X8] :
( ssItem(X8)
& X7 != X8
& memberP(X4,X8)
& leq(X7,X8) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_4,negated_conjecture,
! [X13,X16] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( ssItem(esk5_1(X13))
| ~ ssItem(X13)
| cons(X13,nil) != esk1_0
| ~ memberP(esk2_0,X13) )
& ( memberP(esk2_0,esk5_1(X13))
| ~ ssItem(X13)
| cons(X13,nil) != esk1_0
| ~ memberP(esk2_0,X13) )
& ( leq(X13,esk5_1(X13))
| ~ ssItem(X13)
| cons(X13,nil) != esk1_0
| ~ memberP(esk2_0,X13) )
& ( X13 != esk5_1(X13)
| ~ ssItem(X13)
| cons(X13,nil) != esk1_0
| ~ memberP(esk2_0,X13) )
& ( nil != esk2_0
| nil != esk1_0 )
& ( nil = esk4_0
| ssItem(esk6_0) )
& ( nil = esk3_0
| ssItem(esk6_0) )
& ( nil = esk4_0
| cons(esk6_0,nil) = esk3_0 )
& ( nil = esk3_0
| cons(esk6_0,nil) = esk3_0 )
& ( nil = esk4_0
| memberP(esk4_0,esk6_0) )
& ( nil = esk3_0
| memberP(esk4_0,esk6_0) )
& ( nil = esk4_0
| ~ ssItem(X16)
| esk6_0 = X16
| ~ memberP(esk4_0,X16)
| ~ leq(esk6_0,X16) )
& ( nil = esk3_0
| ~ ssItem(X16)
| esk6_0 = X16
| ~ memberP(esk4_0,X16)
| ~ leq(esk6_0,X16) ) ),
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,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| nil != cons(X4,X3) ),
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)],[ax21])])])])]) ).
cnf(c_0_6,negated_conjecture,
( cons(esk6_0,nil) = esk3_0
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
( ssItem(esk6_0)
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
( esk6_0 = X1
| nil = esk3_0
| ~ leq(esk6_0,X1)
| ~ memberP(esk4_0,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
( ssItem(esk6_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,negated_conjecture,
( memberP(esk4_0,esk6_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
( cons(esk6_0,nil) = esk3_0
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,plain,
( nil != cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
( cons(esk6_0,nil) = esk1_0
| nil = esk2_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_16,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_17,negated_conjecture,
( nil = esk2_0
| ssItem(esk6_0) ),
inference(rw,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_18,negated_conjecture,
( nil != esk1_0
| nil != esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_19,negated_conjecture,
( nil = esk1_0
| esk6_0 = X1
| ~ leq(esk6_0,X1)
| ~ memberP(esk2_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_8]),c_0_7]) ).
cnf(c_0_20,negated_conjecture,
( leq(X1,esk5_1(X1))
| ~ memberP(esk2_0,X1)
| cons(X1,nil) != esk1_0
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_21,negated_conjecture,
( nil = esk1_0
| ssItem(esk6_0) ),
inference(rw,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_22,negated_conjecture,
( nil = esk1_0
| memberP(esk2_0,esk6_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_8]),c_0_7]) ).
cnf(c_0_23,negated_conjecture,
( cons(esk6_0,nil) = esk1_0
| nil = esk1_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_8]),c_0_8]) ).
cnf(c_0_24,negated_conjecture,
nil != esk1_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),c_0_17]),c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( esk5_1(esk6_0) = esk6_0
| nil = esk1_0
| ~ memberP(esk2_0,esk5_1(esk6_0))
| ~ ssItem(esk5_1(esk6_0)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]),c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( memberP(esk2_0,esk5_1(X1))
| ~ memberP(esk2_0,X1)
| cons(X1,nil) != esk1_0
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_27,negated_conjecture,
cons(esk6_0,nil) = esk1_0,
inference(sr,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
memberP(esk2_0,esk6_0),
inference(sr,[status(thm)],[c_0_22,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
ssItem(esk6_0),
inference(sr,[status(thm)],[c_0_21,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( esk5_1(esk6_0) = esk6_0
| ~ ssItem(esk5_1(esk6_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28]),c_0_29])]),c_0_24]) ).
cnf(c_0_31,negated_conjecture,
( ssItem(esk5_1(X1))
| ~ memberP(esk2_0,X1)
| cons(X1,nil) != esk1_0
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_32,negated_conjecture,
( ~ memberP(esk2_0,X1)
| cons(X1,nil) != esk1_0
| ~ ssItem(X1)
| X1 != esk5_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_33,negated_conjecture,
esk5_1(esk6_0) = esk6_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_27]),c_0_28]),c_0_29])]) ).
cnf(c_0_34,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_32,c_0_33]),c_0_27]),c_0_28]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC098+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n010.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 : Sun Jun 12 10:57:40 EDT 2022
% 0.13/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.022 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 : 35
% 0.25/1.42 # Proof object clause steps : 29
% 0.25/1.42 # Proof object formula steps : 6
% 0.25/1.42 # Proof object conjectures : 30
% 0.25/1.42 # Proof object clause conjectures : 27
% 0.25/1.42 # Proof object formula conjectures : 3
% 0.25/1.42 # Proof object initial clauses used : 15
% 0.25/1.42 # Proof object initial formulas used : 3
% 0.25/1.42 # Proof object generating inferences : 5
% 0.25/1.42 # Proof object simplifying inferences : 33
% 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 : 66
% 0.25/1.42 # Initial clauses : 64
% 0.25/1.42 # Removed in clause preprocessing : 0
% 0.25/1.42 # Initial clauses in saturation : 64
% 0.25/1.42 # Processed clauses : 78
% 0.25/1.42 # ...of these trivial : 2
% 0.25/1.42 # ...subsumed : 3
% 0.25/1.42 # ...remaining for further processing : 73
% 0.25/1.42 # Other redundant clauses eliminated : 3
% 0.25/1.42 # Clauses deleted for lack of memory : 0
% 0.25/1.42 # Backward-subsumed : 5
% 0.25/1.42 # Backward-rewritten : 1
% 0.25/1.42 # Generated clauses : 186
% 0.25/1.42 # ...of the previous two non-trivial : 147
% 0.25/1.42 # Contextual simplify-reflections : 11
% 0.25/1.42 # Paramodulations : 175
% 0.25/1.42 # Factorizations : 0
% 0.25/1.42 # Equation resolutions : 8
% 0.25/1.42 # Current number of processed clauses : 62
% 0.25/1.42 # Positive orientable unit clauses : 11
% 0.25/1.42 # Positive unorientable unit clauses: 0
% 0.25/1.42 # Negative unit clauses : 2
% 0.25/1.42 # Non-unit-clauses : 49
% 0.25/1.42 # Current number of unprocessed clauses: 113
% 0.25/1.42 # ...number of literals in the above : 658
% 0.25/1.42 # Current number of archived formulas : 0
% 0.25/1.42 # Current number of archived clauses : 9
% 0.25/1.42 # Clause-clause subsumption calls (NU) : 539
% 0.25/1.42 # Rec. Clause-clause subsumption calls : 123
% 0.25/1.42 # Non-unit clause-clause subsumptions : 14
% 0.25/1.42 # Unit Clause-clause subsumption calls : 78
% 0.25/1.42 # Rewrite failures with RHS unbound : 0
% 0.25/1.42 # BW rewrite match attempts : 4
% 0.25/1.42 # BW rewrite match successes : 4
% 0.25/1.42 # Condensation attempts : 0
% 0.25/1.42 # Condensation successes : 0
% 0.25/1.42 # Termbank termtop insertions : 8247
% 0.25/1.42
% 0.25/1.42 # -------------------------------------------------
% 0.25/1.42 # User time : 0.031 s
% 0.25/1.42 # System time : 0.004 s
% 0.25/1.42 # Total time : 0.035 s
% 0.25/1.42 # Maximum resident set size: 3188 pages
%------------------------------------------------------------------------------