TSTP Solution File: SET601+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET601+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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:52:21 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 54 ( 54 unt; 0 def)
% Number of atoms : 54 ( 53 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 8 ( 8 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 120 ( 14 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(union_intersection,axiom,
! [X1,X2] : union(X1,intersection(X1,X2)) = X1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',union_intersection) ).
fof(idempotency_of_intersection,axiom,
! [X1] : intersection(X1,X1) = X1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',idempotency_of_intersection) ).
fof(prove_th72,conjecture,
! [X1,X2,X3] : union(union(intersection(X1,X2),intersection(X2,X3)),intersection(X3,X1)) = intersection(intersection(union(X1,X2),union(X2,X3)),union(X3,X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_th72) ).
fof(union_distributes_over_intersection,axiom,
! [X1,X2,X3] : union(X1,intersection(X2,X3)) = intersection(union(X1,X2),union(X1,X3)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',union_distributes_over_intersection) ).
fof(commutativity_of_union,axiom,
! [X1,X2] : union(X1,X2) = union(X2,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_of_union) ).
fof(associativity_of_intersection,axiom,
! [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',associativity_of_intersection) ).
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(associativity_of_union,axiom,
! [X1,X2,X3] : union(union(X1,X2),X3) = union(X1,union(X2,X3)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',associativity_of_union) ).
fof(c_0_8,plain,
! [X3,X4] : union(X3,intersection(X3,X4)) = X3,
inference(variable_rename,[status(thm)],[union_intersection]) ).
fof(c_0_9,plain,
! [X2] : intersection(X2,X2) = X2,
inference(variable_rename,[status(thm)],[idempotency_of_intersection]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X2,X3] : union(union(intersection(X1,X2),intersection(X2,X3)),intersection(X3,X1)) = intersection(intersection(union(X1,X2),union(X2,X3)),union(X3,X1)),
inference(assume_negation,[status(cth)],[prove_th72]) ).
fof(c_0_11,plain,
! [X4,X5,X6] : union(X4,intersection(X5,X6)) = intersection(union(X4,X5),union(X4,X6)),
inference(variable_rename,[status(thm)],[union_distributes_over_intersection]) ).
fof(c_0_12,plain,
! [X3,X4] : union(X3,X4) = union(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_of_union]) ).
fof(c_0_13,plain,
! [X4,X5,X6] : intersection(intersection(X4,X5),X6) = intersection(X4,intersection(X5,X6)),
inference(variable_rename,[status(thm)],[associativity_of_intersection]) ).
fof(c_0_14,plain,
! [X3,X4] : intersection(X3,X4) = intersection(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_of_intersection]) ).
cnf(c_0_15,plain,
union(X1,intersection(X1,X2)) = X1,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
intersection(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_17,negated_conjecture,
union(union(intersection(esk1_0,esk2_0),intersection(esk2_0,esk3_0)),intersection(esk3_0,esk1_0)) != intersection(intersection(union(esk1_0,esk2_0),union(esk2_0,esk3_0)),union(esk3_0,esk1_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_18,plain,
! [X4,X5,X6] : union(union(X4,X5),X6) = union(X4,union(X5,X6)),
inference(variable_rename,[status(thm)],[associativity_of_union]) ).
cnf(c_0_19,plain,
union(X1,intersection(X2,X3)) = intersection(union(X1,X2),union(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
union(X1,X2) = union(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
intersection(intersection(X1,X2),X3) = intersection(X1,intersection(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
union(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,negated_conjecture,
union(union(intersection(esk1_0,esk2_0),intersection(esk2_0,esk3_0)),intersection(esk3_0,esk1_0)) != intersection(intersection(union(esk1_0,esk2_0),union(esk2_0,esk3_0)),union(esk3_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
union(union(X1,X2),X3) = union(X1,union(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
intersection(union(X1,X2),union(X2,X3)) = union(X2,intersection(X1,X3)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
intersection(union(X1,intersection(X2,X3)),X4) = intersection(union(X1,X2),intersection(union(X1,X3),X4)),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_28,plain,
union(X1,intersection(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_22]) ).
cnf(c_0_29,plain,
intersection(X1,union(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_23]),c_0_15]) ).
cnf(c_0_30,negated_conjecture,
intersection(union(esk1_0,esk2_0),intersection(union(esk1_0,esk3_0),union(esk2_0,esk3_0))) != union(intersection(esk1_0,esk2_0),union(intersection(esk1_0,esk3_0),intersection(esk2_0,esk3_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_20]),c_0_21]),c_0_22]),c_0_22]),c_0_20]) ).
cnf(c_0_31,plain,
intersection(union(X1,X2),union(X3,X2)) = union(X2,intersection(X1,X3)),
inference(spm,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_32,plain,
intersection(union(X1,X2),intersection(union(X1,X3),union(intersection(X2,X3),X4))) = union(intersection(X2,X3),intersection(X1,X4)),
inference(spm,[status(thm)],[c_0_27,c_0_26]) ).
cnf(c_0_33,plain,
union(X1,intersection(X2,intersection(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_21]) ).
cnf(c_0_34,plain,
union(X1,union(X1,X2)) = union(X1,X2),
inference(spm,[status(thm)],[c_0_25,c_0_23]) ).
cnf(c_0_35,plain,
intersection(X1,union(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_20]) ).
cnf(c_0_36,negated_conjecture,
intersection(union(esk1_0,esk2_0),union(esk3_0,intersection(esk1_0,esk2_0))) != union(intersection(esk1_0,esk2_0),union(intersection(esk1_0,esk3_0),intersection(esk2_0,esk3_0))),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
intersection(union(X1,X2),X3) = union(intersection(X2,X3),intersection(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_31]),c_0_33]) ).
cnf(c_0_38,plain,
union(X1,intersection(X2,union(X1,X3))) = union(X1,intersection(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_34]),c_0_19]) ).
cnf(c_0_39,plain,
intersection(X1,intersection(X2,X1)) = intersection(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_15]),c_0_21]) ).
cnf(c_0_40,plain,
union(X1,union(X2,X3)) = union(X2,union(X3,X1)),
inference(spm,[status(thm)],[c_0_25,c_0_20]) ).
cnf(c_0_41,plain,
union(X1,union(X2,X3)) = union(X2,union(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_20]),c_0_25]) ).
cnf(c_0_42,negated_conjecture,
union(intersection(esk1_0,union(esk3_0,intersection(esk1_0,esk2_0))),intersection(esk2_0,union(esk3_0,intersection(esk1_0,esk2_0)))) != union(intersection(esk1_0,esk2_0),union(intersection(esk1_0,esk3_0),intersection(esk2_0,esk3_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_20]) ).
cnf(c_0_43,plain,
intersection(X1,union(X2,intersection(X3,X1))) = intersection(X1,union(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_38]),c_0_21]),c_0_19]),c_0_39]) ).
cnf(c_0_44,plain,
intersection(X1,intersection(X2,X3)) = intersection(X2,intersection(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_21]) ).
cnf(c_0_45,plain,
intersection(X1,union(X2,union(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_40]) ).
cnf(c_0_46,plain,
intersection(X1,union(X2,union(X1,X3))) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
union(intersection(esk1_0,union(esk3_0,intersection(esk1_0,esk2_0))),intersection(esk2_0,union(esk1_0,esk3_0))) != union(intersection(esk1_0,esk2_0),union(intersection(esk1_0,esk3_0),intersection(esk2_0,esk3_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_20]) ).
cnf(c_0_48,plain,
intersection(X1,union(X2,intersection(X1,X3))) = intersection(X1,union(X2,X3)),
inference(spm,[status(thm)],[c_0_43,c_0_22]) ).
cnf(c_0_49,plain,
intersection(X1,intersection(X2,union(X3,union(X4,X1)))) = intersection(X2,X1),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,plain,
intersection(X1,intersection(X2,union(X3,union(X1,X4)))) = intersection(X2,X1),
inference(spm,[status(thm)],[c_0_44,c_0_46]) ).
cnf(c_0_51,negated_conjecture,
union(intersection(esk1_0,union(esk2_0,esk3_0)),intersection(esk2_0,union(esk1_0,esk3_0))) != union(intersection(esk1_0,esk2_0),union(intersection(esk1_0,esk3_0),intersection(esk2_0,esk3_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48]),c_0_20]) ).
cnf(c_0_52,plain,
intersection(X1,union(X2,X3)) = union(intersection(X1,X3),intersection(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_34]),c_0_37]),c_0_49]),c_0_50]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52]),c_0_20]),c_0_52]),c_0_22]),c_0_20]),c_0_25]),c_0_41]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET601+3 : TPTP v8.1.0. Released v2.2.0.
% 0.08/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jul 10 22:20:08 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.014 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 54
% 0.23/1.42 # Proof object clause steps : 37
% 0.23/1.42 # Proof object formula steps : 17
% 0.23/1.42 # Proof object conjectures : 10
% 0.23/1.42 # Proof object clause conjectures : 7
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 8
% 0.23/1.42 # Proof object initial formulas used : 8
% 0.23/1.42 # Proof object generating inferences : 23
% 0.23/1.42 # Proof object simplifying inferences : 34
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 14
% 0.23/1.42 # Removed by relevancy pruning/SinE : 6
% 0.23/1.42 # Initial clauses : 8
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 8
% 0.23/1.42 # Processed clauses : 1409
% 0.23/1.42 # ...of these trivial : 377
% 0.23/1.42 # ...subsumed : 831
% 0.23/1.42 # ...remaining for further processing : 201
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 0
% 0.23/1.42 # Backward-rewritten : 138
% 0.23/1.42 # Generated clauses : 52062
% 0.23/1.42 # ...of the previous two non-trivial : 46592
% 0.23/1.42 # Contextual simplify-reflections : 0
% 0.23/1.42 # Paramodulations : 52062
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 63
% 0.23/1.42 # Positive orientable unit clauses : 53
% 0.23/1.42 # Positive unorientable unit clauses: 10
% 0.23/1.42 # Negative unit clauses : 0
% 0.23/1.42 # Non-unit-clauses : 0
% 0.23/1.42 # Current number of unprocessed clauses: 2544
% 0.23/1.42 # ...number of literals in the above : 2544
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 138
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 0
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 0
% 0.23/1.42 # Non-unit clause-clause subsumptions : 0
% 0.23/1.42 # Unit Clause-clause subsumption calls : 762
% 0.23/1.42 # Rewrite failures with RHS unbound : 978
% 0.23/1.42 # BW rewrite match attempts : 2016
% 0.23/1.42 # BW rewrite match successes : 903
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 844349
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.756 s
% 0.23/1.42 # System time : 0.035 s
% 0.23/1.42 # Total time : 0.791 s
% 0.23/1.42 # Maximum resident set size: 39740 pages
% 0.23/23.43 eprover: CPU time limit exceeded, terminating
% 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
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.50 eprover: No such file or directory
% 0.23/23.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.51 eprover: No such file or directory
%------------------------------------------------------------------------------