%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWV758-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 : n011.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 03:06:50 PM UTC 2026
% Result : Unsatisfiable 4.37s 1.11s
% Output : CNFRefutation 4.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of clauses : 38 ( 25 unt; 6 nHn; 20 RR)
% Number of literals : 58 ( 31 equ; 26 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 110 ( 47 sgn)
% Comments :
%------------------------------------------------------------------------------
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_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_insert__commute_0,axiom,
c_Set_Oinsert(X1,c_Set_Oinsert(X2,X3,X4),X4) = c_Set_Oinsert(X2,c_Set_Oinsert(X1,X3,X4),X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_insert__commute_0) ).
cnf(cls_insert__code_0,axiom,
( ~ hBOOL(hAPP(c_Set_Oinsert(X3,X1,X4),X2))
| X3 = X2
| hBOOL(hAPP(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_insert__code_0) ).
cnf(cls_self__append__conv2_0,axiom,
( X1 != c_List_Oappend(X2,X1,X3)
| X2 = c_List_Olist_ONil(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_self__append__conv2_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(cls_Cons__eq__append__conv_5,axiom,
c_List_Olist_OCons(X1,c_List_Oappend(X2,X3,X4),X4) = c_List_Oappend(c_List_Olist_OCons(X1,X2,X4),X3,X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Cons__eq__append__conv_5) ).
cnf(cls_bot1E_0,axiom,
~ hBOOL(hAPP(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_bot1E_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_eq__Nil__appendI_0,axiom,
X1 = c_List_Oappend(c_List_Olist_ONil(X2),X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_eq__Nil__appendI_0) ).
cnf(c_0_10,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_11,plain,
( ~ hBOOL(hAPP(X1,c_Public_Okeymode_OSignature))
| ~ hBOOL(hAPP(X1,c_Public_Okeymode_OEncryption))
| hBOOL(hAPP(X1,X2)) ),
c_0_10 ).
cnf(c_0_12,axiom,
hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X1)),
cls_insert__code_1 ).
cnf(c_0_13,axiom,
c_Set_Oinsert(X1,c_Set_Oinsert(X2,X3,X4),X4) = c_Set_Oinsert(X2,c_Set_Oinsert(X1,X3,X4),X4),
cls_insert__commute_0 ).
cnf(c_0_14,plain,
( ~ hBOOL(hAPP(c_Set_Oinsert(X3,X1,X4),X2))
| X3 = X2
| hBOOL(hAPP(X1,X2)) ),
inference(fof_simplification,[status(thm)],[cls_insert__code_0]) ).
cnf(c_0_15,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_11,c_0_12]) ).
cnf(c_0_16,plain,
hBOOL(hAPP(c_Set_Oinsert(X1,c_Set_Oinsert(X2,X3,X4),X4),X2)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( X1 != c_List_Oappend(X2,X1,X3)
| X2 = c_List_Olist_ONil(X3) ),
inference(fof_simplification,[status(thm)],[cls_self__append__conv2_0]) ).
cnf(c_0_18,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_19,plain,
( ~ hBOOL(hAPP(c_Set_Oinsert(X3,X1,X4),X2))
| X3 = X2
| hBOOL(hAPP(X1,X2)) ),
c_0_14 ).
cnf(c_0_20,plain,
hBOOL(hAPP(c_Set_Oinsert(c_Public_Okeymode_OEncryption,c_Set_Oinsert(c_Public_Okeymode_OSignature,X1,X2),X2),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_13]) ).
cnf(c_0_21,plain,
( X1 != c_List_Oappend(X2,X1,X3)
| X2 = c_List_Olist_ONil(X3) ),
c_0_17 ).
cnf(c_0_22,axiom,
c_List_Olist_OCons(X1,c_List_Oappend(X2,X3,X4),X4) = c_List_Oappend(c_List_Olist_OCons(X1,X2,X4),X3,X4),
cls_Cons__eq__append__conv_5 ).
cnf(c_0_23,plain,
c_List_Olist_ONil(X1) != c_List_Olist_OCons(X2,X3,X1),
c_0_18 ).
cnf(c_0_24,plain,
~ hBOOL(hAPP(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2)),
inference(fof_simplification,[status(thm)],[cls_bot1E_0]) ).
cnf(c_0_25,plain,
( hBOOL(hAPP(c_Set_Oinsert(c_Public_Okeymode_OSignature,X2,X3),X1))
| X1 = c_Public_Okeymode_OEncryption ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
c_List_Olist_OCons(X1,c_List_Oappend(X2,X3,X4),X4) != X3,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),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,
~ hBOOL(hAPP(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2)),
c_0_24 ).
cnf(c_0_29,plain,
( hBOOL(hAPP(X2,X1))
| X1 = c_Public_Okeymode_OSignature
| X1 = c_Public_Okeymode_OEncryption ),
inference(spm,[status(thm)],[c_0_19,c_0_25]) ).
cnf(c_0_30,plain,
c_List_Olist_OCons(X1,c_List_Olist_OCons(X2,c_List_Oappend(X3,X4,X5),X5),X5) != X4,
inference(spm,[status(thm)],[c_0_26,c_0_22]) ).
cnf(c_0_31,axiom,
X1 = c_List_Oappend(c_List_Olist_ONil(X2),X1,X2),
cls_eq__Nil__appendI_0 ).
cnf(c_0_32,plain,
X1 != c_List_Olist_OCons(X2,X1,X3),
c_0_27 ).
cnf(c_0_33,plain,
( X1 = c_Public_Okeymode_OEncryption
| X1 = c_Public_Okeymode_OSignature ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
c_List_Olist_OCons(X1,c_List_Olist_OCons(X2,X3,X4),X4) != X3,
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,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_32,c_0_33])]) ).
cnf(c_0_36,plain,
c_List_Olist_OCons(X1,c_Public_Okeymode_OEncryption,X2) != c_Public_Okeymode_OSignature,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_33]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV758-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.13/0.37 % Computer : n011.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Mon Sep 21 09:23:56 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/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
% 4.37/1.11 % Version: 3.5.1
% 4.37/1.11 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.37/1.11 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.37/1.11 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.37/1.11 % Starting new_bool_3 with 300s (1) cores
% 4.37/1.11 % Starting new_bool_1 with 300s (1) cores
% 4.37/1.11 % Starting sh5l with 300s (1) cores
% 4.37/1.11 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1552781 completed with status 0
% 4.37/1.11 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 4.37/1.11 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.37/1.11 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.37/1.11 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.37/1.11 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.37/1.11 % No SInE strategy applied
% 4.37/1.11 % Search class: FGHSM-FSLM32-DFFFFFNN
% 4.37/1.11 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 4.37/1.11 % Starting SubtermCWHack with 136s (1) cores
% 4.37/1.11 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.37/1.11 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 113s (1) cores
% 4.37/1.11 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 113s (1) cores
% 4.37/1.11 % Starting U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 4.37/1.11 % SubtermCWHack with pid 1552788 completed with status 0
% 4.37/1.11 % Result found by SubtermCWHack
% 4.37/1.11 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.37/1.11 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.37/1.11 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.37/1.11 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.37/1.11 % No SInE strategy applied
% 4.37/1.11 % Search class: FGHSM-FSLM32-DFFFFFNN
% 4.37/1.11 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 4.37/1.11 % Starting SubtermCWHack with 136s (1) cores
% 4.37/1.11 % Preprocessing time : 0.006 s
% 4.37/1.11
% 4.37/1.11 % Proof found!
% 4.37/1.11 % SZS status Unsatisfiable
% 4.37/1.11 % SZS output start CNFRefutation
% See solution above
% 4.37/1.11 % Parsed axioms : 692
% 4.37/1.11 % Removed by relevancy pruning/SinE : 0
% 4.37/1.11 % Initial clauses : 692
% 4.37/1.11 % Removed in clause preprocessing : 4
% 4.37/1.11 % Initial clauses in saturation : 688
% 4.37/1.11 % Processed clauses : 5520
% 4.37/1.11 % ...of these trivial : 1818
% 4.37/1.11 % ...subsumed : 1533
% 4.37/1.11 % ...remaining for further processing : 2169
% 4.37/1.11 % Other redundant clauses eliminated : 93
% 4.37/1.11 % Clauses deleted for lack of memory : 0
% 4.37/1.11 % Backward-subsumed : 34
% 4.37/1.11 % Backward-rewritten : 273
% 4.37/1.11 % Generated clauses : 52752
% 4.37/1.11 % ...of the previous two non-redundant : 35954
% 4.37/1.11 % ...aggressively subsumed : 0
% 4.37/1.11 % Contextual simplify-reflections : 0
% 4.37/1.11 % Paramodulations : 52614
% 4.37/1.11 % Factorizations : 11
% 4.37/1.11 % NegExts : 0
% 4.37/1.11 % Equation resolutions : 127
% 4.37/1.11 % Disequality decompositions : 0
% 4.37/1.11 % Total rewrite steps : 39149
% 4.37/1.11 % ...of those cached : 33219
% 4.37/1.11 % Propositional unsat checks : 0
% 4.37/1.11 % Propositional check models : 0
% 4.37/1.11 % Propositional check unsatisfiable : 0
% 4.37/1.11 % Propositional clauses : 0
% 4.37/1.11 % Propositional clauses after purity: 0
% 4.37/1.11 % Propositional unsat core size : 0
% 4.37/1.11 % Propositional preprocessing time : 0.000
% 4.37/1.11 % Propositional encoding time : 0.000
% 4.37/1.11 % Propositional solver time : 0.000
% 4.37/1.11 % Success case prop preproc time : 0.000
% 4.37/1.11 % Success case prop encoding time : 0.000
% 4.37/1.11 % Success case prop solver time : 0.000
% 4.37/1.11 % Current number of processed clauses : 1862
% 4.37/1.11 % Positive orientable unit clauses : 1094
% 4.37/1.11 % Positive unorientable unit clauses: 9
% 4.37/1.11 % Negative unit clauses : 93
% 4.37/1.11 % Non-unit-clauses : 666
% 4.37/1.11 % Current number of unprocessed clauses: 30698
% 4.37/1.11 % ...number of literals in the above : 56790
% 4.37/1.11 % Current number of archived formulas : 0
% 4.37/1.11 % Current number of archived clauses : 309
% 4.37/1.11 % Clause-clause subsumption calls (NU) : 147872
% 4.37/1.11 % Rec. Clause-clause subsumption calls : 98903
% 4.37/1.11 % Non-unit clause-clause subsumptions : 1361
% 4.37/1.11 % Unit Clause-clause subsumption calls : 17092
% 4.37/1.11 % Rewrite failures with RHS unbound : 3
% 4.37/1.11 % BW rewrite match attempts : 26707
% 4.37/1.11 % BW rewrite match successes : 296
% 4.37/1.11 % Condensation attempts : 0
% 4.37/1.11 % Condensation successes : 0
% 4.37/1.11 % Termbank termtop insertions : 752951
% 4.37/1.11 % Search garbage collected termcells : 1236
% 4.37/1.11
% 4.37/1.11 % -------------------------------------------------
% 4.37/1.11 % User time : 0.582 s
% 4.37/1.11 % System time : 0.040 s
% 4.37/1.11 % Total time : 0.622 s
% 4.37/1.11 % Maximum resident set size: 4972 pages
% 4.37/1.11
% 4.37/1.11 % -------------------------------------------------
% 4.37/1.11 % User time : 2.850 s
% 4.37/1.11 % System time : 0.157 s
% 4.37/1.11 % Total time : 3.007 s
% 4.37/1.11 % Maximum resident set size: 5376 pages
% 4.37/1.11 % E exiting
%------------------------------------------------------------------------------