%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM383+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n003.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 01:48:57 PM UTC 2026
% Result : Theorem 0.14s 0.44s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 5 unt; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 72 ( 35 ~; 25 |; 7 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 51 ( 3 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t5_subset,axiom,
! [X1,X2,X3] :
~ ( empty(X3)
& element(X2,powerset(X3))
& in(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_subset) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(t7_ordinal1,conjecture,
! [X1,X2] :
~ ( subset(X2,X1)
& in(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_ordinal1) ).
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( element(X2,powerset(X3))
& in(X1,X2) )
=> element(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_subset) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( in(X1,X2)
| empty(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
fof(antisymmetry_r2_hidden,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(c_0_6,plain,
! [X31,X32,X33] :
( ~ empty(X33)
| ~ element(X32,powerset(X33))
| ~ in(X31,X32) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])])]) ).
fof(c_0_7,plain,
! [X26,X27] :
( ( element(X26,powerset(X27))
| ~ subset(X26,X27) )
& ( subset(X26,X27)
| ~ element(X26,powerset(X27)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2] :
~ ( subset(X2,X1)
& in(X1,X2) ),
inference(assume_negation,[status(cth)],[t7_ordinal1]) ).
fof(c_0_9,plain,
! [X28,X29,X30] :
( element(X28,X30)
| ~ element(X29,powerset(X30))
| ~ in(X28,X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])])]) ).
cnf(c_0_10,plain,
( ~ empty(X3)
| ~ element(X2,powerset(X3))
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( ~ subset(X1,X2)
| element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,negated_conjecture,
( subset(esk13_0,esk12_0)
& in(esk12_0,esk13_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_13,plain,
( ~ element(X2,powerset(X3))
| ~ in(X1,X2)
| element(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( ~ in(X3,X1)
| ~ empty(X2)
| ~ subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
subset(esk13_0,esk12_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X24,X25] :
( in(X24,X25)
| empty(X25)
| ~ element(X24,X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])]) ).
cnf(c_0_17,plain,
( ~ in(X1,X3)
| ~ subset(X3,X2)
| element(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_18,negated_conjecture,
( ~ in(X1,esk13_0)
| ~ empty(esk12_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
in(esk12_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_20,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden]) ).
cnf(c_0_21,plain,
( ~ element(X1,X2)
| in(X1,X2)
| empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
( ~ in(X1,esk13_0)
| element(X1,esk12_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_23,negated_conjecture,
~ empty(esk12_0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_24,plain,
! [X4,X5] :
( ~ in(X5,X4)
| ~ in(X4,X5) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])]) ).
cnf(c_0_25,negated_conjecture,
( ~ in(X1,esk13_0)
| in(X1,esk12_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_26,plain,
( ~ in(X2,X1)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_27,negated_conjecture,
in(esk12_0,esk12_0),
inference(spm,[status(thm)],[c_0_25,c_0_19]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM383+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n003.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 02:28:15 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.14/0.44 % Version: 3.5.1
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 % Starting sh5l with 300s (1) cores
% 0.14/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3206197 completed with status 0
% 0.14/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.44 % No SInE strategy applied
% 0.14/0.44 % Search class: FGHSS-FFSM11-SFFFFFNN
% 0.14/0.44 % partial match(1): FGHSS-FFMM11-SFFFFFNN
% 0.14/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.44 % SubtermCWHack with pid 3206201 completed with status 0
% 0.14/0.44 % Result found by SubtermCWHack
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.44 % No SInE strategy applied
% 0.14/0.44 % Search class: FGHSS-FFSM11-SFFFFFNN
% 0.14/0.44 % partial match(1): FGHSS-FFMM11-SFFFFFNN
% 0.14/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.44 % Preprocessing time : 0.001 s
% 0.14/0.44
% 0.14/0.44 % Proof found!
% 0.14/0.44 % SZS status Theorem
% 0.14/0.44 % SZS output start CNFRefutation
% See solution above
% 0.14/0.44 % Parsed axioms : 28
% 0.14/0.44 % Removed by relevancy pruning/SinE : 0
% 0.14/0.44 % Initial clauses : 47
% 0.14/0.44 % Removed in clause preprocessing : 2
% 0.14/0.44 % Initial clauses in saturation : 45
% 0.14/0.44 % Processed clauses : 87
% 0.14/0.44 % ...of these trivial : 3
% 0.14/0.44 % ...subsumed : 14
% 0.14/0.44 % ...remaining for further processing : 70
% 0.14/0.44 % Other redundant clauses eliminated : 0
% 0.14/0.44 % Clauses deleted for lack of memory : 0
% 0.14/0.44 % Backward-subsumed : 1
% 0.14/0.44 % Backward-rewritten : 6
% 0.14/0.44 % Generated clauses : 63
% 0.14/0.44 % ...of the previous two non-redundant : 53
% 0.14/0.44 % ...aggressively subsumed : 0
% 0.14/0.44 % Contextual simplify-reflections : 2
% 0.14/0.44 % Paramodulations : 63
% 0.14/0.44 % Factorizations : 0
% 0.14/0.44 % NegExts : 0
% 0.14/0.44 % Equation resolutions : 0
% 0.14/0.44 % Disequality decompositions : 0
% 0.14/0.44 % Total rewrite steps : 18
% 0.14/0.44 % ...of those cached : 11
% 0.14/0.44 % Propositional unsat checks : 0
% 0.14/0.44 % Propositional check models : 0
% 0.14/0.44 % Propositional check unsatisfiable : 0
% 0.14/0.44 % Propositional clauses : 0
% 0.14/0.44 % Propositional clauses after purity: 0
% 0.14/0.44 % Propositional unsat core size : 0
% 0.14/0.44 % Propositional preprocessing time : 0.000
% 0.14/0.44 % Propositional encoding time : 0.000
% 0.14/0.44 % Propositional solver time : 0.000
% 0.14/0.44 % Success case prop preproc time : 0.000
% 0.14/0.44 % Success case prop encoding time : 0.000
% 0.14/0.44 % Success case prop solver time : 0.000
% 0.14/0.44 % Current number of processed clauses : 63
% 0.14/0.44 % Positive orientable unit clauses : 27
% 0.14/0.44 % Positive unorientable unit clauses: 0
% 0.14/0.44 % Negative unit clauses : 5
% 0.14/0.44 % Non-unit-clauses : 31
% 0.14/0.44 % Current number of unprocessed clauses: 10
% 0.14/0.44 % ...number of literals in the above : 27
% 0.14/0.44 % Current number of archived formulas : 0
% 0.14/0.44 % Current number of archived clauses : 7
% 0.14/0.44 % Clause-clause subsumption calls (NU) : 135
% 0.14/0.44 % Rec. Clause-clause subsumption calls : 112
% 0.14/0.44 % Non-unit clause-clause subsumptions : 16
% 0.14/0.44 % Unit Clause-clause subsumption calls : 12
% 0.14/0.44 % Rewrite failures with RHS unbound : 0
% 0.14/0.44 % BW rewrite match attempts : 4
% 0.14/0.44 % BW rewrite match successes : 3
% 0.14/0.44 % Condensation attempts : 0
% 0.14/0.44 % Condensation successes : 0
% 0.14/0.44 % Termbank termtop insertions : 2389
% 0.14/0.44 % Search garbage collected termcells : 269
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.006 s
% 0.14/0.44 % System time : 0.002 s
% 0.14/0.44 % Total time : 0.009 s
% 0.14/0.44 % Maximum resident set size: 3648 pages
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.015 s
% 0.14/0.44 % System time : 0.011 s
% 0.14/0.44 % Total time : 0.025 s
% 0.14/0.44 % Maximum resident set size: 4608 pages
% 0.14/0.44 % E exiting
%------------------------------------------------------------------------------