TSTP Solution File: SET143+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET143+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.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 00:49:34 EDT 2022
% Result : Theorem 0.23s 3.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 62 ( 33 unt; 0 def)
% Number of atoms : 113 ( 26 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 84 ( 33 ~; 39 |; 8 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 168 ( 17 sgn 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',subset_defn) ).
fof(intersection_defn,axiom,
! [X1,X2,X3] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',intersection_defn) ).
fof(commutativity_of_intersection,axiom,
! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_of_intersection) ).
fof(equal_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',equal_defn) ).
fof(prove_associativity_of_intersection,conjecture,
! [X1,X2,X3] : intersection(intersection(X1,X2),X3) = intersection(X1,intersection(X2,X3)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_associativity_of_intersection) ).
fof(c_0_5,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk4_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ member(esk4_2(X4,X5),X5)
| subset(X4,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)],[subset_defn])])])])])])]) ).
fof(c_0_6,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( member(X6,X4)
| ~ member(X6,intersection(X4,X5)) )
& ( member(X6,X5)
| ~ member(X6,intersection(X4,X5)) )
& ( ~ member(X6,X4)
| ~ member(X6,X5)
| member(X6,intersection(X4,X5)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection_defn])])])])]) ).
cnf(c_0_7,plain,
( subset(X1,X2)
| ~ member(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( subset(X1,X2)
| member(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( subset(X1,intersection(X2,X3))
| ~ member(esk4_2(X1,intersection(X2,X3)),X3)
| ~ member(esk4_2(X1,intersection(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,plain,
( subset(intersection(X1,X2),X3)
| member(esk4_2(intersection(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( subset(intersection(X1,X2),X3)
| member(esk4_2(intersection(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_15,plain,
( subset(intersection(X1,X2),intersection(X3,X1))
| ~ member(esk4_2(intersection(X1,X2),intersection(X3,X1)),X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( subset(intersection(X1,intersection(X2,X3)),X4)
| member(esk4_2(intersection(X1,intersection(X2,X3)),X4),X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_17,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,plain,
subset(intersection(X1,X2),intersection(X2,X1)),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_19,plain,
subset(intersection(X1,intersection(X2,X3)),intersection(X2,X1)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( subset(intersection(X1,X2),intersection(X3,X2))
| ~ member(esk4_2(intersection(X1,X2),intersection(X3,X2)),X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_21,plain,
( subset(intersection(intersection(X1,X2),X3),X4)
| member(esk4_2(intersection(intersection(X1,X2),X3),X4),X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_13]) ).
fof(c_0_22,plain,
! [X3,X4] : intersection(X3,X4) = intersection(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_of_intersection]) ).
cnf(c_0_23,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,intersection(X3,X2)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,intersection(X3,intersection(X2,X4))) ),
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
fof(c_0_25,plain,
! [X3,X4,X3,X4] :
( ( subset(X3,X4)
| X3 != X4 )
& ( subset(X4,X3)
| X3 != X4 )
& ( ~ subset(X3,X4)
| ~ subset(X4,X3)
| X3 = X4 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_defn])])])])]) ).
cnf(c_0_26,plain,
subset(intersection(intersection(X1,X2),X3),intersection(X1,X3)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
( subset(X1,intersection(X2,X1))
| ~ member(esk4_2(X1,intersection(X2,X1)),X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_29,plain,
( subset(intersection(X1,X2),X3)
| member(esk4_2(intersection(X1,X2),X3),intersection(X2,X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_10]) ).
cnf(c_0_30,plain,
( subset(intersection(intersection(X1,X2),X3),X4)
| member(esk4_2(intersection(intersection(X1,X2),X3),X4),intersection(X2,X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_13]) ).
cnf(c_0_31,plain,
( subset(intersection(X1,intersection(X2,X3)),X4)
| member(esk4_2(intersection(X1,intersection(X2,X3)),X4),intersection(X2,X1)) ),
inference(spm,[status(thm)],[c_0_24,c_0_10]) ).
cnf(c_0_32,plain,
( subset(intersection(intersection(X1,X2),X3),X4)
| member(esk4_2(intersection(intersection(X1,X2),X3),X4),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_13]) ).
fof(c_0_33,negated_conjecture,
~ ! [X1,X2,X3] : intersection(intersection(X1,X2),X3) = intersection(X1,intersection(X2,X3)),
inference(assume_negation,[status(cth)],[prove_associativity_of_intersection]) ).
cnf(c_0_34,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,plain,
subset(intersection(intersection(X1,X2),X3),intersection(X3,X1)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_36,plain,
subset(intersection(X1,X2),intersection(intersection(X2,X1),intersection(X1,X2))),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
subset(intersection(intersection(X1,X2),X3),intersection(X2,X1)),
inference(spm,[status(thm)],[c_0_7,c_0_30]) ).
cnf(c_0_38,plain,
( subset(intersection(X1,intersection(X2,X3)),X4)
| member(esk4_2(intersection(X1,intersection(X2,X3)),X4),intersection(X3,X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_14]) ).
cnf(c_0_39,plain,
subset(intersection(X1,X2),intersection(X1,intersection(X1,X2))),
inference(spm,[status(thm)],[c_0_28,c_0_13]) ).
cnf(c_0_40,plain,
subset(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_7,c_0_14]) ).
cnf(c_0_41,plain,
subset(intersection(X1,intersection(X2,X3)),intersection(intersection(X2,X1),intersection(X2,X3))),
inference(spm,[status(thm)],[c_0_20,c_0_31]) ).
cnf(c_0_42,plain,
subset(intersection(intersection(X1,X2),X3),intersection(X2,X3)),
inference(spm,[status(thm)],[c_0_20,c_0_32]) ).
fof(c_0_43,negated_conjecture,
intersection(intersection(esk1_0,esk2_0),esk3_0) != intersection(esk1_0,intersection(esk2_0,esk3_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])]) ).
cnf(c_0_44,plain,
( intersection(X1,X2) = intersection(intersection(X2,X3),X1)
| ~ subset(intersection(X1,X2),intersection(intersection(X2,X3),X1)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_45,plain,
intersection(intersection(X1,X2),intersection(X2,X1)) = intersection(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_36]),c_0_37])]) ).
cnf(c_0_46,plain,
subset(intersection(X1,intersection(X2,X3)),intersection(intersection(X3,X2),X1)),
inference(spm,[status(thm)],[c_0_15,c_0_38]) ).
cnf(c_0_47,plain,
intersection(X1,intersection(X1,X2)) = intersection(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_39]),c_0_40])]) ).
cnf(c_0_48,plain,
subset(intersection(X1,X2),X1),
inference(spm,[status(thm)],[c_0_7,c_0_13]) ).
cnf(c_0_49,plain,
intersection(intersection(X1,X2),intersection(X1,X3)) = intersection(X2,intersection(X1,X3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_41]),c_0_42])]) ).
cnf(c_0_50,negated_conjecture,
intersection(intersection(esk1_0,esk2_0),esk3_0) != intersection(esk1_0,intersection(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_51,plain,
intersection(X1,intersection(X2,X3)) = intersection(intersection(X3,X2),X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]) ).
cnf(c_0_52,plain,
intersection(X1,intersection(intersection(X1,X2),X3)) = intersection(intersection(X1,X2),X3),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_47]),c_0_48])]),c_0_27]) ).
cnf(c_0_53,plain,
intersection(X1,intersection(X2,X3)) = intersection(X3,intersection(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_49]),c_0_49]) ).
cnf(c_0_54,negated_conjecture,
intersection(esk3_0,intersection(esk1_0,esk2_0)) != intersection(esk1_0,intersection(esk2_0,esk3_0)),
inference(rw,[status(thm)],[c_0_50,c_0_27]) ).
cnf(c_0_55,plain,
intersection(intersection(intersection(X1,X2),X3),intersection(intersection(X2,X1),X3)) = intersection(intersection(X2,X1),X3),
inference(spm,[status(thm)],[c_0_45,c_0_51]) ).
cnf(c_0_56,plain,
intersection(intersection(X1,X2),intersection(intersection(X2,X1),X3)) = intersection(intersection(X2,X1),X3),
inference(spm,[status(thm)],[c_0_52,c_0_45]) ).
cnf(c_0_57,plain,
intersection(X1,intersection(X2,X1)) = intersection(X2,X1),
inference(spm,[status(thm)],[c_0_47,c_0_27]) ).
cnf(c_0_58,plain,
intersection(intersection(X1,X2),X3) = intersection(X2,intersection(X1,X3)),
inference(spm,[status(thm)],[c_0_27,c_0_53]) ).
cnf(c_0_59,negated_conjecture,
intersection(esk2_0,intersection(esk1_0,esk3_0)) != intersection(esk1_0,intersection(esk2_0,esk3_0)),
inference(rw,[status(thm)],[c_0_54,c_0_53]) ).
cnf(c_0_60,plain,
intersection(X1,intersection(X2,X3)) = intersection(X2,intersection(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_53]),c_0_56]),c_0_57]),c_0_58]),c_0_58]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET143+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 02:17:28 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/3.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/3.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/3.42 # Preprocessing time : 0.009 s
% 0.23/3.42
% 0.23/3.42 # Proof found!
% 0.23/3.42 # SZS status Theorem
% 0.23/3.42 # SZS output start CNFRefutation
% See solution above
% 0.23/3.42 # Proof object total steps : 62
% 0.23/3.42 # Proof object clause steps : 51
% 0.23/3.42 # Proof object formula steps : 11
% 0.23/3.42 # Proof object conjectures : 7
% 0.23/3.42 # Proof object clause conjectures : 4
% 0.23/3.42 # Proof object formula conjectures : 3
% 0.23/3.42 # Proof object initial clauses used : 9
% 0.23/3.42 # Proof object initial formulas used : 5
% 0.23/3.42 # Proof object generating inferences : 38
% 0.23/3.42 # Proof object simplifying inferences : 21
% 0.23/3.42 # Training examples: 0 positive, 0 negative
% 0.23/3.42 # Parsed axioms : 7
% 0.23/3.42 # Removed by relevancy pruning/SinE : 0
% 0.23/3.42 # Initial clauses : 16
% 0.23/3.42 # Removed in clause preprocessing : 2
% 0.23/3.42 # Initial clauses in saturation : 14
% 0.23/3.42 # Processed clauses : 11674
% 0.23/3.42 # ...of these trivial : 5459
% 0.23/3.42 # ...subsumed : 5264
% 0.23/3.42 # ...remaining for further processing : 951
% 0.23/3.42 # Other redundant clauses eliminated : 2
% 0.23/3.42 # Clauses deleted for lack of memory : 0
% 0.23/3.42 # Backward-subsumed : 0
% 0.23/3.42 # Backward-rewritten : 773
% 0.23/3.42 # Generated clauses : 272451
% 0.23/3.42 # ...of the previous two non-trivial : 158497
% 0.23/3.42 # Contextual simplify-reflections : 21
% 0.23/3.42 # Paramodulations : 272439
% 0.23/3.42 # Factorizations : 10
% 0.23/3.42 # Equation resolutions : 2
% 0.23/3.42 # Current number of processed clauses : 176
% 0.23/3.42 # Positive orientable unit clauses : 64
% 0.23/3.42 # Positive unorientable unit clauses: 3
% 0.23/3.42 # Negative unit clauses : 0
% 0.23/3.42 # Non-unit-clauses : 109
% 0.23/3.42 # Current number of unprocessed clauses: 5260
% 0.23/3.42 # ...number of literals in the above : 10358
% 0.23/3.42 # Current number of archived formulas : 0
% 0.23/3.42 # Current number of archived clauses : 773
% 0.23/3.42 # Clause-clause subsumption calls (NU) : 103976
% 0.23/3.42 # Rec. Clause-clause subsumption calls : 103841
% 0.23/3.42 # Non-unit clause-clause subsumptions : 4990
% 0.23/3.42 # Unit Clause-clause subsumption calls : 1985
% 0.23/3.42 # Rewrite failures with RHS unbound : 0
% 0.23/3.42 # BW rewrite match attempts : 41226
% 0.23/3.42 # BW rewrite match successes : 1121
% 0.23/3.42 # Condensation attempts : 0
% 0.23/3.42 # Condensation successes : 0
% 0.23/3.42 # Termbank termtop insertions : 3178954
% 0.23/3.42
% 0.23/3.42 # -------------------------------------------------
% 0.23/3.42 # User time : 2.210 s
% 0.23/3.42 # System time : 0.080 s
% 0.23/3.42 # Total time : 2.290 s
% 0.23/3.42 # Maximum resident set size: 120312 pages
% 0.23/23.41 eprover: CPU time limit exceeded, terminating
% 0.23/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.42 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------