%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU114+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:23:50 PM UTC 2026
% Result : Theorem 0.11s 0.47s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 40 ( 10 unt; 0 def)
% Number of atoms : 122 ( 17 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 133 ( 51 ~; 57 |; 13 &)
% ( 5 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 68 ( 1 sgn 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d5_finsub_1,axiom,
! [X1,X2] :
( preboolean(X2)
=> ( X2 = finite_subsets(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( finite(X3)
& subset(X3,X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_finsub_1) ).
fof(dt_k5_finsub_1,axiom,
! [X1] : preboolean(finite_subsets(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k5_finsub_1) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).
fof(t1_subset,axiom,
! [X1,X2] :
( in(X1,X2)
=> element(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_subset) ).
fof(cc2_finset_1,axiom,
! [X1] :
( finite(X1)
=> ! [X2] :
( element(X2,powerset(X1))
=> finite(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc2_finset_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(t27_finsub_1,conjecture,
! [X1] :
( finite(X1)
=> finite_subsets(X1) = powerset(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t27_finsub_1) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X2,X1)
& subset(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(t26_finsub_1,axiom,
! [X1] : subset(finite_subsets(X1),powerset(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t26_finsub_1) ).
fof(c_0_9,plain,
! [X21,X22,X23,X24] :
( ( ~ preboolean(X22)
| X22 = finite_subsets(X21)
| in(esk2_2(X21,X22),X22)
| finite(esk2_2(X21,X22)) )
& ( ~ preboolean(X22)
| X22 = finite_subsets(X21)
| in(esk2_2(X21,X22),X22)
| subset(esk2_2(X21,X22),X21) )
& ( ~ preboolean(X22)
| X22 = finite_subsets(X21)
| ~ finite(esk2_2(X21,X22))
| ~ subset(esk2_2(X21,X22),X21)
| ~ in(esk2_2(X21,X22),X22) )
& ( ~ preboolean(X22)
| X22 != finite_subsets(X21)
| in(X24,X22)
| ~ finite(X24)
| ~ subset(X24,X21) )
& ( ~ preboolean(X22)
| X22 != finite_subsets(X21)
| ~ in(X23,X22)
| finite(X23) )
& ( ~ preboolean(X22)
| X22 != finite_subsets(X21)
| ~ in(X23,X22)
| subset(X23,X21) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_finsub_1])])])])])])]) ).
fof(c_0_10,plain,
! [X26] : preboolean(finite_subsets(X26)),
inference(variable_rename,[status(thm)],[dt_k5_finsub_1]) ).
fof(c_0_11,plain,
! [X55,X56] :
( ( element(X55,powerset(X56))
| ~ subset(X55,X56) )
& ( subset(X55,X56)
| ~ element(X55,powerset(X56)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])]) ).
fof(c_0_12,plain,
! [X49,X50] :
( element(X49,X50)
| ~ in(X49,X50) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])]) ).
fof(c_0_13,plain,
! [X8,X9] :
( finite(X9)
| ~ element(X9,powerset(X8))
| ~ finite(X8) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_finset_1])])])]) ).
fof(c_0_14,plain,
! [X15,X16,X17,X18,X19] :
( ( subset(X18,X19)
| ~ in(esk1_2(X18,X19),X19) )
& ( subset(X18,X19)
| in(esk1_2(X18,X19),X18) )
& ( in(X17,X16)
| ~ in(X17,X15)
| ~ subset(X15,X16) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])])]) ).
cnf(c_0_15,plain,
( ~ preboolean(X3)
| X3 != finite_subsets(X2)
| ~ finite(X1)
| ~ subset(X1,X2)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
preboolean(finite_subsets(X1)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( ~ element(X1,powerset(X2))
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ~ in(X1,X2)
| element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( ~ element(X2,powerset(X1))
| ~ finite(X1)
| finite(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,negated_conjecture,
~ ! [X1] :
( finite(X1)
=> finite_subsets(X1) = powerset(X1) ),
inference(assume_negation,[status(cth)],[t27_finsub_1]) ).
cnf(c_0_21,plain,
( ~ in(esk1_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( ~ finite(X1)
| ~ subset(X1,X2)
| in(X1,finite_subsets(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_15]),c_0_16])]) ).
cnf(c_0_23,plain,
( ~ in(X1,powerset(X2))
| subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_25,plain,
( ~ in(X1,powerset(X2))
| ~ finite(X2)
| finite(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
fof(c_0_26,negated_conjecture,
( finite_subsets(esk13_0) != powerset(esk13_0)
& finite(esk13_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
cnf(c_0_27,plain,
( ~ finite(esk1_2(X1,finite_subsets(X2)))
| ~ subset(esk1_2(X1,finite_subsets(X2)),X2)
| subset(X1,finite_subsets(X2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( subset(powerset(X1),X2)
| subset(esk1_2(powerset(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( ~ finite(X1)
| finite(esk1_2(powerset(X1),X2))
| subset(powerset(X1),X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
finite(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_31,plain,
! [X13,X14] :
( ( X13 = X14
| ~ subset(X14,X13)
| ~ subset(X13,X14) )
& ( X13 != X14
| subset(X14,X13) )
& ( X13 != X14
| subset(X13,X14) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])])]) ).
cnf(c_0_32,plain,
( ~ finite(esk1_2(powerset(X1),finite_subsets(X1)))
| subset(powerset(X1),finite_subsets(X1)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( finite(esk1_2(powerset(esk13_0),X1))
| subset(powerset(esk13_0),X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
fof(c_0_34,plain,
! [X51] : subset(finite_subsets(X51),powerset(X51)),
inference(variable_rename,[status(thm)],[t26_finsub_1]) ).
cnf(c_0_35,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,negated_conjecture,
subset(powerset(esk13_0),finite_subsets(esk13_0)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
subset(finite_subsets(X1),powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_38,negated_conjecture,
finite_subsets(esk13_0) != powerset(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU114+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n007.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 05:49:05 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.47 % Version: 3.5.1
% 0.11/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.47 % Starting sh5l with 300s (1) cores
% 0.11/0.47 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 311781 completed with status 0
% 0.11/0.47 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.47 % No SInE strategy applied
% 0.11/0.47 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.11/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.47 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.11/0.47 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.11/0.47 % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.11/0.47 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 311788 completed with status 0
% 0.11/0.47 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.47 % No SInE strategy applied
% 0.11/0.47 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.11/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.47 % Preprocessing time : 0.002 s
% 0.11/0.47 % Presaturation interreduction done
% 0.11/0.47
% 0.11/0.47 % Proof found!
% 0.11/0.47 % SZS status Theorem
% 0.11/0.47 % SZS output start CNFRefutation
% See solution above
% 0.11/0.47 % Parsed axioms : 36
% 0.11/0.47 % Removed by relevancy pruning/SinE : 0
% 0.11/0.47 % Initial clauses : 74
% 0.11/0.47 % Removed in clause preprocessing : 0
% 0.11/0.47 % Initial clauses in saturation : 74
% 0.11/0.47 % Processed clauses : 577
% 0.11/0.47 % ...of these trivial : 5
% 0.11/0.47 % ...subsumed : 247
% 0.11/0.47 % ...remaining for further processing : 325
% 0.11/0.47 % Other redundant clauses eliminated : 5
% 0.11/0.47 % Clauses deleted for lack of memory : 0
% 0.11/0.47 % Backward-subsumed : 9
% 0.11/0.47 % Backward-rewritten : 5
% 0.11/0.47 % Generated clauses : 1021
% 0.11/0.47 % ...of the previous two non-redundant : 824
% 0.11/0.47 % ...aggressively subsumed : 0
% 0.11/0.47 % Contextual simplify-reflections : 10
% 0.11/0.47 % Paramodulations : 1016
% 0.11/0.47 % Factorizations : 0
% 0.11/0.47 % NegExts : 0
% 0.11/0.47 % Equation resolutions : 5
% 0.11/0.47 % Disequality decompositions : 0
% 0.11/0.47 % Total rewrite steps : 240
% 0.11/0.47 % ...of those cached : 197
% 0.11/0.47 % Propositional unsat checks : 0
% 0.11/0.47 % Propositional check models : 0
% 0.11/0.47 % Propositional check unsatisfiable : 0
% 0.11/0.47 % Propositional clauses : 0
% 0.11/0.47 % Propositional clauses after purity: 0
% 0.11/0.47 % Propositional unsat core size : 0
% 0.11/0.47 % Propositional preprocessing time : 0.000
% 0.11/0.47 % Propositional encoding time : 0.000
% 0.11/0.47 % Propositional solver time : 0.000
% 0.11/0.47 % Success case prop preproc time : 0.000
% 0.11/0.47 % Success case prop encoding time : 0.000
% 0.11/0.47 % Success case prop solver time : 0.000
% 0.11/0.47 % Current number of processed clauses : 236
% 0.11/0.47 % Positive orientable unit clauses : 44
% 0.11/0.47 % Positive unorientable unit clauses: 0
% 0.11/0.47 % Negative unit clauses : 9
% 0.11/0.47 % Non-unit-clauses : 183
% 0.11/0.47 % Current number of unprocessed clauses: 366
% 0.11/0.47 % ...number of literals in the above : 1057
% 0.11/0.47 % Current number of archived formulas : 0
% 0.11/0.47 % Current number of archived clauses : 84
% 0.11/0.47 % Clause-clause subsumption calls (NU) : 2666
% 0.11/0.47 % Rec. Clause-clause subsumption calls : 2216
% 0.11/0.47 % Non-unit clause-clause subsumptions : 183
% 0.11/0.47 % Unit Clause-clause subsumption calls : 186
% 0.11/0.47 % Rewrite failures with RHS unbound : 0
% 0.11/0.47 % BW rewrite match attempts : 5
% 0.11/0.47 % BW rewrite match successes : 5
% 0.11/0.47 % Condensation attempts : 0
% 0.11/0.47 % Condensation successes : 0
% 0.11/0.47 % Termbank termtop insertions : 15862
% 0.11/0.47 % Search garbage collected termcells : 676
% 0.11/0.47
% 0.11/0.47 % -------------------------------------------------
% 0.11/0.47 % User time : 0.033 s
% 0.11/0.47 % System time : 0.007 s
% 0.11/0.47 % Total time : 0.039 s
% 0.11/0.47 % Maximum resident set size: 3664 pages
% 0.11/0.47
% 0.11/0.47 % -------------------------------------------------
% 0.11/0.47 % User time : 0.112 s
% 0.11/0.47 % System time : 0.025 s
% 0.11/0.47 % Total time : 0.137 s
% 0.11/0.47 % Maximum resident set size: 4864 pages
% 0.11/0.47 % E exiting
%------------------------------------------------------------------------------