%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET691+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n010.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:53:11 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 8 unt; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 47 ( 20 ~; 16 |; 6 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 26 ( 6 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thI16,conjecture,
! [X1] :
( subset(X1,empty_set)
<=> equal_set(X1,empty_set) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thI16) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',equal_set) ).
fof(empty_set,axiom,
! [X3] : ~ member(X3,empty_set),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',empty_set) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( subset(X1,empty_set)
<=> equal_set(X1,empty_set) ),
inference(assume_negation,[status(cth)],[thI16]) ).
fof(c_0_5,plain,
! [X3,X4,X3,X4] :
( ( subset(X3,X4)
| ~ equal_set(X3,X4) )
& ( subset(X4,X3)
| ~ equal_set(X3,X4) )
& ( ~ subset(X3,X4)
| ~ subset(X4,X3)
| equal_set(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_set])])])])]) ).
fof(c_0_6,negated_conjecture,
( ( ~ subset(esk1_0,empty_set)
| ~ equal_set(esk1_0,empty_set) )
& ( subset(esk1_0,empty_set)
| equal_set(esk1_0,empty_set) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_7,plain,
( subset(X1,X2)
| ~ equal_set(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( equal_set(esk1_0,empty_set)
| subset(esk1_0,empty_set) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( ~ equal_set(esk1_0,empty_set)
| ~ subset(esk1_0,empty_set) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
subset(esk1_0,empty_set),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
fof(c_0_11,plain,
! [X4] : ~ member(X4,empty_set),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[empty_set])]) ).
fof(c_0_12,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk2_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ member(esk2_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])])])])])])]) ).
cnf(c_0_13,negated_conjecture,
~ equal_set(esk1_0,empty_set),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
cnf(c_0_14,plain,
( equal_set(X1,X2)
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( subset(X1,X2)
| member(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
~ subset(empty_set,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_10])]) ).
cnf(c_0_18,plain,
subset(empty_set,X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET691+4 : TPTP v8.1.0. Released v2.2.0.
% 0.10/0.12 % Command : run_ET %s %d
% 0.11/0.32 % Computer : n010.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sun Jul 10 06:20:45 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40 # Preprocessing time : 0.013 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 20
% 0.21/1.40 # Proof object clause steps : 11
% 0.21/1.40 # Proof object formula steps : 9
% 0.21/1.40 # Proof object conjectures : 9
% 0.21/1.40 # Proof object clause conjectures : 6
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 6
% 0.21/1.40 # Proof object initial formulas used : 4
% 0.21/1.40 # Proof object generating inferences : 3
% 0.21/1.40 # Proof object simplifying inferences : 6
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 12
% 0.21/1.40 # Removed by relevancy pruning/SinE : 8
% 0.21/1.40 # Initial clauses : 9
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 9
% 0.21/1.40 # Processed clauses : 15
% 0.21/1.40 # ...of these trivial : 0
% 0.21/1.40 # ...subsumed : 0
% 0.21/1.40 # ...remaining for further processing : 15
% 0.21/1.40 # Other redundant clauses eliminated : 0
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 0
% 0.21/1.40 # Backward-rewritten : 3
% 0.21/1.40 # Generated clauses : 13
% 0.21/1.40 # ...of the previous two non-trivial : 9
% 0.21/1.40 # Contextual simplify-reflections : 0
% 0.21/1.40 # Paramodulations : 13
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 0
% 0.21/1.40 # Current number of processed clauses : 12
% 0.21/1.40 # Positive orientable unit clauses : 3
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 3
% 0.21/1.40 # Non-unit-clauses : 6
% 0.21/1.40 # Current number of unprocessed clauses: 1
% 0.21/1.40 # ...number of literals in the above : 1
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 3
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 3
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 3
% 0.21/1.40 # Non-unit clause-clause subsumptions : 0
% 0.21/1.40 # Unit Clause-clause subsumption calls : 5
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 6
% 0.21/1.40 # BW rewrite match successes : 2
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 670
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.013 s
% 0.21/1.40 # System time : 0.001 s
% 0.21/1.40 # Total time : 0.014 s
% 0.21/1.40 # Maximum resident set size: 2816 pages
%------------------------------------------------------------------------------