TSTP Solution File: SET200+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET200+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n004.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:50:04 EDT 2022
% Result : Theorem 0.22s 1.42s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 45 ( 11 unt; 0 def)
% Number of atoms : 116 ( 19 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 108 ( 37 ~; 53 |; 11 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 108 ( 13 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_th34,conjecture,
! [X1,X2,X3,X4] :
( ( subset(X1,X2)
& subset(X3,X4) )
=> subset(union(X1,X3),union(X2,X4)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_th34) ).
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(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(equal_member_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ! [X3] :
( member(X3,X1)
<=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',equal_member_defn) ).
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(c_0_5,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( subset(X1,X2)
& subset(X3,X4) )
=> subset(union(X1,X3),union(X2,X4)) ),
inference(assume_negation,[status(cth)],[prove_th34]) ).
fof(c_0_6,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk5_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ member(esk5_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_7,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])])])])]) ).
fof(c_0_8,negated_conjecture,
( subset(esk1_0,esk2_0)
& subset(esk3_0,esk4_0)
& ~ subset(union(esk1_0,esk3_0),union(esk2_0,esk4_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_9,plain,
( subset(X1,X2)
| ~ member(esk5_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X4,X5,X6,X6,X4,X5] :
( ( ~ member(X6,X4)
| member(X6,X5)
| X4 != X5 )
& ( ~ member(X6,X5)
| member(X6,X4)
| X4 != X5 )
& ( ~ member(esk6_2(X4,X5),X4)
| ~ member(esk6_2(X4,X5),X5)
| X4 = X5 )
& ( member(esk6_2(X4,X5),X4)
| member(esk6_2(X4,X5),X5)
| 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)],[equal_member_defn])])])])])])]) ).
cnf(c_0_14,plain,
( subset(X1,union(X2,X3))
| ~ member(esk5_2(X1,union(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( member(X1,esk2_0)
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,plain,
( X1 = X2
| member(esk6_2(X1,X2),X2)
| member(esk6_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
( subset(X1,union(X2,esk2_0))
| ~ member(esk5_2(X1,union(X2,esk2_0)),esk1_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( subset(X1,X2)
| member(esk5_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,plain,
( X1 = X2
| ~ member(esk6_2(X1,X2),X2)
| ~ member(esk6_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,plain,
( X1 = union(X2,X3)
| member(esk6_2(X1,union(X2,X3)),X1)
| member(esk6_2(X1,union(X2,X3)),X2)
| member(esk6_2(X1,union(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
subset(esk1_0,union(X1,esk2_0)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( X1 = union(X2,X3)
| ~ member(esk6_2(X1,union(X2,X3)),X1)
| ~ member(esk6_2(X1,union(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( union(X1,X2) = X1
| member(esk6_2(X1,union(X1,X2)),X2)
| member(esk6_2(X1,union(X1,X2)),X1) ),
inference(ef,[status(thm)],[c_0_22]) ).
fof(c_0_26,plain,
! [X3,X4] : union(X3,X4) = union(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_of_union]) ).
cnf(c_0_27,negated_conjecture,
subset(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,plain,
( X1 = union(X2,X3)
| ~ member(esk6_2(X1,union(X2,X3)),X1)
| ~ member(esk6_2(X1,union(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_10]) ).
cnf(c_0_29,negated_conjecture,
( member(X1,union(X2,esk2_0))
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_23]) ).
cnf(c_0_30,plain,
( union(X1,X2) = X1
| member(esk6_2(X1,union(X1,X2)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_25]) ).
cnf(c_0_31,plain,
union(X1,X2) = union(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,plain,
( subset(X1,union(X2,union(X3,X4)))
| ~ member(esk5_2(X1,union(X2,union(X3,X4))),X4) ),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_33,negated_conjecture,
( member(X1,esk4_0)
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_27]) ).
cnf(c_0_34,plain,
( subset(X1,union(X2,X3))
| ~ member(esk5_2(X1,union(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_21]) ).
cnf(c_0_35,plain,
( subset(union(X1,X2),X3)
| member(esk5_2(union(X1,X2),X3),X1)
| member(esk5_2(union(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_36,negated_conjecture,
( union(X1,esk2_0) = union(X2,X3)
| ~ member(esk6_2(union(X1,esk2_0),union(X2,X3)),esk1_0)
| ~ member(esk6_2(union(X1,esk2_0),union(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
( union(X1,X2) = X2
| member(esk6_2(X2,union(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,negated_conjecture,
( subset(X1,union(X2,union(X3,esk4_0)))
| ~ member(esk5_2(X1,union(X2,union(X3,esk4_0))),esk3_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,plain,
( subset(union(X1,X2),union(X2,X3))
| member(esk5_2(union(X1,X2),union(X2,X3)),X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
union(esk1_0,union(X1,esk2_0)) = union(X1,esk2_0),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_30]),c_0_31]),c_0_31]),c_0_37]) ).
cnf(c_0_41,negated_conjecture,
subset(union(esk3_0,X1),union(X1,union(X2,esk4_0))),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
union(esk1_0,union(esk2_0,X1)) = union(esk2_0,X1),
inference(spm,[status(thm)],[c_0_40,c_0_31]) ).
cnf(c_0_43,negated_conjecture,
~ subset(union(esk1_0,esk3_0),union(esk2_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_31]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET200+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n004.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 Jul 10 22:56:52 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.22/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.42 # Preprocessing time : 0.015 s
% 0.22/1.42
% 0.22/1.42 # Proof found!
% 0.22/1.42 # SZS status Theorem
% 0.22/1.42 # SZS output start CNFRefutation
% See solution above
% 0.22/1.42 # Proof object total steps : 45
% 0.22/1.42 # Proof object clause steps : 34
% 0.22/1.42 # Proof object formula steps : 11
% 0.22/1.42 # Proof object conjectures : 17
% 0.22/1.42 # Proof object clause conjectures : 14
% 0.22/1.42 # Proof object formula conjectures : 3
% 0.22/1.42 # Proof object initial clauses used : 12
% 0.22/1.42 # Proof object initial formulas used : 5
% 0.22/1.42 # Proof object generating inferences : 22
% 0.22/1.42 # Proof object simplifying inferences : 6
% 0.22/1.42 # Training examples: 0 positive, 0 negative
% 0.22/1.42 # Parsed axioms : 6
% 0.22/1.42 # Removed by relevancy pruning/SinE : 0
% 0.22/1.42 # Initial clauses : 15
% 0.22/1.42 # Removed in clause preprocessing : 2
% 0.22/1.42 # Initial clauses in saturation : 13
% 0.22/1.42 # Processed clauses : 771
% 0.22/1.42 # ...of these trivial : 73
% 0.22/1.42 # ...subsumed : 528
% 0.22/1.42 # ...remaining for further processing : 169
% 0.22/1.42 # Other redundant clauses eliminated : 0
% 0.22/1.42 # Clauses deleted for lack of memory : 0
% 0.22/1.42 # Backward-subsumed : 3
% 0.22/1.42 # Backward-rewritten : 5
% 0.22/1.42 # Generated clauses : 1744
% 0.22/1.42 # ...of the previous two non-trivial : 1329
% 0.22/1.42 # Contextual simplify-reflections : 35
% 0.22/1.42 # Paramodulations : 1720
% 0.22/1.42 # Factorizations : 24
% 0.22/1.42 # Equation resolutions : 0
% 0.22/1.42 # Current number of processed clauses : 161
% 0.22/1.42 # Positive orientable unit clauses : 50
% 0.22/1.42 # Positive unorientable unit clauses: 1
% 0.22/1.42 # Negative unit clauses : 1
% 0.22/1.42 # Non-unit-clauses : 109
% 0.22/1.42 # Current number of unprocessed clauses: 546
% 0.22/1.42 # ...number of literals in the above : 1191
% 0.22/1.42 # Current number of archived formulas : 0
% 0.22/1.42 # Current number of archived clauses : 8
% 0.22/1.42 # Clause-clause subsumption calls (NU) : 6673
% 0.22/1.42 # Rec. Clause-clause subsumption calls : 6537
% 0.22/1.42 # Non-unit clause-clause subsumptions : 566
% 0.22/1.42 # Unit Clause-clause subsumption calls : 124
% 0.22/1.42 # Rewrite failures with RHS unbound : 0
% 0.22/1.42 # BW rewrite match attempts : 105
% 0.22/1.42 # BW rewrite match successes : 7
% 0.22/1.42 # Condensation attempts : 0
% 0.22/1.42 # Condensation successes : 0
% 0.22/1.42 # Termbank termtop insertions : 20711
% 0.22/1.42
% 0.22/1.42 # -------------------------------------------------
% 0.22/1.42 # User time : 0.053 s
% 0.22/1.42 # System time : 0.002 s
% 0.22/1.42 # Total time : 0.055 s
% 0.22/1.42 # Maximum resident set size: 3816 pages
% 0.22/23.42 eprover: CPU time limit exceeded, terminating
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47 eprover: No such file or directory
%------------------------------------------------------------------------------