%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV752-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:59:52 PM UTC 2026
% Result : Unsatisfiable 10.17s 2.21s
% Output : CNFRefutation 10.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of clauses : 39 ( 16 unt; 6 nHn; 17 RR)
% Number of literals : 69 ( 21 equ; 30 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 122 ( 62 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_mem__def_1,axiom,
( ~ hBOOL(hAPP(X2,X1))
| c_in(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_mem__def_1) ).
cnf(cls_insert__code_2,axiom,
( ~ hBOOL(hAPP(X2,X4))
| hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_insert__code_2) ).
cnf(cls_keymode_Oinduct_0,axiom,
( ~ hBOOL(hAPP(X1,c_Public_Okeymode_OSignature))
| ~ hBOOL(hAPP(X1,c_Public_Okeymode_OEncryption))
| hBOOL(hAPP(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_keymode_Oinduct_0) ).
cnf(cls_mem__def_0,axiom,
( ~ c_in(X2,X1,X3)
| hBOOL(hAPP(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_mem__def_0) ).
cnf(cls_insert__code_1,axiom,
hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_insert__code_1) ).
cnf(cls_insertE_0,axiom,
( ~ c_in(X1,c_Set_Oinsert(X4,X2,X3),X3)
| X1 = X4
| c_in(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_insertE_0) ).
cnf(cls_singletonE_0,axiom,
( ~ c_in(X1,c_Set_Oinsert(X2,c_Orderings_Obot__class_Obot(tc_fun(X3,tc_bool)),X3),X3)
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_singletonE_0) ).
cnf(cls_not__Cons__self_0,axiom,
X1 != c_List_Olist_OCons(X2,X1,X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_not__Cons__self_0) ).
cnf(cls_list_Osimps_I2_J_0,axiom,
c_List_Olist_ONil(X1) != c_List_Olist_OCons(X2,X3,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_list_Osimps_I2_J_0) ).
cnf(c_0_9,plain,
( ~ hBOOL(hAPP(X2,X1))
| c_in(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[cls_mem__def_1]) ).
cnf(c_0_10,plain,
( ~ hBOOL(hAPP(X2,X4))
| hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X4)) ),
inference(fof_simplification,[status(thm)],[cls_insert__code_2]) ).
cnf(c_0_11,plain,
( ~ hBOOL(hAPP(X2,X1))
| c_in(X1,X2,X3) ),
c_0_9 ).
cnf(c_0_12,plain,
( ~ hBOOL(hAPP(X2,X4))
| hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X4)) ),
c_0_10 ).
cnf(c_0_13,plain,
( ~ hBOOL(hAPP(X1,c_Public_Okeymode_OSignature))
| ~ hBOOL(hAPP(X1,c_Public_Okeymode_OEncryption))
| hBOOL(hAPP(X1,X2)) ),
inference(fof_simplification,[status(thm)],[cls_keymode_Oinduct_0]) ).
cnf(c_0_14,plain,
( ~ c_in(X2,X1,X3)
| hBOOL(hAPP(X1,X2)) ),
inference(fof_simplification,[status(thm)],[cls_mem__def_0]) ).
cnf(c_0_15,plain,
( ~ hBOOL(hAPP(X3,X1))
| c_in(X1,c_Set_Oinsert(X2,X3,X4),X5) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,axiom,
hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X1)),
cls_insert__code_1 ).
cnf(c_0_17,plain,
( ~ hBOOL(hAPP(X1,c_Public_Okeymode_OSignature))
| ~ hBOOL(hAPP(X1,c_Public_Okeymode_OEncryption))
| hBOOL(hAPP(X1,X2)) ),
c_0_13 ).
cnf(c_0_18,plain,
( ~ c_in(X2,X1,X3)
| hBOOL(hAPP(X1,X2)) ),
c_0_14 ).
cnf(c_0_19,plain,
c_in(X1,c_Set_Oinsert(X2,c_Set_Oinsert(X1,X3,X4),X5),X6),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( ~ hBOOL(hAPP(c_Set_Oinsert(c_Public_Okeymode_OSignature,X1,X2),c_Public_Okeymode_OEncryption))
| hBOOL(hAPP(c_Set_Oinsert(c_Public_Okeymode_OSignature,X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_21,plain,
hBOOL(hAPP(c_Set_Oinsert(X1,c_Set_Oinsert(X2,X3,X4),X5),X2)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( ~ c_in(X1,c_Set_Oinsert(X4,X2,X3),X3)
| X1 = X4
| c_in(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[cls_insertE_0]) ).
cnf(c_0_23,plain,
hBOOL(hAPP(c_Set_Oinsert(c_Public_Okeymode_OSignature,c_Set_Oinsert(c_Public_Okeymode_OEncryption,X1,X2),X3),X4)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( ~ c_in(X1,c_Set_Oinsert(X2,c_Orderings_Obot__class_Obot(tc_fun(X3,tc_bool)),X3),X3)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[cls_singletonE_0]) ).
cnf(c_0_25,plain,
( ~ c_in(X1,c_Set_Oinsert(X4,X2,X3),X3)
| X1 = X4
| c_in(X1,X2,X3) ),
c_0_22 ).
cnf(c_0_26,plain,
c_in(X1,c_Set_Oinsert(c_Public_Okeymode_OSignature,c_Set_Oinsert(c_Public_Okeymode_OEncryption,X2,X3),X4),X5),
inference(spm,[status(thm)],[c_0_11,c_0_23]) ).
cnf(c_0_27,plain,
X1 != c_List_Olist_OCons(X2,X1,X3),
inference(fof_simplification,[status(thm)],[cls_not__Cons__self_0]) ).
cnf(c_0_28,plain,
( ~ c_in(X1,c_Set_Oinsert(X2,c_Orderings_Obot__class_Obot(tc_fun(X3,tc_bool)),X3),X3)
| X1 = X2 ),
c_0_24 ).
cnf(c_0_29,plain,
( c_in(X1,c_Set_Oinsert(c_Public_Okeymode_OEncryption,X2,X3),X4)
| X1 = c_Public_Okeymode_OSignature ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
c_List_Olist_ONil(X1) != c_List_Olist_OCons(X2,X3,X1),
inference(fof_simplification,[status(thm)],[cls_list_Osimps_I2_J_0]) ).
cnf(c_0_31,plain,
X1 != c_List_Olist_OCons(X2,X1,X3),
c_0_27 ).
cnf(c_0_32,plain,
( X1 = c_Public_Okeymode_OEncryption
| X1 = c_Public_Okeymode_OSignature ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
c_List_Olist_ONil(X1) != c_List_Olist_OCons(X2,X3,X1),
c_0_30 ).
cnf(c_0_34,plain,
c_List_Olist_OCons(X1,c_Public_Okeymode_OSignature,X2) = c_Public_Okeymode_OEncryption,
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_35,plain,
( X2 = X1
| X2 = c_Public_Okeymode_OEncryption
| X1 = c_Public_Okeymode_OEncryption ),
inference(spm,[status(thm)],[c_0_32,c_0_32]) ).
cnf(c_0_36,plain,
c_List_Olist_ONil(X1) != c_Public_Okeymode_OEncryption,
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
c_List_Olist_OCons(X1,X2,X3) = c_Public_Okeymode_OEncryption,
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_35])]),c_0_36]) ).
cnf(c_0_38,plain,
$false,
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV752-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n007.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 09:21:20 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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
% 10.17/2.21 % Version: 3.5.1
% 10.17/2.21 % Preprocessing class: FSLSSMSMSSSNFFN.
% 10.17/2.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.17/2.21 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 10.17/2.21 % Starting new_bool_3 with 300s (1) cores
% 10.17/2.21 % Starting new_bool_1 with 300s (1) cores
% 10.17/2.21 % Starting sh5l with 300s (1) cores
% 10.17/2.21 % sh5l with pid 737661 completed with status 0
% 10.17/2.21 % Result found by sh5l
% 10.17/2.21 % Preprocessing class: FSLSSMSMSSSNFFN.
% 10.17/2.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.17/2.21 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 10.17/2.21 % Starting new_bool_3 with 300s (1) cores
% 10.17/2.21 % Starting new_bool_1 with 300s (1) cores
% 10.17/2.21 % Starting sh5l with 300s (1) cores
% 10.17/2.21 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 10.17/2.21 % SinE strategy is gf500_gu_R04_F100_L20000
% 10.17/2.21 % Search class: FGHSM-FSLM31-DFFFFFNN
% 10.17/2.21 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 10.17/2.21 % Starting SubtermCWHack with 28s (1) cores
% 10.17/2.21 % SubtermCWHack with pid 737667 completed with status 0
% 10.17/2.21 % Result found by SubtermCWHack
% 10.17/2.21 % Preprocessing class: FSLSSMSMSSSNFFN.
% 10.17/2.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.17/2.21 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 10.17/2.21 % Starting new_bool_3 with 300s (1) cores
% 10.17/2.21 % Starting new_bool_1 with 300s (1) cores
% 10.17/2.21 % Starting sh5l with 300s (1) cores
% 10.17/2.21 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 10.17/2.21 % SinE strategy is gf500_gu_R04_F100_L20000
% 10.17/2.21 % Search class: FGHSM-FSLM31-DFFFFFNN
% 10.17/2.21 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 10.17/2.21 % Starting SubtermCWHack with 28s (1) cores
% 10.17/2.21 % Preprocessing time : 0.008 s
% 10.17/2.21
% 10.17/2.21 % Proof found!
% 10.17/2.21 % SZS status Unsatisfiable
% 10.17/2.21 % SZS output start CNFRefutation
% See solution above
% 10.17/2.21 % Parsed axioms : 579
% 10.17/2.21 % Removed by relevancy pruning/SinE : 52
% 10.17/2.21 % Initial clauses : 527
% 10.17/2.21 % Removed in clause preprocessing : 0
% 10.17/2.21 % Initial clauses in saturation : 527
% 10.17/2.21 % Processed clauses : 6485
% 10.17/2.21 % ...of these trivial : 2504
% 10.17/2.21 % ...subsumed : 1689
% 10.17/2.21 % ...remaining for further processing : 2292
% 10.17/2.21 % Other redundant clauses eliminated : 303
% 10.17/2.21 % Clauses deleted for lack of memory : 0
% 10.17/2.21 % Backward-subsumed : 41
% 10.17/2.21 % Backward-rewritten : 150
% 10.17/2.21 % Generated clauses : 93706
% 10.17/2.21 % ...of the previous two non-redundant : 82080
% 10.17/2.21 % ...aggressively subsumed : 0
% 10.17/2.21 % Contextual simplify-reflections : 0
% 10.17/2.21 % Paramodulations : 93340
% 10.17/2.21 % Factorizations : 33
% 10.17/2.21 % NegExts : 0
% 10.17/2.21 % Equation resolutions : 332
% 10.17/2.21 % Disequality decompositions : 0
% 10.17/2.21 % Total rewrite steps : 36476
% 10.17/2.21 % ...of those cached : 31163
% 10.17/2.21 % Propositional unsat checks : 0
% 10.17/2.21 % Propositional check models : 0
% 10.17/2.21 % Propositional check unsatisfiable : 0
% 10.17/2.21 % Propositional clauses : 0
% 10.17/2.21 % Propositional clauses after purity: 0
% 10.17/2.21 % Propositional unsat core size : 0
% 10.17/2.21 % Propositional preprocessing time : 0.000
% 10.17/2.21 % Propositional encoding time : 0.000
% 10.17/2.21 % Propositional solver time : 0.000
% 10.17/2.21 % Success case prop preproc time : 0.000
% 10.17/2.21 % Success case prop encoding time : 0.000
% 10.17/2.21 % Success case prop solver time : 0.000
% 10.17/2.21 % Current number of processed clauses : 2100
% 10.17/2.21 % Positive orientable unit clauses : 1467
% 10.17/2.21 % Positive unorientable unit clauses: 7
% 10.17/2.21 % Negative unit clauses : 52
% 10.17/2.21 % Non-unit-clauses : 574
% 10.17/2.21 % Current number of unprocessed clauses: 75883
% 10.17/2.21 % ...number of literals in the above : 178424
% 10.17/2.21 % Current number of archived formulas : 0
% 10.17/2.21 % Current number of archived clauses : 192
% 10.17/2.21 % Clause-clause subsumption calls (NU) : 84342
% 10.17/2.21 % Rec. Clause-clause subsumption calls : 54299
% 10.17/2.21 % Non-unit clause-clause subsumptions : 1597
% 10.17/2.21 % Unit Clause-clause subsumption calls : 4605
% 10.17/2.21 % Rewrite failures with RHS unbound : 0
% 10.17/2.21 % BW rewrite match attempts : 21692
% 10.17/2.21 % BW rewrite match successes : 185
% 10.17/2.21 % Condensation attempts : 0
% 10.17/2.21 % Condensation successes : 0
% 10.17/2.21 % Termbank termtop insertions : 1071032
% 10.17/2.21 % Search garbage collected termcells : 1206
% 10.17/2.21
% 10.17/2.21 % -------------------------------------------------
% 10.17/2.21 % User time : 1.589 s
% 10.17/2.21 % System time : 0.106 s
% 10.17/2.21 % Total time : 1.695 s
% 10.17/2.21 % Maximum resident set size: 4864 pages
% 10.17/2.21
% 10.17/2.21 % -------------------------------------------------
% 10.17/2.21 % User time : 1.605 s
% 10.17/2.21 % System time : 0.113 s
% 10.17/2.21 % Total time : 1.717 s
% 10.17/2.21 % Maximum resident set size: 5120 pages
% 10.17/2.21 % E exiting
%------------------------------------------------------------------------------