%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SCT071-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 : n020.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:07:40 PM UTC 2026
% Result : Unsatisfiable 8.37s 1.57s
% Output : CNFRefutation 8.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 47 ( 15 unt; 0 nHn; 36 RR)
% Number of literals : 85 ( 18 equ; 46 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-5 aty)
% Number of functors : 15 ( 15 usr; 3 con; 0-5 aty)
% Number of variables : 124 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_that_0,axiom,
( ~ c_Fun_Oinj__on(X1,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi,tc_nat)
| c_Set_Oimage(X1,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi,tc_nat) != c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),c_Finite__Set_Ocard(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi),tc_nat)
| v_thesis____ ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_that_0) ).
cnf(cls_conjecture_0,negated_conjecture,
~ v_thesis____,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_bij__betw__def_0,axiom,
( ~ c_Fun_Obij__betw(X1,X2,X5,X3,X4)
| c_Fun_Oinj__on(X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_bij__betw__def_0) ).
cnf(cls_bij__betw__inv__into_0,axiom,
( ~ c_Fun_Obij__betw(X2,X1,X5,X3,X4)
| c_Fun_Obij__betw(c_Hilbert__Choice_Oinv__into(X1,X2,X3,X4),X5,X1,X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_bij__betw__inv__into_0) ).
cnf(cls_finite_0,axiom,
( ~ class_Finite__Set_Ofinite_Ofinite(X1)
| c_Finite__Set_Ofinite(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_finite_0) ).
cnf(cls_atLeast0LessThan_0,axiom,
c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),X1,tc_nat) = c_SetInterval_Oord__class_OlessThan(X1,tc_nat),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_atLeast0LessThan_0) ).
cnf(cls_bij__betw__def_1,axiom,
( ~ c_Fun_Obij__betw(X1,X2,X5,X3,X4)
| c_Set_Oimage(X1,X2,X3,X4) = X5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_bij__betw__def_1) ).
cnf(cls_finite__imageD_0,axiom,
( ~ c_Finite__Set_Ofinite(c_Set_Oimage(X3,X1,X2,X4),X4)
| ~ c_Fun_Oinj__on(X3,X1,X2,X4)
| c_Finite__Set_Ofinite(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_finite__imageD_0) ).
cnf(clsarity_bool__Finite__Set_Ofinite_Ofinite,axiom,
class_Finite__Set_Ofinite_Ofinite(tc_bool),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsarity_bool__Finite__Set_Ofinite_Ofinite) ).
cnf(cls_inj__on__inverseI_1,axiom,
( hAPP(X1,hAPP(X2,c_ATP__Linkup_Osko__Fun__Xinj__on__inverseI__1__1(X3,X2,X1,X4,X5))) != c_ATP__Linkup_Osko__Fun__Xinj__on__inverseI__1__1(X3,X2,X1,X4,X5)
| c_Fun_Oinj__on(X2,X3,X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_inj__on__inverseI_1) ).
cnf(cls_ex__bij__betw__nat__finite_0,axiom,
( ~ c_Finite__Set_Ofinite(X1,X2)
| c_Fun_Obij__betw(c_List_Osko__SetInterval__Xex__bij__betw__nat__finite__1__1(X1,X2),c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),c_Finite__Set_Ocard(X1,X2),tc_nat),X1,tc_nat,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_ex__bij__betw__nat__finite_0) ).
cnf(cls_double__complement_0,axiom,
hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_double__complement_0) ).
cnf(c_0_12,plain,
( ~ c_Fun_Oinj__on(X1,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi,tc_nat)
| c_Set_Oimage(X1,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi,tc_nat) != c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),c_Finite__Set_Ocard(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi),tc_nat)
| v_thesis____ ),
inference(fof_simplification,[status(thm)],[cls_that_0]) ).
cnf(c_0_13,negated_conjecture,
~ v_thesis____,
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_14,plain,
( ~ c_Fun_Oinj__on(X1,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi,tc_nat)
| c_Set_Oimage(X1,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi,tc_nat) != c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),c_Finite__Set_Ocard(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi),tc_nat)
| v_thesis____ ),
c_0_12 ).
cnf(c_0_15,negated_conjecture,
~ v_thesis____,
c_0_13 ).
cnf(c_0_16,plain,
( ~ c_Fun_Obij__betw(X1,X2,X5,X3,X4)
| c_Fun_Oinj__on(X1,X2,X3,X4) ),
inference(fof_simplification,[status(thm)],[cls_bij__betw__def_0]) ).
cnf(c_0_17,plain,
( ~ c_Fun_Obij__betw(X2,X1,X5,X3,X4)
| c_Fun_Obij__betw(c_Hilbert__Choice_Oinv__into(X1,X2,X3,X4),X5,X1,X4,X3) ),
inference(fof_simplification,[status(thm)],[cls_bij__betw__inv__into_0]) ).
cnf(c_0_18,plain,
( ~ class_Finite__Set_Ofinite_Ofinite(X1)
| c_Finite__Set_Ofinite(X2,X1) ),
inference(fof_simplification,[status(thm)],[cls_finite_0]) ).
cnf(c_0_19,plain,
( ~ c_Fun_Oinj__on(X1,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi,tc_nat)
| c_Set_Oimage(X1,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi,tc_nat) != c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),c_Finite__Set_Ocard(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi),tc_nat) ),
inference(sr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,axiom,
c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),X1,tc_nat) = c_SetInterval_Oord__class_OlessThan(X1,tc_nat),
cls_atLeast0LessThan_0 ).
cnf(c_0_21,plain,
( ~ c_Fun_Obij__betw(X1,X2,X5,X3,X4)
| c_Fun_Oinj__on(X1,X2,X3,X4) ),
c_0_16 ).
cnf(c_0_22,plain,
( ~ c_Fun_Obij__betw(X2,X1,X5,X3,X4)
| c_Fun_Obij__betw(c_Hilbert__Choice_Oinv__into(X1,X2,X3,X4),X5,X1,X4,X3) ),
c_0_17 ).
cnf(c_0_23,plain,
( ~ c_Fun_Obij__betw(X1,X2,X5,X3,X4)
| c_Set_Oimage(X1,X2,X3,X4) = X5 ),
inference(fof_simplification,[status(thm)],[cls_bij__betw__def_1]) ).
cnf(c_0_24,plain,
( ~ c_Finite__Set_Ofinite(c_Set_Oimage(X3,X1,X2,X4),X4)
| ~ c_Fun_Oinj__on(X3,X1,X2,X4)
| c_Finite__Set_Ofinite(X1,X2) ),
inference(fof_simplification,[status(thm)],[cls_finite__imageD_0]) ).
cnf(c_0_25,plain,
( ~ class_Finite__Set_Ofinite_Ofinite(X1)
| c_Finite__Set_Ofinite(X2,X1) ),
c_0_18 ).
cnf(c_0_26,axiom,
class_Finite__Set_Ofinite_Ofinite(tc_bool),
clsarity_bool__Finite__Set_Ofinite_Ofinite ).
cnf(c_0_27,plain,
( hAPP(X1,hAPP(X2,c_ATP__Linkup_Osko__Fun__Xinj__on__inverseI__1__1(X3,X2,X1,X4,X5))) != c_ATP__Linkup_Osko__Fun__Xinj__on__inverseI__1__1(X3,X2,X1,X4,X5)
| c_Fun_Oinj__on(X2,X3,X4,X5) ),
inference(fof_simplification,[status(thm)],[cls_inj__on__inverseI_1]) ).
cnf(c_0_28,plain,
( ~ c_Fun_Oinj__on(X1,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi,tc_nat)
| c_Set_Oimage(X1,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi,tc_nat) != c_SetInterval_Oord__class_OlessThan(c_Finite__Set_Ocard(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi),tc_nat) ),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,plain,
( ~ c_Fun_Obij__betw(X2,X1,X5,X3,X4)
| c_Fun_Oinj__on(c_Hilbert__Choice_Oinv__into(X1,X2,X3,X4),X5,X4,X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,plain,
( ~ c_Fun_Obij__betw(X1,X2,X5,X3,X4)
| c_Set_Oimage(X1,X2,X3,X4) = X5 ),
c_0_23 ).
cnf(c_0_31,plain,
( ~ c_Finite__Set_Ofinite(X1,X2)
| c_Fun_Obij__betw(c_List_Osko__SetInterval__Xex__bij__betw__nat__finite__1__1(X1,X2),c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),c_Finite__Set_Ocard(X1,X2),tc_nat),X1,tc_nat,X2) ),
inference(fof_simplification,[status(thm)],[cls_ex__bij__betw__nat__finite_0]) ).
cnf(c_0_32,plain,
( ~ c_Finite__Set_Ofinite(c_Set_Oimage(X3,X1,X2,X4),X4)
| ~ c_Fun_Oinj__on(X3,X1,X2,X4)
| c_Finite__Set_Ofinite(X1,X2) ),
c_0_24 ).
cnf(c_0_33,plain,
c_Finite__Set_Ofinite(X1,tc_bool),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,plain,
( hAPP(X1,hAPP(X2,c_ATP__Linkup_Osko__Fun__Xinj__on__inverseI__1__1(X3,X2,X1,X4,X5))) != c_ATP__Linkup_Osko__Fun__Xinj__on__inverseI__1__1(X3,X2,X1,X4,X5)
| c_Fun_Oinj__on(X2,X3,X4,X5) ),
c_0_27 ).
cnf(c_0_35,axiom,
hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X2)) = X2,
cls_double__complement_0 ).
cnf(c_0_36,plain,
( ~ c_Fun_Obij__betw(X2,X1,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_nat,tc_Arrow__Order__Mirabelle_Oindi)
| c_Set_Oimage(c_Hilbert__Choice_Oinv__into(X1,X2,tc_nat,tc_Arrow__Order__Mirabelle_Oindi),c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi,tc_nat) != c_SetInterval_Oord__class_OlessThan(c_Finite__Set_Ocard(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi),tc_nat) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
( ~ c_Fun_Obij__betw(X2,X1,X5,X3,X4)
| c_Set_Oimage(c_Hilbert__Choice_Oinv__into(X1,X2,X3,X4),X5,X4,X3) = X1 ),
inference(spm,[status(thm)],[c_0_30,c_0_22]) ).
cnf(c_0_38,plain,
( ~ c_Finite__Set_Ofinite(X1,X2)
| c_Fun_Obij__betw(c_List_Osko__SetInterval__Xex__bij__betw__nat__finite__1__1(X1,X2),c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),c_Finite__Set_Ocard(X1,X2),tc_nat),X1,tc_nat,X2) ),
c_0_31 ).
cnf(c_0_39,plain,
( ~ c_Fun_Oinj__on(X3,X1,X2,tc_bool)
| c_Finite__Set_Ofinite(X1,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,plain,
c_Fun_Oinj__on(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X2,X3,X4),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
( ~ c_Fun_Obij__betw(X2,X1,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_nat,tc_Arrow__Order__Mirabelle_Oindi)
| X1 != c_SetInterval_Oord__class_OlessThan(c_Finite__Set_Ocard(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi),tc_nat) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
( ~ c_Finite__Set_Ofinite(X1,X2)
| c_Fun_Obij__betw(c_List_Osko__SetInterval__Xex__bij__betw__nat__finite__1__1(X1,X2),c_SetInterval_Oord__class_OlessThan(c_Finite__Set_Ocard(X1,X2),tc_nat),X1,tc_nat,X2) ),
inference(rw,[status(thm)],[c_0_38,c_0_20]) ).
cnf(c_0_43,plain,
c_Finite__Set_Ofinite(X1,X2),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
~ c_Fun_Obij__betw(X1,c_SetInterval_Oord__class_OlessThan(c_Finite__Set_Ocard(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi),tc_nat),c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_nat,tc_Arrow__Order__Mirabelle_Oindi),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_45,plain,
c_Fun_Obij__betw(c_List_Osko__SetInterval__Xex__bij__betw__nat__finite__1__1(X1,X2),c_SetInterval_Oord__class_OlessThan(c_Finite__Set_Ocard(X1,X2),tc_nat),X1,tc_nat,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_46,plain,
$false,
inference(spm,[status(thm)],[c_0_44,c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SCT071-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n020.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 04:30:21 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/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
% 8.37/1.57 % Version: 3.5.1
% 8.37/1.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 8.37/1.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.37/1.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 8.37/1.57 % Starting new_bool_3 with 300s (1) cores
% 8.37/1.57 % Starting new_bool_1 with 300s (1) cores
% 8.37/1.57 % Starting sh5l with 300s (1) cores
% 8.37/1.57 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2001442 completed with status 0
% 8.37/1.57 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 8.37/1.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 8.37/1.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.37/1.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 8.37/1.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 8.37/1.57 % No SInE strategy applied
% 8.37/1.57 % Search class: FGHSM-FSLM32-DFFFFFNN
% 8.37/1.57 % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 8.37/1.57 % Starting SubtermCWHack with 151s (1) cores
% 8.37/1.57 % Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 125s (1) cores
% 8.37/1.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 125s (1) cores
% 8.37/1.57 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 125s (1) cores
% 8.37/1.57 % Starting U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 125s (1) cores
% 8.37/1.57 % G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 2001447 completed with status 0
% 8.37/1.57 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 8.37/1.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 8.37/1.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.37/1.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 8.37/1.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 8.37/1.57 % No SInE strategy applied
% 8.37/1.57 % Search class: FGHSM-FSLM32-DFFFFFNN
% 8.37/1.57 % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 8.37/1.57 % Starting SubtermCWHack with 151s (1) cores
% 8.37/1.57 % Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 125s (1) cores
% 8.37/1.57 % Preprocessing time : 0.017 s
% 8.37/1.57
% 8.37/1.57 % Proof found!
% 8.37/1.57 % SZS status Unsatisfiable
% 8.37/1.57 % SZS output start CNFRefutation
% See solution above
% 8.37/1.57 % Parsed axioms : 837
% 8.37/1.57 % Removed by relevancy pruning/SinE : 0
% 8.37/1.57 % Initial clauses : 837
% 8.37/1.57 % Removed in clause preprocessing : 0
% 8.37/1.57 % Initial clauses in saturation : 837
% 8.37/1.57 % Processed clauses : 3715
% 8.37/1.57 % ...of these trivial : 172
% 8.37/1.57 % ...subsumed : 1829
% 8.37/1.57 % ...remaining for further processing : 1714
% 8.37/1.57 % Other redundant clauses eliminated : 32
% 8.37/1.57 % Clauses deleted for lack of memory : 0
% 8.37/1.57 % Backward-subsumed : 96
% 8.37/1.57 % Backward-rewritten : 152
% 8.37/1.57 % Generated clauses : 32583
% 8.37/1.57 % ...of the previous two non-redundant : 28338
% 8.37/1.57 % ...aggressively subsumed : 0
% 8.37/1.57 % Contextual simplify-reflections : 18
% 8.37/1.57 % Paramodulations : 32489
% 8.37/1.57 % Factorizations : 15
% 8.37/1.57 % NegExts : 0
% 8.37/1.57 % Equation resolutions : 79
% 8.37/1.57 % Disequality decompositions : 0
% 8.37/1.57 % Total rewrite steps : 15518
% 8.37/1.57 % ...of those cached : 13078
% 8.37/1.57 % Propositional unsat checks : 0
% 8.37/1.57 % Propositional check models : 0
% 8.37/1.57 % Propositional check unsatisfiable : 0
% 8.37/1.57 % Propositional clauses : 0
% 8.37/1.57 % Propositional clauses after purity: 0
% 8.37/1.57 % Propositional unsat core size : 0
% 8.37/1.57 % Propositional preprocessing time : 0.000
% 8.37/1.57 % Propositional encoding time : 0.000
% 8.37/1.57 % Propositional solver time : 0.000
% 8.37/1.57 % Success case prop preproc time : 0.000
% 8.37/1.57 % Success case prop encoding time : 0.000
% 8.37/1.57 % Success case prop solver time : 0.000
% 8.37/1.57 % Current number of processed clauses : 1466
% 8.37/1.57 % Positive orientable unit clauses : 260
% 8.37/1.57 % Positive unorientable unit clauses: 17
% 8.37/1.57 % Negative unit clauses : 45
% 8.37/1.57 % Non-unit-clauses : 1144
% 8.37/1.57 % Current number of unprocessed clauses: 25073
% 8.37/1.57 % ...number of literals in the above : 75435
% 8.37/1.57 % Current number of archived formulas : 0
% 8.37/1.57 % Current number of archived clauses : 248
% 8.37/1.57 % Clause-clause subsumption calls (NU) : 184998
% 8.37/1.57 % Rec. Clause-clause subsumption calls : 129922
% 8.37/1.57 % Non-unit clause-clause subsumptions : 1525
% 8.37/1.57 % Unit Clause-clause subsumption calls : 7335
% 8.37/1.57 % Rewrite failures with RHS unbound : 0
% 8.37/1.57 % BW rewrite match attempts : 1962
% 8.37/1.57 % BW rewrite match successes : 149
% 8.37/1.57 % Condensation attempts : 0
% 8.37/1.57 % Condensation successes : 0
% 8.37/1.57 % Termbank termtop insertions : 564290
% 8.37/1.57 % Search garbage collected termcells : 1528
% 8.37/1.57
% 8.37/1.57 % -------------------------------------------------
% 8.37/1.57 % User time : 1.027 s
% 8.37/1.57 % System time : 0.053 s
% 8.37/1.57 % Total time : 1.080 s
% 8.37/1.57 % Maximum resident set size: 5016 pages
% 8.37/1.57
% 8.37/1.57 % -------------------------------------------------
% 8.37/1.57 % User time : 5.133 s
% 8.37/1.57 % System time : 0.217 s
% 8.37/1.57 % Total time : 5.350 s
% 8.37/1.57 % Maximum resident set size: 5120 pages
% 8.37/1.57 % E exiting
%------------------------------------------------------------------------------