%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU113+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n028.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:16:52 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 28 ( 9 unt; 0 def)
% Number of atoms : 95 ( 10 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 107 ( 40 ~; 45 |; 15 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 56 ( 10 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_tarski) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_subset) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_subset) ).
fof(fc1_finsub_1,axiom,
! [X1] :
( ~ empty(powerset(X1))
& cup_closed(powerset(X1))
& diff_closed(powerset(X1))
& preboolean(powerset(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc1_finsub_1) ).
fof(d5_finsub_1,axiom,
! [X1,X2] :
( preboolean(X2)
=> ( X2 = finite_subsets(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( subset(X3,X1)
& finite(X3) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d5_finsub_1) ).
fof(t26_finsub_1,conjecture,
! [X1] : subset(finite_subsets(X1),powerset(X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t26_finsub_1) ).
fof(dt_k5_finsub_1,axiom,
! [X1] : preboolean(finite_subsets(X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k5_finsub_1) ).
fof(c_0_7,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk1_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk1_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)],[d3_tarski])])])])])])]) ).
fof(c_0_8,plain,
! [X3,X4] :
( ~ element(X3,X4)
| empty(X4)
| in(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
cnf(c_0_9,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X3,X4,X3,X4] :
( ( ~ element(X3,powerset(X4))
| subset(X3,X4) )
& ( ~ subset(X3,X4)
| element(X3,powerset(X4)) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])])]) ).
fof(c_0_12,plain,
! [X2,X2,X2,X2] :
( ~ empty(powerset(X2))
& cup_closed(powerset(X2))
& diff_closed(powerset(X2))
& preboolean(powerset(X2)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[fc1_finsub_1])])])]) ).
fof(c_0_13,plain,
! [X4,X5,X6,X6] :
( ( subset(X6,X4)
| ~ in(X6,X5)
| X5 != finite_subsets(X4)
| ~ preboolean(X5) )
& ( finite(X6)
| ~ in(X6,X5)
| X5 != finite_subsets(X4)
| ~ preboolean(X5) )
& ( ~ subset(X6,X4)
| ~ finite(X6)
| in(X6,X5)
| X5 != finite_subsets(X4)
| ~ preboolean(X5) )
& ( ~ in(esk2_2(X4,X5),X5)
| ~ subset(esk2_2(X4,X5),X4)
| ~ finite(esk2_2(X4,X5))
| X5 = finite_subsets(X4)
| ~ preboolean(X5) )
& ( subset(esk2_2(X4,X5),X4)
| in(esk2_2(X4,X5),X5)
| X5 = finite_subsets(X4)
| ~ preboolean(X5) )
& ( finite(esk2_2(X4,X5))
| in(esk2_2(X4,X5),X5)
| X5 = finite_subsets(X4)
| ~ preboolean(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)],[d5_finsub_1])])])])])])]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] : subset(finite_subsets(X1),powerset(X1)),
inference(assume_negation,[status(cth)],[t26_finsub_1]) ).
cnf(c_0_15,plain,
( subset(X1,X2)
| empty(X2)
| ~ element(esk1_2(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
~ empty(powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( subset(X3,X2)
| ~ preboolean(X1)
| X1 != finite_subsets(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_20,negated_conjecture,
~ subset(finite_subsets(esk13_0),powerset(esk13_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
cnf(c_0_21,plain,
( subset(X1,powerset(X2))
| ~ subset(esk1_2(X1,powerset(X2)),X2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_22,plain,
( subset(esk1_2(X1,X2),X3)
| subset(X1,X2)
| X1 != finite_subsets(X3)
| ~ preboolean(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_23,plain,
! [X2] : preboolean(finite_subsets(X2)),
inference(variable_rename,[status(thm)],[dt_k5_finsub_1]) ).
cnf(c_0_24,negated_conjecture,
~ subset(finite_subsets(esk13_0),powerset(esk13_0)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
( subset(X1,powerset(X2))
| X1 != finite_subsets(X2)
| ~ preboolean(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
preboolean(finite_subsets(X1)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU113+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 19 04:16:00 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.23/1.41 # Preprocessing time : 0.016 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 28
% 0.23/1.41 # Proof object clause steps : 13
% 0.23/1.41 # Proof object formula steps : 15
% 0.23/1.41 # Proof object conjectures : 5
% 0.23/1.41 # Proof object clause conjectures : 2
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 8
% 0.23/1.41 # Proof object initial formulas used : 7
% 0.23/1.41 # Proof object generating inferences : 5
% 0.23/1.41 # Proof object simplifying inferences : 3
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 33
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 68
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 68
% 0.23/1.41 # Processed clauses : 161
% 0.23/1.41 # ...of these trivial : 3
% 0.23/1.41 # ...subsumed : 19
% 0.23/1.41 # ...remaining for further processing : 139
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 20
% 0.23/1.41 # Generated clauses : 267
% 0.23/1.41 # ...of the previous two non-trivial : 242
% 0.23/1.41 # Contextual simplify-reflections : 9
% 0.23/1.41 # Paramodulations : 260
% 0.23/1.41 # Factorizations : 2
% 0.23/1.41 # Equation resolutions : 2
% 0.23/1.41 # Current number of processed clauses : 118
% 0.23/1.41 # Positive orientable unit clauses : 30
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 9
% 0.23/1.41 # Non-unit-clauses : 79
% 0.23/1.41 # Current number of unprocessed clauses: 131
% 0.23/1.41 # ...number of literals in the above : 488
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 20
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 625
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 372
% 0.23/1.41 # Non-unit clause-clause subsumptions : 24
% 0.23/1.41 # Unit Clause-clause subsumption calls : 124
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 6
% 0.23/1.41 # BW rewrite match successes : 6
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 6103
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.024 s
% 0.23/1.41 # System time : 0.001 s
% 0.23/1.41 # Total time : 0.025 s
% 0.23/1.41 # Maximum resident set size: 3220 pages
%------------------------------------------------------------------------------