%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU153+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n012.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 09:17:13 EDT 2022
% Result : Theorem 0.28s 1.46s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 7 unt; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 40 ( 18 ~; 10 |; 11 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 5 sgn 21 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l25_zfmisc_1,conjecture,
! [X1,X2] :
~ ( disjoint(singleton(X1),X2)
& in(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l25_zfmisc_1) ).
fof(t3_xboole_0,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] :
~ ( in(X3,X1)
& in(X3,X2) ) )
& ~ ( ? [X3] :
( in(X3,X1)
& in(X3,X2) )
& disjoint(X1,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_xboole_0) ).
fof(l2_zfmisc_1,lemma,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l2_zfmisc_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',reflexivity_r1_tarski) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] :
~ ( disjoint(singleton(X1),X2)
& in(X1,X2) ),
inference(assume_negation,[status(cth)],[l25_zfmisc_1]) ).
fof(c_0_5,lemma,
! [X4,X5,X4,X5,X7] :
( ( in(esk8_2(X4,X5),X4)
| disjoint(X4,X5) )
& ( in(esk8_2(X4,X5),X5)
| disjoint(X4,X5) )
& ( ~ in(X7,X4)
| ~ in(X7,X5)
| ~ disjoint(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)],[inference(fof_simplification,[status(thm)],[t3_xboole_0])])])])])])])]) ).
fof(c_0_6,negated_conjecture,
( disjoint(singleton(esk1_0),esk2_0)
& in(esk1_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,lemma,
! [X3,X4,X3,X4] :
( ( ~ subset(singleton(X3),X4)
| in(X3,X4) )
& ( ~ in(X3,X4)
| subset(singleton(X3),X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l2_zfmisc_1])])])]) ).
fof(c_0_8,plain,
! [X3] : subset(X3,X3),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_9,lemma,
( ~ disjoint(X1,X2)
| ~ in(X3,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
disjoint(singleton(esk1_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,lemma,
( in(X1,X2)
| ~ subset(singleton(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( ~ in(X1,singleton(esk1_0))
| ~ in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,lemma,
in(X1,singleton(X1)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
in(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SEU153+2 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.15 % Command : run_ET %s %d
% 0.15/0.36 % Computer : n012.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sun Jun 19 15:27:23 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.28/1.46 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.28/1.46 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.28/1.46 # Preprocessing time : 0.021 s
% 0.28/1.46
% 0.28/1.46 # Proof found!
% 0.28/1.46 # SZS status Theorem
% 0.28/1.46 # SZS output start CNFRefutation
% See solution above
% 0.28/1.46 # Proof object total steps : 17
% 0.28/1.46 # Proof object clause steps : 8
% 0.28/1.46 # Proof object formula steps : 9
% 0.28/1.46 # Proof object conjectures : 6
% 0.28/1.46 # Proof object clause conjectures : 3
% 0.28/1.46 # Proof object formula conjectures : 3
% 0.28/1.46 # Proof object initial clauses used : 5
% 0.28/1.46 # Proof object initial formulas used : 4
% 0.28/1.46 # Proof object generating inferences : 3
% 0.28/1.46 # Proof object simplifying inferences : 2
% 0.28/1.46 # Training examples: 0 positive, 0 negative
% 0.28/1.46 # Parsed axioms : 76
% 0.28/1.46 # Removed by relevancy pruning/SinE : 27
% 0.28/1.46 # Initial clauses : 84
% 0.28/1.46 # Removed in clause preprocessing : 1
% 0.28/1.46 # Initial clauses in saturation : 83
% 0.28/1.46 # Processed clauses : 95
% 0.28/1.46 # ...of these trivial : 3
% 0.28/1.46 # ...subsumed : 6
% 0.28/1.46 # ...remaining for further processing : 86
% 0.28/1.46 # Other redundant clauses eliminated : 20
% 0.28/1.46 # Clauses deleted for lack of memory : 0
% 0.28/1.46 # Backward-subsumed : 0
% 0.28/1.46 # Backward-rewritten : 0
% 0.28/1.46 # Generated clauses : 472
% 0.28/1.46 # ...of the previous two non-trivial : 362
% 0.28/1.46 # Contextual simplify-reflections : 0
% 0.28/1.46 # Paramodulations : 430
% 0.28/1.46 # Factorizations : 14
% 0.28/1.46 # Equation resolutions : 28
% 0.28/1.46 # Current number of processed clauses : 83
% 0.28/1.46 # Positive orientable unit clauses : 17
% 0.28/1.46 # Positive unorientable unit clauses: 2
% 0.28/1.46 # Negative unit clauses : 4
% 0.28/1.46 # Non-unit-clauses : 60
% 0.28/1.46 # Current number of unprocessed clauses: 350
% 0.28/1.46 # ...number of literals in the above : 919
% 0.28/1.46 # Current number of archived formulas : 0
% 0.28/1.46 # Current number of archived clauses : 1
% 0.28/1.46 # Clause-clause subsumption calls (NU) : 553
% 0.28/1.46 # Rec. Clause-clause subsumption calls : 435
% 0.28/1.46 # Non-unit clause-clause subsumptions : 4
% 0.28/1.46 # Unit Clause-clause subsumption calls : 188
% 0.28/1.46 # Rewrite failures with RHS unbound : 0
% 0.28/1.46 # BW rewrite match attempts : 11
% 0.28/1.46 # BW rewrite match successes : 8
% 0.28/1.46 # Condensation attempts : 0
% 0.28/1.46 # Condensation successes : 0
% 0.28/1.46 # Termbank termtop insertions : 8448
% 0.28/1.46
% 0.28/1.46 # -------------------------------------------------
% 0.28/1.46 # User time : 0.026 s
% 0.28/1.46 # System time : 0.004 s
% 0.28/1.46 # Total time : 0.030 s
% 0.28/1.46 # Maximum resident set size: 3404 pages
%------------------------------------------------------------------------------