%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU146+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n008.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:08 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 8 unt; 0 def)
% Number of atoms : 87 ( 29 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 83 ( 30 ~; 39 |; 7 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 54 ( 8 sgn 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l3_zfmisc_1,axiom,
! [X1,X2,X3] :
( subset(X1,X2)
=> ( in(X3,X1)
| subset(X1,set_difference(X2,singleton(X3))) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l3_zfmisc_1) ).
fof(t37_xboole_1,axiom,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t37_xboole_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',reflexivity_r1_tarski) ).
fof(l4_zfmisc_1,conjecture,
! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l4_zfmisc_1) ).
fof(l2_zfmisc_1,axiom,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l2_zfmisc_1) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d10_xboole_0) ).
fof(t3_xboole_1,axiom,
! [X1] :
( subset(X1,empty_set)
=> X1 = empty_set ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_xboole_1) ).
fof(t2_xboole_1,axiom,
! [X1] : subset(empty_set,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_xboole_1) ).
fof(c_0_8,plain,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| in(X6,X4)
| subset(X4,set_difference(X5,singleton(X6))) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l3_zfmisc_1])])])]) ).
fof(c_0_9,plain,
! [X3,X4,X3,X4] :
( ( set_difference(X3,X4) != empty_set
| subset(X3,X4) )
& ( ~ subset(X3,X4)
| set_difference(X3,X4) = empty_set ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t37_xboole_1])])])]) ).
cnf(c_0_10,plain,
( subset(X1,set_difference(X2,singleton(X3)))
| in(X3,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X3] : subset(X3,X3),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
inference(assume_negation,[status(cth)],[l4_zfmisc_1]) ).
fof(c_0_14,plain,
! [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])])])]) ).
cnf(c_0_15,plain,
( subset(X1,empty_set)
| in(X2,X1)
| ~ subset(X3,singleton(X2))
| ~ subset(X1,X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,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)],[d10_xboole_0])])])])]) ).
fof(c_0_18,negated_conjecture,
( ( esk1_0 != empty_set
| ~ subset(esk1_0,singleton(esk2_0)) )
& ( esk1_0 != singleton(esk2_0)
| ~ subset(esk1_0,singleton(esk2_0)) )
& ( subset(esk1_0,singleton(esk2_0))
| esk1_0 = empty_set
| esk1_0 = singleton(esk2_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
cnf(c_0_19,plain,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( subset(X1,empty_set)
| in(X2,X1)
| ~ subset(X1,singleton(X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_21,plain,
! [X2] :
( ~ subset(X2,empty_set)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_xboole_1])]) ).
cnf(c_0_22,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
( esk1_0 = singleton(esk2_0)
| esk1_0 = empty_set
| subset(esk1_0,singleton(esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( subset(singleton(X1),X2)
| subset(X2,empty_set)
| ~ subset(X2,singleton(X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( singleton(esk2_0) = esk1_0
| esk1_0 = empty_set
| ~ subset(singleton(esk2_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( ~ subset(esk1_0,singleton(esk2_0))
| esk1_0 != singleton(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,negated_conjecture,
( singleton(esk2_0) = esk1_0
| esk1_0 = empty_set ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_23]),c_0_25]),c_0_26]) ).
fof(c_0_29,plain,
! [X2] : subset(empty_set,X2),
inference(variable_rename,[status(thm)],[t2_xboole_1]) ).
cnf(c_0_30,negated_conjecture,
( ~ subset(esk1_0,singleton(esk2_0))
| esk1_0 != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_31,negated_conjecture,
esk1_0 = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_16])]) ).
cnf(c_0_32,plain,
subset(empty_set,X1),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_31]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU146+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n008.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 : Sat Jun 18 22:49:37 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.015 s
% 0.24/1.42
% 0.24/1.42 # Failure: Out of unprocessed clauses!
% 0.24/1.42 # OLD status GaveUp
% 0.24/1.42 # Parsed axioms : 15
% 0.24/1.42 # Removed by relevancy pruning/SinE : 8
% 0.24/1.42 # Initial clauses : 12
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 12
% 0.24/1.42 # Processed clauses : 17
% 0.24/1.42 # ...of these trivial : 0
% 0.24/1.42 # ...subsumed : 1
% 0.24/1.42 # ...remaining for further processing : 16
% 0.24/1.42 # Other redundant clauses eliminated : 2
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 0
% 0.24/1.42 # Generated clauses : 10
% 0.24/1.42 # ...of the previous two non-trivial : 5
% 0.24/1.42 # Contextual simplify-reflections : 0
% 0.24/1.42 # Paramodulations : 8
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 2
% 0.24/1.42 # Current number of processed clauses : 14
% 0.24/1.42 # Positive orientable unit clauses : 2
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 1
% 0.24/1.42 # Non-unit-clauses : 11
% 0.24/1.42 # Current number of unprocessed clauses: 0
% 0.24/1.42 # ...number of literals in the above : 0
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 0
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 6
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 5
% 0.24/1.42 # Non-unit clause-clause subsumptions : 1
% 0.24/1.42 # Unit Clause-clause subsumption calls : 3
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 1
% 0.24/1.42 # BW rewrite match successes : 0
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 690
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.012 s
% 0.24/1.42 # System time : 0.003 s
% 0.24/1.42 # Total time : 0.015 s
% 0.24/1.42 # Maximum resident set size: 2772 pages
% 0.24/1.42 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.24/1.42 # Preprocessing time : 0.014 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 34
% 0.24/1.42 # Proof object clause steps : 17
% 0.24/1.42 # Proof object formula steps : 17
% 0.24/1.42 # Proof object conjectures : 10
% 0.24/1.42 # Proof object clause conjectures : 7
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 10
% 0.24/1.42 # Proof object initial formulas used : 8
% 0.24/1.42 # Proof object generating inferences : 6
% 0.24/1.42 # Proof object simplifying inferences : 8
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 15
% 0.24/1.42 # Removed by relevancy pruning/SinE : 0
% 0.24/1.42 # Initial clauses : 21
% 0.24/1.42 # Removed in clause preprocessing : 3
% 0.24/1.42 # Initial clauses in saturation : 18
% 0.24/1.42 # Processed clauses : 39
% 0.24/1.42 # ...of these trivial : 0
% 0.24/1.42 # ...subsumed : 2
% 0.24/1.42 # ...remaining for further processing : 37
% 0.24/1.42 # Other redundant clauses eliminated : 2
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 6
% 0.24/1.42 # Backward-rewritten : 4
% 0.24/1.42 # Generated clauses : 61
% 0.24/1.42 # ...of the previous two non-trivial : 50
% 0.24/1.42 # Contextual simplify-reflections : 2
% 0.24/1.42 # Paramodulations : 59
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 2
% 0.24/1.42 # Current number of processed clauses : 25
% 0.24/1.42 # Positive orientable unit clauses : 5
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 2
% 0.24/1.42 # Non-unit-clauses : 18
% 0.24/1.42 # Current number of unprocessed clauses: 9
% 0.24/1.42 # ...number of literals in the above : 30
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 10
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 113
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 72
% 0.24/1.42 # Non-unit clause-clause subsumptions : 10
% 0.24/1.42 # Unit Clause-clause subsumption calls : 4
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 4
% 0.24/1.42 # BW rewrite match successes : 1
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 1653
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.015 s
% 0.24/1.42 # System time : 0.002 s
% 0.24/1.42 # Total time : 0.017 s
% 0.24/1.42 # Maximum resident set size: 2780 pages
%------------------------------------------------------------------------------