%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET581+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:07 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 8 unt; 0 def)
% Number of atoms : 40 ( 5 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 39 ( 17 ~; 10 |; 8 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 30 ( 6 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_th24,conjecture,
! [X1,X2,X3] :
( ( member(X1,X2)
& member(X1,X3) )
=> not_equal(intersection(X2,X3),empty_set) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_th24) ).
fof(not_equal_defn,axiom,
! [X1,X2] :
( not_equal(X1,X2)
<=> X1 != X2 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',not_equal_defn) ).
fof(intersection_defn,axiom,
! [X1,X2,X3] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',intersection_defn) ).
fof(empty_set_defn,axiom,
! [X1] : ~ member(X1,empty_set),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',empty_set_defn) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( ( member(X1,X2)
& member(X1,X3) )
=> not_equal(intersection(X2,X3),empty_set) ),
inference(assume_negation,[status(cth)],[prove_th24]) ).
fof(c_0_5,negated_conjecture,
( member(esk1_0,esk2_0)
& member(esk1_0,esk3_0)
& ~ not_equal(intersection(esk2_0,esk3_0),empty_set) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,plain,
! [X3,X4,X3,X4] :
( ( ~ not_equal(X3,X4)
| X3 != X4 )
& ( X3 = X4
| not_equal(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[not_equal_defn])])])]) ).
fof(c_0_7,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_8,negated_conjecture,
~ not_equal(intersection(esk2_0,esk3_0),empty_set),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( not_equal(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X2] : ~ member(X2,empty_set),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[empty_set_defn])]) ).
cnf(c_0_11,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
intersection(esk2_0,esk3_0) = empty_set,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( ~ member(X1,esk3_0)
| ~ member(X1,esk2_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_15,negated_conjecture,
member(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
member(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET581+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n027.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 : Sat Jul 9 17:24:02 EDT 2022
% 0.13/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.015 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 : 18
% 0.23/1.42 # Proof object clause steps : 9
% 0.23/1.42 # Proof object formula steps : 9
% 0.23/1.42 # Proof object conjectures : 9
% 0.23/1.42 # Proof object clause conjectures : 6
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 6
% 0.23/1.42 # Proof object initial formulas used : 4
% 0.23/1.42 # Proof object generating inferences : 3
% 0.23/1.42 # Proof object simplifying inferences : 3
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 7
% 0.23/1.42 # Removed by relevancy pruning/SinE : 1
% 0.23/1.42 # Initial clauses : 14
% 0.23/1.42 # Removed in clause preprocessing : 2
% 0.23/1.42 # Initial clauses in saturation : 12
% 0.23/1.42 # Processed clauses : 21
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 4
% 0.23/1.42 # ...remaining for further processing : 17
% 0.23/1.42 # Other redundant clauses eliminated : 1
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 0
% 0.23/1.42 # Backward-rewritten : 1
% 0.23/1.42 # Generated clauses : 33
% 0.23/1.42 # ...of the previous two non-trivial : 28
% 0.23/1.42 # Contextual simplify-reflections : 0
% 0.23/1.42 # Paramodulations : 30
% 0.23/1.42 # Factorizations : 2
% 0.23/1.42 # Equation resolutions : 1
% 0.23/1.42 # Current number of processed clauses : 15
% 0.23/1.42 # Positive orientable unit clauses : 3
% 0.23/1.42 # Positive unorientable unit clauses: 1
% 0.23/1.42 # Negative unit clauses : 2
% 0.23/1.42 # Non-unit-clauses : 9
% 0.23/1.42 # Current number of unprocessed clauses: 19
% 0.23/1.42 # ...number of literals in the above : 48
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 1
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 5
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 5
% 0.23/1.42 # Non-unit clause-clause subsumptions : 1
% 0.23/1.42 # Unit Clause-clause subsumption calls : 1
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 3
% 0.23/1.42 # BW rewrite match successes : 3
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 972
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.014 s
% 0.23/1.42 # System time : 0.002 s
% 0.23/1.42 # Total time : 0.016 s
% 0.23/1.42 # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------