%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET787-2 : TPTP v9.3.1. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:15:23 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.44s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of clauses : 33 ( 14 unt; 7 nHn; 24 RR)
% Number of literals : 55 ( 7 equ; 21 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 45 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause120,axiom,
( ~ member(X1,union(X2))
| member(unionE_sk1(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause120) ).
cnf(clause112,axiom,
( ~ member(X1,cons(X2,X3))
| member(X1,X3)
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause112) ).
cnf(un_eq_Union_2_c1,negated_conjecture,
member(sk2,union(cons(a,cons(b,eptset)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',un_eq_Union_2_c1) ).
cnf(clause119,axiom,
( ~ member(X1,union(X2))
| member(X1,unionE_sk1(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause119) ).
cnf(clause158,axiom,
~ member(X1,eptset),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause158) ).
cnf(clause20,axiom,
( ~ member(X1,X2)
| member(X1,un(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause20) ).
cnf(un_eq_Union_2_c2,negated_conjecture,
~ member(sk2,un(a,b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',un_eq_Union_2_c2) ).
cnf(clause19,axiom,
( ~ member(X1,X2)
| member(X1,un(X3,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause19) ).
cnf(c_0_8,plain,
( ~ member(X1,union(X2))
| member(unionE_sk1(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_9,plain,
( ~ member(X1,cons(X2,X3))
| member(X1,X3)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[clause112]) ).
cnf(c_0_10,plain,
( ~ member(X1,union(X2))
| member(unionE_sk1(X1,X2),X2) ),
c_0_8 ).
cnf(c_0_11,negated_conjecture,
member(sk2,union(cons(a,cons(b,eptset)))),
un_eq_Union_2_c1 ).
cnf(c_0_12,plain,
( ~ member(X1,union(X2))
| member(X1,unionE_sk1(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_13,plain,
( ~ member(X1,cons(X2,X3))
| member(X1,X3)
| X1 = X2 ),
c_0_9 ).
cnf(c_0_14,negated_conjecture,
member(unionE_sk1(sk2,cons(a,cons(b,eptset))),cons(a,cons(b,eptset))),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
~ member(X1,eptset),
inference(fof_simplification,[status(thm)],[clause158]) ).
cnf(c_0_16,plain,
( ~ member(X1,X2)
| member(X1,un(X2,X3)) ),
inference(fof_simplification,[status(thm)],[clause20]) ).
cnf(c_0_17,plain,
( ~ member(X1,union(X2))
| member(X1,unionE_sk1(X1,X2)) ),
c_0_12 ).
cnf(c_0_18,negated_conjecture,
( member(unionE_sk1(sk2,cons(a,cons(b,eptset))),cons(b,eptset))
| unionE_sk1(sk2,cons(a,cons(b,eptset))) = a ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
~ member(X1,eptset),
c_0_15 ).
cnf(c_0_20,plain,
( ~ member(X1,X2)
| member(X1,un(X2,X3)) ),
c_0_16 ).
cnf(c_0_21,negated_conjecture,
member(sk2,unionE_sk1(sk2,cons(a,cons(b,eptset)))),
inference(spm,[status(thm)],[c_0_17,c_0_11]) ).
cnf(c_0_22,negated_conjecture,
( unionE_sk1(sk2,cons(a,cons(b,eptset))) = b
| unionE_sk1(sk2,cons(a,cons(b,eptset))) = a ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_18]),c_0_19]) ).
cnf(c_0_23,negated_conjecture,
~ member(sk2,un(a,b)),
inference(fof_simplification,[status(thm)],[un_eq_Union_2_c2]) ).
cnf(c_0_24,negated_conjecture,
member(sk2,un(unionE_sk1(sk2,cons(a,cons(b,eptset))),X1)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( member(sk2,b)
| unionE_sk1(sk2,cons(a,cons(b,eptset))) = a ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( ~ member(X1,X2)
| member(X1,un(X3,X2)) ),
inference(fof_simplification,[status(thm)],[clause19]) ).
cnf(c_0_27,negated_conjecture,
~ member(sk2,un(a,b)),
c_0_23 ).
cnf(c_0_28,negated_conjecture,
( member(sk2,b)
| member(sk2,un(a,X1)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( ~ member(X1,X2)
| member(X1,un(X3,X2)) ),
c_0_26 ).
cnf(c_0_30,negated_conjecture,
member(sk2,b),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
member(sk2,un(X1,b)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET787-2 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.36 % Computer : n017.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 05:33:26 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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: FSLSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S 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--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1535317 completed with status 0
% 0.14/0.44 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S 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: FGHSM-FFMF31-MFFFFFNN
% 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--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.44 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN 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 % new_bool_1 with pid 1535325 completed with status 0
% 0.14/0.44 % Result found by new_bool_1
% 0.14/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S 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: FGHSM-FFMF31-MFFFFFNN
% 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--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.44 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN 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 % Preprocessing time : 0.002 s
% 0.14/0.44 % Presaturation interreduction done
% 0.14/0.44
% 0.14/0.44 % Proof found!
% 0.14/0.44 % SZS status Unsatisfiable
% 0.14/0.44 % SZS output start CNFRefutation
% See solution above
% 0.14/0.44 % Parsed axioms : 149
% 0.14/0.44 % Removed by relevancy pruning/SinE : 0
% 0.14/0.44 % Initial clauses : 149
% 0.14/0.44 % Removed in clause preprocessing : 4
% 0.14/0.44 % Initial clauses in saturation : 145
% 0.14/0.44 % Processed clauses : 320
% 0.14/0.44 % ...of these trivial : 0
% 0.14/0.44 % ...subsumed : 12
% 0.14/0.44 % ...remaining for further processing : 308
% 0.14/0.44 % Other redundant clauses eliminated : 5
% 0.14/0.44 % Clauses deleted for lack of memory : 0
% 0.14/0.44 % Backward-subsumed : 2
% 0.14/0.44 % Backward-rewritten : 5
% 0.14/0.44 % Generated clauses : 705
% 0.14/0.44 % ...of the previous two non-redundant : 635
% 0.14/0.44 % ...aggressively subsumed : 0
% 0.14/0.44 % Contextual simplify-reflections : 0
% 0.14/0.44 % Paramodulations : 689
% 0.14/0.44 % Factorizations : 1
% 0.14/0.44 % NegExts : 0
% 0.14/0.44 % Equation resolutions : 15
% 0.14/0.44 % Disequality decompositions : 0
% 0.14/0.44 % Total rewrite steps : 53
% 0.14/0.44 % ...of those cached : 29
% 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 : 165
% 0.14/0.44 % Positive orientable unit clauses : 53
% 0.14/0.44 % Positive unorientable unit clauses: 0
% 0.14/0.44 % Negative unit clauses : 38
% 0.14/0.44 % Non-unit-clauses : 74
% 0.14/0.44 % Current number of unprocessed clauses: 591
% 0.14/0.44 % ...number of literals in the above : 1056
% 0.14/0.44 % Current number of archived formulas : 0
% 0.14/0.44 % Current number of archived clauses : 138
% 0.14/0.44 % Clause-clause subsumption calls (NU) : 2264
% 0.14/0.44 % Rec. Clause-clause subsumption calls : 1876
% 0.14/0.44 % Non-unit clause-clause subsumptions : 7
% 0.14/0.44 % Unit Clause-clause subsumption calls : 101
% 0.14/0.44 % Rewrite failures with RHS unbound : 0
% 0.14/0.44 % BW rewrite match attempts : 21
% 0.14/0.44 % BW rewrite match successes : 4
% 0.14/0.44 % Condensation attempts : 0
% 0.14/0.44 % Condensation successes : 0
% 0.14/0.44 % Termbank termtop insertions : 13438
% 0.14/0.44 % Search garbage collected termcells : 264
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.015 s
% 0.14/0.44 % System time : 0.004 s
% 0.14/0.44 % Total time : 0.019 s
% 0.14/0.44 % Maximum resident set size: 3748 pages
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.078 s
% 0.14/0.44 % System time : 0.016 s
% 0.14/0.44 % Total time : 0.094 s
% 0.14/0.44 % Maximum resident set size: 4608 pages
% 0.14/0.44 % E exiting
%------------------------------------------------------------------------------