%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU169+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:24:06 PM UTC 2026
% Result : Theorem 0.13s 0.42s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 10 unt; 0 def)
% Number of atoms : 81 ( 6 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 87 ( 31 ~; 28 |; 12 &)
% ( 7 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 1 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d2_subset_1,axiom,
! [X1,X2] :
( ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) )
& ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_subset_1) ).
fof(l3_subset_1,conjecture,
! [X1,X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( in(X3,X2)
=> in(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l3_subset_1) ).
fof(fc1_subset_1,axiom,
! [X1] : ~ empty(powerset(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_subset_1) ).
fof(d1_zfmisc_1,axiom,
! [X1,X2] :
( X2 = powerset(X1)
<=> ! [X3] :
( in(X3,X2)
<=> subset(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_zfmisc_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(c_0_5,plain,
! [X1,X2] :
( ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) )
& ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[d2_subset_1]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( in(X3,X2)
=> in(X3,X1) ) ),
inference(assume_negation,[status(cth)],[l3_subset_1]) ).
fof(c_0_7,plain,
! [X1] : ~ empty(powerset(X1)),
inference(fof_simplification,[status(thm)],[fc1_subset_1]) ).
fof(c_0_8,plain,
! [X6,X7,X8,X9,X10,X11] :
( ( X11 = powerset(X10)
| subset(esk1_2(X10,X11),X10)
| in(esk1_2(X10,X11),X11) )
& ( X11 = powerset(X10)
| ~ subset(esk1_2(X10,X11),X10)
| ~ in(esk1_2(X10,X11),X11) )
& ( X7 != powerset(X6)
| in(X9,X7)
| ~ subset(X9,X6) )
& ( X7 != powerset(X6)
| subset(X8,X6)
| ~ in(X8,X7) ) ),
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)],[d1_zfmisc_1])])])])])])]) ).
fof(c_0_9,plain,
! [X13,X14] :
( ( ~ empty(X13)
| element(X14,X13)
| ~ empty(X14) )
& ( ~ empty(X13)
| empty(X14)
| ~ element(X14,X13) )
& ( empty(X13)
| element(X14,X13)
| ~ in(X14,X13) )
& ( empty(X13)
| in(X14,X13)
| ~ element(X14,X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_10,negated_conjecture,
( ~ in(esk6_0,esk4_0)
& in(esk6_0,esk5_0)
& element(esk5_0,powerset(esk4_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_11,plain,
! [X23] : ~ empty(powerset(X23)),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_7])]) ).
cnf(c_0_12,plain,
( X2 != powerset(X3)
| ~ in(X1,X2)
| subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ element(X1,X2)
| empty(X2)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
element(esk5_0,powerset(esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
~ empty(powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X15,X16,X17,X18,X19] :
( ( subset(X18,X19)
| ~ in(esk2_2(X18,X19),X19) )
& ( subset(X18,X19)
| in(esk2_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_17,plain,
( ~ in(X1,powerset(X2))
| subset(X1,X2) ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
in(esk5_0,powerset(esk4_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_19,plain,
( ~ in(X3,X1)
| ~ subset(X1,X2)
| in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
subset(esk5_0,esk4_0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
~ in(esk6_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,negated_conjecture,
( ~ in(X1,esk5_0)
| in(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
in(esk6_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU169+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n020.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 05:55:32 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.13/0.42 % Version: 3.5.1
% 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 % Starting sh5l with 300s (1) cores
% 0.13/0.42 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2151331 completed with status 0
% 0.13/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.42 % No SInE strategy applied
% 0.13/0.42 % Search class: FGHSS-FFSS21-SFFFFFNN
% 0.13/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.42 % SubtermCWHack with pid 2151335 completed with status 0
% 0.13/0.42 % Result found by SubtermCWHack
% 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.42 % No SInE strategy applied
% 0.13/0.42 % Search class: FGHSS-FFSS21-SFFFFFNN
% 0.13/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.42 % Preprocessing time : 0.001 s
% 0.13/0.42
% 0.13/0.42 % Proof found!
% 0.13/0.42 % SZS status Theorem
% 0.13/0.42 % SZS output start CNFRefutation
% See solution above
% 0.13/0.42 % Parsed axioms : 18
% 0.13/0.42 % Removed by relevancy pruning/SinE : 0
% 0.13/0.42 % Initial clauses : 29
% 0.13/0.42 % Removed in clause preprocessing : 3
% 0.13/0.42 % Initial clauses in saturation : 26
% 0.13/0.42 % Processed clauses : 62
% 0.13/0.42 % ...of these trivial : 0
% 0.13/0.42 % ...subsumed : 13
% 0.13/0.42 % ...remaining for further processing : 49
% 0.13/0.42 % Other redundant clauses eliminated : 2
% 0.13/0.42 % Clauses deleted for lack of memory : 0
% 0.13/0.42 % Backward-subsumed : 0
% 0.13/0.42 % Backward-rewritten : 1
% 0.13/0.42 % Generated clauses : 75
% 0.13/0.42 % ...of the previous two non-redundant : 54
% 0.13/0.42 % ...aggressively subsumed : 0
% 0.13/0.42 % Contextual simplify-reflections : 1
% 0.13/0.42 % Paramodulations : 73
% 0.13/0.42 % Factorizations : 0
% 0.13/0.42 % NegExts : 0
% 0.13/0.42 % Equation resolutions : 2
% 0.13/0.42 % Disequality decompositions : 0
% 0.13/0.42 % Total rewrite steps : 6
% 0.13/0.42 % ...of those cached : 2
% 0.13/0.42 % Propositional unsat checks : 0
% 0.13/0.42 % Propositional check models : 0
% 0.13/0.42 % Propositional check unsatisfiable : 0
% 0.13/0.42 % Propositional clauses : 0
% 0.13/0.42 % Propositional clauses after purity: 0
% 0.13/0.42 % Propositional unsat core size : 0
% 0.13/0.42 % Propositional preprocessing time : 0.000
% 0.13/0.42 % Propositional encoding time : 0.000
% 0.13/0.42 % Propositional solver time : 0.000
% 0.13/0.42 % Success case prop preproc time : 0.000
% 0.13/0.42 % Success case prop encoding time : 0.000
% 0.13/0.42 % Success case prop solver time : 0.000
% 0.13/0.42 % Current number of processed clauses : 46
% 0.13/0.42 % Positive orientable unit clauses : 9
% 0.13/0.42 % Positive unorientable unit clauses: 0
% 0.13/0.42 % Negative unit clauses : 7
% 0.13/0.42 % Non-unit-clauses : 30
% 0.13/0.42 % Current number of unprocessed clauses: 17
% 0.13/0.42 % ...number of literals in the above : 51
% 0.13/0.42 % Current number of archived formulas : 0
% 0.13/0.42 % Current number of archived clauses : 1
% 0.13/0.42 % Clause-clause subsumption calls (NU) : 70
% 0.13/0.42 % Rec. Clause-clause subsumption calls : 58
% 0.13/0.42 % Non-unit clause-clause subsumptions : 7
% 0.13/0.42 % Unit Clause-clause subsumption calls : 11
% 0.13/0.42 % Rewrite failures with RHS unbound : 0
% 0.13/0.42 % BW rewrite match attempts : 1
% 0.13/0.42 % BW rewrite match successes : 1
% 0.13/0.42 % Condensation attempts : 0
% 0.13/0.42 % Condensation successes : 0
% 0.13/0.42 % Termbank termtop insertions : 2178
% 0.13/0.42 % Search garbage collected termcells : 374
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.006 s
% 0.13/0.42 % System time : 0.002 s
% 0.13/0.42 % Total time : 0.008 s
% 0.13/0.42 % Maximum resident set size: 3588 pages
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.012 s
% 0.13/0.42 % System time : 0.013 s
% 0.13/0.42 % Total time : 0.026 s
% 0.13/0.42 % Maximum resident set size: 4864 pages
% 0.13/0.42 % E exiting
%------------------------------------------------------------------------------