TSTP Solution File: SET594+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET594+3 : TPTP v8.1.0. Released v2.2.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 00:52:16 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 7 unt; 0 def)
% Number of atoms : 74 ( 8 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 68 ( 23 ~; 31 |; 8 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 65 ( 11 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_th53,conjecture,
! [X1,X2,X3] :
( union(intersection(X1,X2),intersection(X1,X3)) = X1
=> subset(X1,union(X2,X3)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_th53) ).
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(union_defn,axiom,
! [X1,X2,X3] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',union_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(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(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( union(intersection(X1,X2),intersection(X1,X3)) = X1
=> subset(X1,union(X2,X3)) ),
inference(assume_negation,[status(cth)],[prove_th53]) ).
fof(c_0_6,negated_conjecture,
( union(intersection(esk1_0,esk2_0),intersection(esk1_0,esk3_0)) = esk1_0
& ~ subset(esk1_0,union(esk2_0,esk3_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_7,plain,
! [X3,X4] : intersection(X3,X4) = intersection(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_of_intersection]) ).
fof(c_0_8,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( ~ member(X6,union(X4,X5))
| member(X6,X4)
| member(X6,X5) )
& ( ~ member(X6,X4)
| member(X6,union(X4,X5)) )
& ( ~ member(X6,X5)
| member(X6,union(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)],[union_defn])])])])]) ).
cnf(c_0_9,negated_conjecture,
union(intersection(esk1_0,esk2_0),intersection(esk1_0,esk3_0)) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,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_12,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
union(intersection(esk2_0,esk1_0),intersection(esk3_0,esk1_0)) = esk1_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
cnf(c_0_14,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( member(X1,intersection(esk2_0,esk1_0))
| member(X1,intersection(esk3_0,esk1_0))
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_16,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])])])])])])]) ).
cnf(c_0_17,negated_conjecture,
( member(X1,intersection(esk2_0,esk1_0))
| member(X1,esk3_0)
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( subset(X1,X2)
| ~ member(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,negated_conjecture,
( member(X1,esk3_0)
| member(X1,esk2_0)
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_21,plain,
( subset(X1,X2)
| member(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,plain,
( subset(X1,union(X2,X3))
| ~ member(esk4_2(X1,union(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( member(esk4_2(esk1_0,X1),esk2_0)
| member(esk4_2(esk1_0,X1),esk3_0)
| subset(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( subset(X1,union(X2,X3))
| ~ member(esk4_2(X1,union(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( member(esk4_2(esk1_0,union(X1,esk3_0)),esk2_0)
| subset(esk1_0,union(X1,esk3_0)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
~ subset(esk1_0,union(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET594+3 : TPTP v8.1.0. Released v2.2.0.
% 0.04/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jul 9 21:05:15 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.015 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 29
% 0.23/1.41 # Proof object clause steps : 18
% 0.23/1.41 # Proof object formula steps : 11
% 0.23/1.41 # Proof object conjectures : 12
% 0.23/1.41 # Proof object clause conjectures : 9
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 9
% 0.23/1.41 # Proof object initial formulas used : 5
% 0.23/1.41 # Proof object generating inferences : 8
% 0.23/1.41 # Proof object simplifying inferences : 3
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 9
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 21
% 0.23/1.41 # Removed in clause preprocessing : 2
% 0.23/1.41 # Initial clauses in saturation : 19
% 0.23/1.41 # Processed clauses : 1303
% 0.23/1.41 # ...of these trivial : 306
% 0.23/1.41 # ...subsumed : 601
% 0.23/1.41 # ...remaining for further processing : 396
% 0.23/1.41 # Other redundant clauses eliminated : 2
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 26
% 0.23/1.41 # Backward-rewritten : 15
% 0.23/1.41 # Generated clauses : 4457
% 0.23/1.41 # ...of the previous two non-trivial : 3821
% 0.23/1.41 # Contextual simplify-reflections : 70
% 0.23/1.41 # Paramodulations : 4445
% 0.23/1.41 # Factorizations : 10
% 0.23/1.41 # Equation resolutions : 2
% 0.23/1.41 # Current number of processed clauses : 353
% 0.23/1.41 # Positive orientable unit clauses : 146
% 0.23/1.41 # Positive unorientable unit clauses: 2
% 0.23/1.41 # Negative unit clauses : 1
% 0.23/1.41 # Non-unit-clauses : 204
% 0.23/1.41 # Current number of unprocessed clauses: 2274
% 0.23/1.41 # ...number of literals in the above : 5129
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 41
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 10500
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 10315
% 0.23/1.41 # Non-unit clause-clause subsumptions : 697
% 0.23/1.41 # Unit Clause-clause subsumption calls : 92
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 1164
% 0.23/1.41 # BW rewrite match successes : 24
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 61047
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.119 s
% 0.23/1.41 # System time : 0.003 s
% 0.23/1.41 # Total time : 0.122 s
% 0.23/1.41 # Maximum resident set size: 5676 pages
% 0.23/23.41 eprover: CPU time limit exceeded, terminating
% 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.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.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.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
%------------------------------------------------------------------------------