TSTP Solution File: SWC379+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC379+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n016.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:23 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 40 ( 7 unt; 0 def)
% Number of atoms : 224 ( 32 equ)
% Maximal formula atoms : 51 ( 5 avg)
% Number of connectives : 303 ( 119 ~; 126 |; 44 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 39 ( 0 sgn 17 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ( ( ~ memberP(X3,X5)
& ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X4,X6)
| ~ leq(X6,X5)
| X5 = X6 ) )
& memberP(X4,X5) )
| ( memberP(X3,X5)
& ( ~ memberP(X4,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X6,X5) ) ) ) ) )
| ! [X7] :
( ssItem(X7)
=> ( ( ~ memberP(X1,X7)
& ( ~ memberP(X2,X7)
| ? [X8] :
( ssItem(X8)
& X7 != X8
& memberP(X2,X8)
& leq(X8,X7) ) ) )
| ( ! [X8] :
( ssItem(X8)
=> ( ~ memberP(X2,X8)
| ~ leq(X8,X7)
| X7 = X8 ) )
& memberP(X2,X7)
& memberP(X1,X7) ) ) ) ) ) ) ) ),
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
| ? [X5] :
( ssItem(X5)
& ( ( ~ memberP(X3,X5)
& ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X4,X6)
| ~ leq(X6,X5)
| X5 = X6 ) )
& memberP(X4,X5) )
| ( memberP(X3,X5)
& ( ~ memberP(X4,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X6,X5) ) ) ) ) )
| ! [X7] :
( ssItem(X7)
=> ( ( ~ memberP(X1,X7)
& ( ~ memberP(X2,X7)
| ? [X8] :
( ssItem(X8)
& X7 != X8
& memberP(X2,X8)
& leq(X8,X7) ) ) )
| ( ! [X8] :
( ssItem(X8)
=> ( ~ memberP(X2,X8)
| ~ leq(X8,X7)
| X7 = X8 ) )
& memberP(X2,X7)
& memberP(X1,X7) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_2,negated_conjecture,
! [X13,X15,X17] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( ssItem(esk5_1(X13))
| memberP(esk3_0,X13)
| ~ memberP(esk4_0,X13)
| ~ ssItem(X13) )
& ( memberP(esk4_0,esk5_1(X13))
| memberP(esk3_0,X13)
| ~ memberP(esk4_0,X13)
| ~ ssItem(X13) )
& ( leq(esk5_1(X13),X13)
| memberP(esk3_0,X13)
| ~ memberP(esk4_0,X13)
| ~ ssItem(X13) )
& ( X13 != esk5_1(X13)
| memberP(esk3_0,X13)
| ~ memberP(esk4_0,X13)
| ~ ssItem(X13) )
& ( memberP(esk4_0,X13)
| ~ memberP(esk3_0,X13)
| ~ ssItem(X13) )
& ( ~ ssItem(X15)
| X13 = X15
| ~ memberP(esk4_0,X15)
| ~ leq(X15,X13)
| ~ memberP(esk3_0,X13)
| ~ ssItem(X13) )
& ssItem(esk6_0)
& ( memberP(esk2_0,esk6_0)
| memberP(esk1_0,esk6_0) )
& ( ~ ssItem(X17)
| esk6_0 = X17
| ~ memberP(esk2_0,X17)
| ~ leq(X17,esk6_0)
| memberP(esk1_0,esk6_0) )
& ( ssItem(esk7_0)
| ~ memberP(esk2_0,esk6_0)
| ~ memberP(esk1_0,esk6_0) )
& ( memberP(esk2_0,esk7_0)
| ~ memberP(esk2_0,esk6_0)
| ~ memberP(esk1_0,esk6_0) )
& ( leq(esk7_0,esk6_0)
| ~ memberP(esk2_0,esk6_0)
| ~ memberP(esk1_0,esk6_0) )
& ( esk6_0 != esk7_0
| ~ memberP(esk2_0,esk6_0)
| ~ memberP(esk1_0,esk6_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,
( ssItem(esk7_0)
| ~ memberP(esk1_0,esk6_0)
| ~ memberP(esk2_0,esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( memberP(esk4_0,X1)
| ~ ssItem(X1)
| ~ memberP(esk3_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
( memberP(esk2_0,esk7_0)
| ~ memberP(esk1_0,esk6_0)
| ~ memberP(esk2_0,esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
( ~ memberP(esk1_0,esk6_0)
| ~ memberP(esk2_0,esk6_0)
| esk6_0 != esk7_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
( X1 = X2
| ~ ssItem(X1)
| ~ memberP(esk3_0,X1)
| ~ leq(X2,X1)
| ~ memberP(esk4_0,X2)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( leq(esk7_0,esk6_0)
| ~ memberP(esk1_0,esk6_0)
| ~ memberP(esk2_0,esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( ssItem(esk7_0)
| ~ memberP(esk1_0,esk6_0)
| ~ memberP(esk4_0,esk6_0) ),
inference(rw,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_12,negated_conjecture,
( memberP(esk4_0,X1)
| ~ memberP(esk1_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_13,negated_conjecture,
ssItem(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
( memberP(esk4_0,esk7_0)
| ~ memberP(esk1_0,esk6_0)
| ~ memberP(esk4_0,esk6_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_4]),c_0_4]) ).
cnf(c_0_15,negated_conjecture,
( esk6_0 != esk7_0
| ~ memberP(esk1_0,esk6_0)
| ~ memberP(esk4_0,esk6_0) ),
inference(rw,[status(thm)],[c_0_8,c_0_4]) ).
cnf(c_0_16,negated_conjecture,
( X1 = X2
| ~ leq(X2,X1)
| ~ memberP(esk1_0,X1)
| ~ memberP(esk4_0,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_17,negated_conjecture,
( leq(esk7_0,esk6_0)
| ~ memberP(esk1_0,esk6_0)
| ~ memberP(esk4_0,esk6_0) ),
inference(rw,[status(thm)],[c_0_10,c_0_4]) ).
cnf(c_0_18,negated_conjecture,
( ssItem(esk7_0)
| ~ memberP(esk1_0,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_19,negated_conjecture,
( memberP(esk4_0,esk7_0)
| ~ memberP(esk1_0,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_12]),c_0_13])]) ).
cnf(c_0_20,negated_conjecture,
( esk6_0 != esk7_0
| ~ memberP(esk1_0,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_12]),c_0_13])]) ).
cnf(c_0_21,negated_conjecture,
( memberP(esk1_0,esk6_0)
| esk6_0 = X1
| ~ leq(X1,esk6_0)
| ~ memberP(esk2_0,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_22,negated_conjecture,
( memberP(esk3_0,X1)
| leq(esk5_1(X1),X1)
| ~ ssItem(X1)
| ~ memberP(esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_23,negated_conjecture,
( memberP(esk1_0,esk6_0)
| memberP(esk2_0,esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_24,negated_conjecture,
( ~ memberP(esk1_0,esk6_0)
| ~ memberP(esk4_0,esk6_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_13])]),c_0_18]),c_0_19]),c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( esk6_0 = X1
| memberP(esk1_0,esk6_0)
| ~ leq(X1,esk6_0)
| ~ memberP(esk4_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_21,c_0_4]) ).
cnf(c_0_26,negated_conjecture,
( leq(esk5_1(X1),X1)
| memberP(esk1_0,X1)
| ~ memberP(esk4_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_22,c_0_6]) ).
cnf(c_0_27,negated_conjecture,
( memberP(esk4_0,esk6_0)
| memberP(esk1_0,esk6_0) ),
inference(rw,[status(thm)],[c_0_23,c_0_4]) ).
cnf(c_0_28,negated_conjecture,
( memberP(esk3_0,X1)
| memberP(esk4_0,esk5_1(X1))
| ~ ssItem(X1)
| ~ memberP(esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_29,negated_conjecture,
~ memberP(esk1_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_12]),c_0_13])]) ).
cnf(c_0_30,negated_conjecture,
( esk5_1(esk6_0) = esk6_0
| memberP(esk1_0,esk6_0)
| ~ memberP(esk4_0,esk5_1(esk6_0))
| ~ ssItem(esk5_1(esk6_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_13])]),c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( memberP(esk4_0,esk5_1(X1))
| memberP(esk1_0,X1)
| ~ memberP(esk4_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_28,c_0_6]) ).
cnf(c_0_32,negated_conjecture,
memberP(esk4_0,esk6_0),
inference(sr,[status(thm)],[c_0_27,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( memberP(esk3_0,X1)
| ssItem(esk5_1(X1))
| ~ ssItem(X1)
| ~ memberP(esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_34,negated_conjecture,
( memberP(esk3_0,X1)
| ~ ssItem(X1)
| ~ memberP(esk4_0,X1)
| X1 != esk5_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_35,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(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_13])]),c_0_32])]),c_0_29]) ).
cnf(c_0_36,negated_conjecture,
( memberP(esk1_0,X1)
| ssItem(esk5_1(X1))
| ~ memberP(esk4_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_33,c_0_6]) ).
cnf(c_0_37,negated_conjecture,
( memberP(esk1_0,X1)
| esk5_1(X1) != X1
| ~ memberP(esk4_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_34,c_0_6]) ).
cnf(c_0_38,negated_conjecture,
esk5_1(esk6_0) = esk6_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_32]),c_0_13])]),c_0_29]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_32]),c_0_13])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SWC379+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n016.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 20:43:13 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 : 40
% 0.24/1.41 # Proof object clause steps : 37
% 0.24/1.41 # Proof object formula steps : 3
% 0.24/1.41 # Proof object conjectures : 40
% 0.24/1.41 # Proof object clause conjectures : 37
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 15
% 0.24/1.41 # Proof object initial formulas used : 1
% 0.24/1.41 # Proof object generating inferences : 9
% 0.24/1.41 # Proof object simplifying inferences : 43
% 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 : 66
% 0.24/1.41 # Initial clauses : 64
% 0.24/1.41 # Removed in clause preprocessing : 0
% 0.24/1.41 # Initial clauses in saturation : 64
% 0.24/1.41 # Processed clauses : 78
% 0.24/1.41 # ...of these trivial : 2
% 0.24/1.41 # ...subsumed : 2
% 0.24/1.41 # ...remaining for further processing : 74
% 0.24/1.41 # Other redundant clauses eliminated : 3
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 6
% 0.24/1.41 # Backward-rewritten : 2
% 0.24/1.41 # Generated clauses : 157
% 0.24/1.41 # ...of the previous two non-trivial : 119
% 0.24/1.41 # Contextual simplify-reflections : 10
% 0.24/1.41 # Paramodulations : 148
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 8
% 0.24/1.41 # Current number of processed clauses : 63
% 0.24/1.41 # Positive orientable unit clauses : 10
% 0.24/1.41 # Positive unorientable unit clauses: 0
% 0.24/1.41 # Negative unit clauses : 2
% 0.24/1.41 # Non-unit-clauses : 51
% 0.24/1.41 # Current number of unprocessed clauses: 102
% 0.24/1.41 # ...number of literals in the above : 620
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 9
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 459
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 116
% 0.24/1.41 # Non-unit clause-clause subsumptions : 17
% 0.24/1.41 # Unit Clause-clause subsumption calls : 9
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 2
% 0.24/1.41 # BW rewrite match successes : 2
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 8231
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.032 s
% 0.24/1.41 # System time : 0.003 s
% 0.24/1.41 # Total time : 0.035 s
% 0.24/1.41 # Maximum resident set size: 3216 pages
%------------------------------------------------------------------------------