%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SCT023-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 : n005.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:35 PM UTC 2026
% Result : Unsatisfiable 4.43s 1.17s
% Output : CNFRefutation 4.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 45 ( 18 unt; 7 nHn; 37 RR)
% Number of literals : 83 ( 7 equ; 39 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-5 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-4 aty)
% Number of variables : 93 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
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_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_conjecture_2,negated_conjecture,
c_in(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_trans__def_0,axiom,
( ~ c_Relation_Otrans(X4,X3)
| ~ c_in(c_Pair(X1,X5,X3,X3),X4,tc_prod(X3,X3))
| ~ c_in(c_Pair(X5,X2,X3,X3),X4,tc_prod(X3,X3))
| c_in(c_Pair(X1,X2,X3,X3),X4,tc_prod(X3,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_trans__def_0) ).
cnf(cls_conjecture_4,negated_conjecture,
~ c_in(c_Pair(X1,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_irrefl__def_0,axiom,
( ~ c_Relation_Oirrefl(X3,X2)
| ~ c_in(c_Pair(X1,X1,X2,X2),X3,tc_prod(X2,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_irrefl__def_0) ).
cnf(cls_conjecture_3,negated_conjecture,
c_Relation_Otrans(v_F(v_P),tc_Arrow__Order__Mirabelle_Oalt),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_irrefl__def_1,axiom,
( c_in(c_Pair(c_ATP__Linkup_Osko__Relation__Xirrefl__def__1__1(X1,X2),c_ATP__Linkup_Osko__Relation__Xirrefl__def__1__1(X1,X2),X2,X2),X1,tc_prod(X2,X2))
| c_Relation_Oirrefl(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_irrefl__def_1) ).
cnf(cls_conjecture_8,negated_conjecture,
( ~ c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,v_i),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| X1 = X2
| c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_8) ).
cnf(cls_in__rel__def_1,axiom,
( ~ c_in(c_Pair(X2,X3,X4,X5),X1,tc_prod(X4,X5))
| c_FunDef_Oin__rel(X1,X2,X3,X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_in__rel__def_1) ).
cnf(cls_conjecture_5,negated_conjecture,
~ c_in(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,v_i),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5) ).
cnf(cls_conjecture_6,negated_conjecture,
( X2 = X1
| c_in(c_Pair(X2,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,X3),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,X3),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_6) ).
cnf(cls_in__rel__def_0,axiom,
( ~ c_FunDef_Oin__rel(X5,X1,X2,X3,X4)
| c_in(c_Pair(X1,X2,X3,X4),X5,tc_prod(X3,X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_in__rel__def_0) ).
cnf(c_0_13,plain,
( ~ c_in(X2,X1,X3)
| hBOOL(hAPP(X1,X2)) ),
inference(fof_simplification,[status(thm)],[cls_mem__def_0]) ).
cnf(c_0_14,plain,
( ~ hBOOL(hAPP(X2,X1))
| c_in(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[cls_mem__def_1]) ).
cnf(c_0_15,plain,
( ~ c_in(X2,X1,X3)
| hBOOL(hAPP(X1,X2)) ),
c_0_13 ).
cnf(c_0_16,negated_conjecture,
c_in(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
cls_conjecture_2 ).
cnf(c_0_17,plain,
( ~ c_Relation_Otrans(X4,X3)
| ~ c_in(c_Pair(X1,X5,X3,X3),X4,tc_prod(X3,X3))
| ~ c_in(c_Pair(X5,X2,X3,X3),X4,tc_prod(X3,X3))
| c_in(c_Pair(X1,X2,X3,X3),X4,tc_prod(X3,X3)) ),
inference(fof_simplification,[status(thm)],[cls_trans__def_0]) ).
cnf(c_0_18,plain,
( ~ hBOOL(hAPP(X2,X1))
| c_in(X1,X2,X3) ),
c_0_14 ).
cnf(c_0_19,negated_conjecture,
hBOOL(hAPP(v_F(v_P),c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
~ c_in(c_Pair(X1,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).
cnf(c_0_21,plain,
( ~ c_Relation_Oirrefl(X3,X2)
| ~ c_in(c_Pair(X1,X1,X2,X2),X3,tc_prod(X2,X2)) ),
inference(fof_simplification,[status(thm)],[cls_irrefl__def_0]) ).
cnf(c_0_22,plain,
( ~ c_Relation_Otrans(X4,X3)
| ~ c_in(c_Pair(X1,X5,X3,X3),X4,tc_prod(X3,X3))
| ~ c_in(c_Pair(X5,X2,X3,X3),X4,tc_prod(X3,X3))
| c_in(c_Pair(X1,X2,X3,X3),X4,tc_prod(X3,X3)) ),
c_0_17 ).
cnf(c_0_23,negated_conjecture,
c_in(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),X1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
c_Relation_Otrans(v_F(v_P),tc_Arrow__Order__Mirabelle_Oalt),
cls_conjecture_3 ).
cnf(c_0_25,negated_conjecture,
~ c_in(c_Pair(X1,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
c_0_20 ).
cnf(c_0_26,axiom,
( c_in(c_Pair(c_ATP__Linkup_Osko__Relation__Xirrefl__def__1__1(X1,X2),c_ATP__Linkup_Osko__Relation__Xirrefl__def__1__1(X1,X2),X2,X2),X1,tc_prod(X2,X2))
| c_Relation_Oirrefl(X1,X2) ),
cls_irrefl__def_1 ).
cnf(c_0_27,plain,
( ~ c_Relation_Oirrefl(X3,X2)
| ~ c_in(c_Pair(X1,X1,X2,X2),X3,tc_prod(X2,X2)) ),
c_0_21 ).
cnf(c_0_28,negated_conjecture,
( ~ c_in(c_Pair(X1,v_a,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| c_in(c_Pair(X1,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_29,negated_conjecture,
c_Relation_Oirrefl(v_F(v_P),tc_Arrow__Order__Mirabelle_Oalt),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( ~ c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,v_i),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| X1 = X2
| c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_8]) ).
cnf(c_0_31,plain,
( ~ c_in(c_Pair(X2,X3,X4,X5),X1,tc_prod(X4,X5))
| c_FunDef_Oin__rel(X1,X2,X3,X4,X5) ),
inference(fof_simplification,[status(thm)],[cls_in__rel__def_1]) ).
cnf(c_0_32,negated_conjecture,
~ c_in(c_Pair(v_b,v_a,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_33,negated_conjecture,
( ~ c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,v_i),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| X1 = X2
| c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
c_0_30 ).
cnf(c_0_34,negated_conjecture,
~ c_in(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,v_i),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
inference(fof_simplification,[status(thm)],[cls_conjecture_5]) ).
cnf(c_0_35,plain,
( ~ c_in(c_Pair(X2,X3,X4,X5),X1,tc_prod(X4,X5))
| c_FunDef_Oin__rel(X1,X2,X3,X4,X5) ),
c_0_31 ).
cnf(c_0_36,negated_conjecture,
( ~ c_in(c_Pair(v_b,v_a,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,v_i),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| v_b = v_a ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( X2 = X1
| c_in(c_Pair(X2,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,X3),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,X3),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
cls_conjecture_6 ).
cnf(c_0_38,negated_conjecture,
~ c_in(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,v_i),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
c_0_34 ).
cnf(c_0_39,plain,
( ~ c_FunDef_Oin__rel(X5,X1,X2,X3,X4)
| c_in(c_Pair(X1,X2,X3,X4),X5,tc_prod(X3,X4)) ),
inference(fof_simplification,[status(thm)],[cls_in__rel__def_0]) ).
cnf(c_0_40,negated_conjecture,
c_FunDef_Oin__rel(v_F(v_P),v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),
inference(spm,[status(thm)],[c_0_35,c_0_16]) ).
cnf(c_0_41,negated_conjecture,
v_b = v_a,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_42,plain,
( ~ c_FunDef_Oin__rel(X5,X1,X2,X3,X4)
| c_in(c_Pair(X1,X2,X3,X4),X5,tc_prod(X3,X4)) ),
c_0_39 ).
cnf(c_0_43,negated_conjecture,
c_FunDef_Oin__rel(v_F(v_P),v_a,v_a,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SCT023-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n005.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Mon Sep 21 04:26:17 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.27/0.52 Running first-order theorem proving
% 0.27/0.52 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.43/1.17 % Version: 3.5.1
% 4.43/1.17 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.43/1.17 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.43/1.17 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.43/1.17 % Starting new_bool_3 with 300s (1) cores
% 4.43/1.17 % Starting new_bool_1 with 300s (1) cores
% 4.43/1.17 % Starting sh5l with 300s (1) cores
% 4.43/1.17 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2546313 completed with status 0
% 4.43/1.17 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 4.43/1.17 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.43/1.17 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.43/1.17 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.43/1.17 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.43/1.17 % No SInE strategy applied
% 4.43/1.17 % Search class: FGHSM-FSLM32-MFFFFFNN
% 4.43/1.17 % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 4.43/1.17 % Starting SubtermCWHack with 136s (1) cores
% 4.43/1.17 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.43/1.17 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 4.43/1.17 % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 4.43/1.17 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 4.43/1.17 % G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with pid 2546324 completed with status 0
% 4.43/1.17 % Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N
% 4.43/1.17 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.43/1.17 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.43/1.17 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.43/1.17 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.43/1.17 % No SInE strategy applied
% 4.43/1.17 % Search class: FGHSM-FSLM32-MFFFFFNN
% 4.43/1.17 % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 4.43/1.17 % Starting SubtermCWHack with 136s (1) cores
% 4.43/1.17 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.43/1.17 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 4.43/1.17 % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 4.43/1.17 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 4.43/1.17 % Preprocessing time : 0.015 s
% 4.43/1.17 % Presaturation interreduction done
% 4.43/1.17
% 4.43/1.17 % Proof found!
% 4.43/1.17 % SZS status Unsatisfiable
% 4.43/1.17 % SZS output start CNFRefutation
% See solution above
% 4.43/1.17 % Parsed axioms : 605
% 4.43/1.17 % Removed by relevancy pruning/SinE : 0
% 4.43/1.17 % Initial clauses : 605
% 4.43/1.17 % Removed in clause preprocessing : 4
% 4.43/1.17 % Initial clauses in saturation : 601
% 4.43/1.17 % Processed clauses : 1184
% 4.43/1.17 % ...of these trivial : 29
% 4.43/1.17 % ...subsumed : 95
% 4.43/1.17 % ...remaining for further processing : 1060
% 4.43/1.17 % Other redundant clauses eliminated : 18
% 4.43/1.17 % Clauses deleted for lack of memory : 0
% 4.43/1.17 % Backward-subsumed : 2
% 4.43/1.17 % Backward-rewritten : 12
% 4.43/1.17 % Generated clauses : 8574
% 4.43/1.17 % ...of the previous two non-redundant : 7466
% 4.43/1.17 % ...aggressively subsumed : 0
% 4.43/1.17 % Contextual simplify-reflections : 0
% 4.43/1.17 % Paramodulations : 8546
% 4.43/1.17 % Factorizations : 4
% 4.43/1.17 % NegExts : 0
% 4.43/1.17 % Equation resolutions : 24
% 4.43/1.17 % Disequality decompositions : 0
% 4.43/1.17 % Total rewrite steps : 2654
% 4.43/1.17 % ...of those cached : 1537
% 4.43/1.17 % Propositional unsat checks : 0
% 4.43/1.17 % Propositional check models : 0
% 4.43/1.17 % Propositional check unsatisfiable : 0
% 4.43/1.17 % Propositional clauses : 0
% 4.43/1.17 % Propositional clauses after purity: 0
% 4.43/1.17 % Propositional unsat core size : 0
% 4.43/1.17 % Propositional preprocessing time : 0.000
% 4.43/1.17 % Propositional encoding time : 0.000
% 4.43/1.17 % Propositional solver time : 0.000
% 4.43/1.17 % Success case prop preproc time : 0.000
% 4.43/1.17 % Success case prop encoding time : 0.000
% 4.43/1.17 % Success case prop solver time : 0.000
% 4.43/1.17 % Current number of processed clauses : 538
% 4.43/1.17 % Positive orientable unit clauses : 138
% 4.43/1.17 % Positive unorientable unit clauses: 8
% 4.43/1.17 % Negative unit clauses : 15
% 4.43/1.17 % Non-unit-clauses : 377
% 4.43/1.17 % Current number of unprocessed clauses: 7382
% 4.43/1.17 % ...number of literals in the above : 18505
% 4.43/1.17 % Current number of archived formulas : 0
% 4.43/1.17 % Current number of archived clauses : 524
% 4.43/1.17 % Clause-clause subsumption calls (NU) : 50463
% 4.43/1.17 % Rec. Clause-clause subsumption calls : 41773
% 4.43/1.17 % Non-unit clause-clause subsumptions : 63
% 4.43/1.17 % Unit Clause-clause subsumption calls : 1841
% 4.43/1.17 % Rewrite failures with RHS unbound : 0
% 4.43/1.17 % BW rewrite match attempts : 561
% 4.43/1.17 % BW rewrite match successes : 82
% 4.43/1.17 % Condensation attempts : 0
% 4.43/1.17 % Condensation successes : 0
% 4.43/1.17 % Termbank termtop insertions : 179170
% 4.43/1.17 % Search garbage collected termcells : 1071
% 4.43/1.17
% 4.43/1.17 % -------------------------------------------------
% 4.43/1.17 % User time : 0.469 s
% 4.43/1.17 % System time : 0.027 s
% 4.43/1.17 % Total time : 0.496 s
% 4.43/1.17 % Maximum resident set size: 4868 pages
% 4.43/1.17
% 4.43/1.17 % -------------------------------------------------
% 4.43/1.17 % User time : 2.667 s
% 4.43/1.17 % System time : 0.131 s
% 4.43/1.17 % Total time : 2.798 s
% 4.43/1.17 % Maximum resident set size: 5376 pages
% 4.43/1.17 % E exiting
%------------------------------------------------------------------------------