%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET632+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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:44 EDT 2022
% Result : Theorem 0.22s 1.42s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 38 ( 12 unt; 0 def)
% Number of atoms : 95 ( 10 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 96 ( 39 ~; 34 |; 16 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 66 ( 13 sgn 35 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_th114,conjecture,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X1,X3)
& disjoint(X2,X3) )
=> X1 = empty_set ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_th114) ).
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(intersect_defn,axiom,
! [X1,X2] :
( intersect(X1,X2)
<=> ? [X3] :
( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',intersect_defn) ).
fof(disjoint_defn,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> ~ intersect(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',disjoint_defn) ).
fof(empty_set_defn,axiom,
! [X1] : ~ member(X1,empty_set),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',empty_set_defn) ).
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(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X1,X3)
& disjoint(X2,X3) )
=> X1 = empty_set ),
inference(assume_negation,[status(cth)],[prove_th114]) ).
fof(c_0_7,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_8,negated_conjecture,
( subset(esk1_0,esk2_0)
& subset(esk1_0,esk3_0)
& disjoint(esk2_0,esk3_0)
& esk1_0 != empty_set ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_9,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
subset(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X4,X5,X4,X5,X7] :
( ( member(esk5_2(X4,X5),X4)
| ~ intersect(X4,X5) )
& ( member(esk5_2(X4,X5),X5)
| ~ intersect(X4,X5) )
& ( ~ member(X7,X4)
| ~ member(X7,X5)
| intersect(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)],[intersect_defn])])])])])])]) ).
cnf(c_0_12,negated_conjecture,
( member(X1,esk3_0)
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( member(esk5_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_15,plain,
! [X3,X4,X3,X4] :
( ( ~ disjoint(X3,X4)
| ~ intersect(X3,X4) )
& ( intersect(X3,X4)
| disjoint(X3,X4) ) ),
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)],[disjoint_defn])])])])]) ).
fof(c_0_16,plain,
! [X2] : ~ member(X2,empty_set),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[empty_set_defn])]) ).
cnf(c_0_17,plain,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( subset(X1,X2)
| member(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,negated_conjecture,
( member(esk5_2(X1,esk1_0),esk3_0)
| ~ intersect(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( member(X1,esk2_0)
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_21,plain,
( ~ intersect(X1,X2)
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
disjoint(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_23,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_24,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
( intersect(X1,X2)
| subset(X2,X3)
| ~ member(esk4_2(X2,X3),X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,negated_conjecture,
( member(esk4_2(esk1_0,X1),esk3_0)
| subset(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_27,negated_conjecture,
( intersect(X1,esk3_0)
| ~ intersect(X2,esk1_0)
| ~ member(esk5_2(X2,esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_28,negated_conjecture,
( member(esk5_2(X1,esk1_0),esk2_0)
| ~ intersect(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_13]) ).
cnf(c_0_29,negated_conjecture,
~ intersect(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,plain,
subset(empty_set,X1),
inference(spm,[status(thm)],[c_0_24,c_0_18]) ).
cnf(c_0_32,negated_conjecture,
( intersect(esk3_0,esk1_0)
| subset(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,negated_conjecture,
~ intersect(X1,esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_34,plain,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
subset(esk1_0,X1),
inference(sr,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
esk1_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET632+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n027.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 : Sun Jul 10 13:29:33 EDT 2022
% 0.12/0.34 % 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 : 38
% 0.22/1.42 # Proof object clause steps : 25
% 0.22/1.42 # Proof object formula steps : 13
% 0.22/1.42 # Proof object conjectures : 18
% 0.22/1.42 # Proof object clause conjectures : 15
% 0.22/1.42 # Proof object formula conjectures : 3
% 0.22/1.42 # Proof object initial clauses used : 11
% 0.22/1.42 # Proof object initial formulas used : 6
% 0.22/1.42 # Proof object generating inferences : 13
% 0.22/1.42 # Proof object simplifying inferences : 3
% 0.22/1.42 # Training examples: 0 positive, 0 negative
% 0.22/1.42 # Parsed axioms : 9
% 0.22/1.42 # Removed by relevancy pruning/SinE : 1
% 0.22/1.42 # Initial clauses : 18
% 0.22/1.42 # Removed in clause preprocessing : 0
% 0.22/1.42 # Initial clauses in saturation : 18
% 0.22/1.42 # Processed clauses : 52
% 0.22/1.42 # ...of these trivial : 0
% 0.22/1.42 # ...subsumed : 5
% 0.22/1.42 # ...remaining for further processing : 47
% 0.22/1.42 # Other redundant clauses eliminated : 2
% 0.22/1.42 # Clauses deleted for lack of memory : 0
% 0.22/1.42 # Backward-subsumed : 4
% 0.22/1.42 # Backward-rewritten : 4
% 0.22/1.42 # Generated clauses : 81
% 0.22/1.42 # ...of the previous two non-trivial : 68
% 0.22/1.42 # Contextual simplify-reflections : 0
% 0.22/1.42 # Paramodulations : 77
% 0.22/1.42 # Factorizations : 0
% 0.22/1.42 # Equation resolutions : 2
% 0.22/1.42 # Current number of processed clauses : 35
% 0.22/1.42 # Positive orientable unit clauses : 4
% 0.22/1.42 # Positive unorientable unit clauses: 0
% 0.22/1.42 # Negative unit clauses : 6
% 0.22/1.42 # Non-unit-clauses : 25
% 0.22/1.42 # Current number of unprocessed clauses: 20
% 0.22/1.42 # ...number of literals in the above : 42
% 0.22/1.42 # Current number of archived formulas : 0
% 0.22/1.42 # Current number of archived clauses : 10
% 0.22/1.42 # Clause-clause subsumption calls (NU) : 69
% 0.22/1.42 # Rec. Clause-clause subsumption calls : 68
% 0.22/1.42 # Non-unit clause-clause subsumptions : 5
% 0.22/1.42 # Unit Clause-clause subsumption calls : 16
% 0.22/1.42 # Rewrite failures with RHS unbound : 0
% 0.22/1.42 # BW rewrite match attempts : 3
% 0.22/1.42 # BW rewrite match successes : 3
% 0.22/1.42 # Condensation attempts : 0
% 0.22/1.42 # Condensation successes : 0
% 0.22/1.42 # Termbank termtop insertions : 1634
% 0.22/1.42
% 0.22/1.42 # -------------------------------------------------
% 0.22/1.42 # User time : 0.016 s
% 0.22/1.42 # System time : 0.002 s
% 0.22/1.42 # Total time : 0.018 s
% 0.22/1.42 # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------