%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV905-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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 03:00:09 PM UTC 2026
% Result : Unsatisfiable 0.31s 0.51s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 36 ( 20 unt; 2 nHn; 23 RR)
% Number of literals : 58 ( 12 equ; 28 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 6 con; 0-3 aty)
% Number of variables : 60 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_insert__absorb_0,axiom,
( ~ hBOOL(c_in(X1,X2,X3))
| c_Set_Oinsert(X1,X2,X3) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__absorb_0) ).
cnf(cls_mem__def_1,axiom,
( ~ hBOOL(hAPP(X2,X1))
| hBOOL(c_in(X1,X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mem__def_1) ).
cnf(cls_insert__code_1,axiom,
hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__code_1) ).
cnf(cls_MGF_0,axiom,
( ~ c_Hoare__Mirabelle_Ostate__not__singleton
| ~ c_Com_OWT__bodies
| ~ c_Com_OWT(X1)
| c_Hoare__Mirabelle_Ohoare__derivs(c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),c_Set_Oinsert(c_Hoare__Mirabelle_OMGT(X1),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),tc_Com_Ostate) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_MGF_0) ).
cnf(cls_insert__iff_1,axiom,
hBOOL(c_in(X1,c_Set_Oinsert(X1,X2,X3),X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__iff_1) ).
cnf(cls_conjecture_3,negated_conjecture,
hBOOL(c_in(v_x,c_Map_Odom(c_Com_Obody,tc_Com_Opname,tc_Com_Ocom),tc_Com_Opname)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_4,negated_conjecture,
~ c_Hoare__Mirabelle_Ohoare__derivs(c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),c_Set_Oinsert(c_Hoare__Mirabelle_OMGT(c_Com_Ocom_OBODY(v_x)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),tc_Com_Ostate),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_conjecture_1,negated_conjecture,
c_Com_OWT__bodies,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_conjecture_0,negated_conjecture,
c_Hoare__Mirabelle_Ostate__not__singleton,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_domIff_0,axiom,
( ~ hBOOL(c_in(X2,c_Map_Odom(X1,X4,X3),X4))
| hAPP(X1,X2) != c_Option_Ooption_ONone(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_domIff_0) ).
cnf(cls_WT_OBody_0,axiom,
( hAPP(c_Com_Obody,X1) = c_Option_Ooption_ONone(tc_Com_Ocom)
| c_Com_OWT(c_Com_Ocom_OBODY(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_WT_OBody_0) ).
cnf(c_0_11,plain,
( ~ hBOOL(c_in(X1,X2,X3))
| c_Set_Oinsert(X1,X2,X3) = X2 ),
inference(fof_simplification,[status(thm)],[cls_insert__absorb_0]) ).
cnf(c_0_12,plain,
( ~ hBOOL(hAPP(X2,X1))
| hBOOL(c_in(X1,X2,X3)) ),
inference(fof_simplification,[status(thm)],[cls_mem__def_1]) ).
cnf(c_0_13,plain,
( ~ hBOOL(c_in(X1,X2,X3))
| c_Set_Oinsert(X1,X2,X3) = X2 ),
c_0_11 ).
cnf(c_0_14,plain,
( ~ hBOOL(hAPP(X2,X1))
| hBOOL(c_in(X1,X2,X3)) ),
c_0_12 ).
cnf(c_0_15,plain,
( ~ hBOOL(hAPP(X2,X1))
| c_Set_Oinsert(X1,X2,X3) = X2 ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,axiom,
hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X1)),
cls_insert__code_1 ).
cnf(c_0_17,plain,
( ~ c_Hoare__Mirabelle_Ostate__not__singleton
| ~ c_Com_OWT__bodies
| ~ c_Com_OWT(X1)
| c_Hoare__Mirabelle_Ohoare__derivs(c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),c_Set_Oinsert(c_Hoare__Mirabelle_OMGT(X1),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),tc_Com_Ostate) ),
inference(fof_simplification,[status(thm)],[cls_MGF_0]) ).
cnf(c_0_18,axiom,
hBOOL(c_in(X1,c_Set_Oinsert(X1,X2,X3),X3)),
cls_insert__iff_1 ).
cnf(c_0_19,plain,
c_Set_Oinsert(X1,c_Set_Oinsert(X1,X2,X3),X4) = c_Set_Oinsert(X1,X2,X3),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
hBOOL(c_in(v_x,c_Map_Odom(c_Com_Obody,tc_Com_Opname,tc_Com_Ocom),tc_Com_Opname)),
cls_conjecture_3 ).
cnf(c_0_21,negated_conjecture,
~ c_Hoare__Mirabelle_Ohoare__derivs(c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),c_Set_Oinsert(c_Hoare__Mirabelle_OMGT(c_Com_Ocom_OBODY(v_x)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),tc_Com_Ostate),
inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).
cnf(c_0_22,plain,
( ~ c_Hoare__Mirabelle_Ostate__not__singleton
| ~ c_Com_OWT__bodies
| ~ c_Com_OWT(X1)
| c_Hoare__Mirabelle_Ohoare__derivs(c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),c_Set_Oinsert(c_Hoare__Mirabelle_OMGT(X1),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),tc_Com_Ostate) ),
c_0_17 ).
cnf(c_0_23,negated_conjecture,
c_Com_OWT__bodies,
cls_conjecture_1 ).
cnf(c_0_24,negated_conjecture,
c_Hoare__Mirabelle_Ostate__not__singleton,
cls_conjecture_0 ).
cnf(c_0_25,plain,
( ~ hBOOL(c_in(X2,c_Map_Odom(X1,X4,X3),X4))
| hAPP(X1,X2) != c_Option_Ooption_ONone(X3) ),
inference(fof_simplification,[status(thm)],[cls_domIff_0]) ).
cnf(c_0_26,plain,
hBOOL(c_in(X1,c_Set_Oinsert(X1,X2,X3),X4)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,negated_conjecture,
c_Set_Oinsert(v_x,c_Map_Odom(c_Com_Obody,tc_Com_Opname,tc_Com_Ocom),tc_Com_Opname) = c_Map_Odom(c_Com_Obody,tc_Com_Opname,tc_Com_Ocom),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_28,negated_conjecture,
~ c_Hoare__Mirabelle_Ohoare__derivs(c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),c_Set_Oinsert(c_Hoare__Mirabelle_OMGT(c_Com_Ocom_OBODY(v_x)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),tc_Com_Ostate),
c_0_21 ).
cnf(c_0_29,plain,
( ~ c_Com_OWT(X1)
| c_Hoare__Mirabelle_Ohoare__derivs(c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),c_Set_Oinsert(c_Hoare__Mirabelle_OMGT(X1),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),tc_Com_Ostate) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_30,plain,
( ~ hBOOL(c_in(X2,c_Map_Odom(X1,X4,X3),X4))
| hAPP(X1,X2) != c_Option_Ooption_ONone(X3) ),
c_0_25 ).
cnf(c_0_31,negated_conjecture,
hBOOL(c_in(v_x,c_Map_Odom(c_Com_Obody,tc_Com_Opname,tc_Com_Ocom),X1)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
~ c_Com_OWT(c_Com_Ocom_OBODY(v_x)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,axiom,
( hAPP(c_Com_Obody,X1) = c_Option_Ooption_ONone(tc_Com_Ocom)
| c_Com_OWT(c_Com_Ocom_OBODY(X1)) ),
cls_WT_OBody_0 ).
cnf(c_0_34,negated_conjecture,
c_Option_Ooption_ONone(tc_Com_Ocom) != hAPP(c_Com_Obody,v_x),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV905-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n007.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % 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 09:29:06 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.31/0.51 % Version: 3.5.1
% 0.31/0.51 % Preprocessing class: FSLSSLSMSSSNFFN.
% 0.31/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.51 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.31/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.31/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.31/0.51 % Starting sh5l with 300s (1) cores
% 0.31/0.51 % new_bool_1 with pid 748866 completed with status 0
% 0.31/0.51 % Result found by new_bool_1
% 0.31/0.51 % Preprocessing class: FSLSSLSMSSSNFFN.
% 0.31/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.51 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.31/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.31/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.31/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.31/0.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.31/0.51 % Search class: FGHSM-FSLM32-DFFFFFNN
% 0.31/0.51 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.31/0.51 % Starting SubtermCWHack with 28s (1) cores
% 0.31/0.51 % SubtermCWHack with pid 748868 completed with status 0
% 0.31/0.51 % Result found by SubtermCWHack
% 0.31/0.51 % Preprocessing class: FSLSSLSMSSSNFFN.
% 0.31/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.51 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.31/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.31/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.31/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.31/0.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.31/0.51 % Search class: FGHSM-FSLM32-DFFFFFNN
% 0.31/0.51 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.31/0.51 % Starting SubtermCWHack with 28s (1) cores
% 0.31/0.51 % Preprocessing time : 0.005 s
% 0.31/0.51
% 0.31/0.51 % Proof found!
% 0.31/0.51 % SZS status Unsatisfiable
% 0.31/0.51 % SZS output start CNFRefutation
% See solution above
% 0.31/0.51 % Parsed axioms : 486
% 0.31/0.51 % Removed by relevancy pruning/SinE : 167
% 0.31/0.51 % Initial clauses : 319
% 0.31/0.51 % Removed in clause preprocessing : 0
% 0.31/0.51 % Initial clauses in saturation : 319
% 0.31/0.51 % Processed clauses : 1376
% 0.31/0.51 % ...of these trivial : 223
% 0.31/0.51 % ...subsumed : 693
% 0.31/0.51 % ...remaining for further processing : 460
% 0.31/0.51 % Other redundant clauses eliminated : 150
% 0.31/0.51 % Clauses deleted for lack of memory : 0
% 0.31/0.51 % Backward-subsumed : 2
% 0.31/0.51 % Backward-rewritten : 11
% 0.31/0.51 % Generated clauses : 8734
% 0.31/0.51 % ...of the previous two non-redundant : 5175
% 0.31/0.51 % ...aggressively subsumed : 0
% 0.31/0.51 % Contextual simplify-reflections : 0
% 0.31/0.51 % Paramodulations : 8574
% 0.31/0.51 % Factorizations : 0
% 0.31/0.51 % NegExts : 0
% 0.31/0.51 % Equation resolutions : 160
% 0.31/0.51 % Disequality decompositions : 0
% 0.31/0.51 % Total rewrite steps : 6327
% 0.31/0.51 % ...of those cached : 5610
% 0.31/0.51 % Propositional unsat checks : 0
% 0.31/0.51 % Propositional check models : 0
% 0.31/0.51 % Propositional check unsatisfiable : 0
% 0.31/0.51 % Propositional clauses : 0
% 0.31/0.51 % Propositional clauses after purity: 0
% 0.31/0.51 % Propositional unsat core size : 0
% 0.31/0.51 % Propositional preprocessing time : 0.000
% 0.31/0.51 % Propositional encoding time : 0.000
% 0.31/0.51 % Propositional solver time : 0.000
% 0.31/0.51 % Success case prop preproc time : 0.000
% 0.31/0.51 % Success case prop encoding time : 0.000
% 0.31/0.51 % Success case prop solver time : 0.000
% 0.31/0.51 % Current number of processed clauses : 447
% 0.31/0.51 % Positive orientable unit clauses : 187
% 0.31/0.51 % Positive unorientable unit clauses: 8
% 0.31/0.51 % Negative unit clauses : 10
% 0.31/0.51 % Non-unit-clauses : 242
% 0.31/0.51 % Current number of unprocessed clauses: 4112
% 0.31/0.51 % ...number of literals in the above : 7975
% 0.31/0.51 % Current number of archived formulas : 0
% 0.31/0.51 % Current number of archived clauses : 13
% 0.31/0.51 % Clause-clause subsumption calls (NU) : 12402
% 0.31/0.51 % Rec. Clause-clause subsumption calls : 12196
% 0.31/0.51 % Non-unit clause-clause subsumptions : 649
% 0.31/0.51 % Unit Clause-clause subsumption calls : 99
% 0.31/0.51 % Rewrite failures with RHS unbound : 0
% 0.31/0.51 % BW rewrite match attempts : 1626
% 0.31/0.51 % BW rewrite match successes : 71
% 0.31/0.51 % Condensation attempts : 0
% 0.31/0.51 % Condensation successes : 0
% 0.31/0.51 % Termbank termtop insertions : 116380
% 0.31/0.51 % Search garbage collected termcells : 1308
% 0.31/0.51
% 0.31/0.51 % -------------------------------------------------
% 0.31/0.51 % User time : 0.065 s
% 0.31/0.51 % System time : 0.007 s
% 0.31/0.51 % Total time : 0.072 s
% 0.31/0.51 % Maximum resident set size: 4276 pages
% 0.31/0.51
% 0.31/0.51 % -------------------------------------------------
% 0.31/0.51 % User time : 0.078 s
% 0.31/0.51 % System time : 0.013 s
% 0.31/0.51 % Total time : 0.090 s
% 0.31/0.51 % Maximum resident set size: 4864 pages
% 0.31/0.51 % E exiting
%------------------------------------------------------------------------------