%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : HEN011-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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 12:45:49 PM UTC 2026
% Result : Unsatisfiable 1.91s 0.72s
% Output : CNFRefutation 1.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 12
% Syntax : Number of clauses : 89 ( 71 unt; 0 nHn; 52 RR)
% Number of literals : 112 ( 81 equ; 27 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 87 ( 24 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(quotient_less_equal1,axiom,
( ~ less_equal(X1,X2)
| divide(X1,X2) = zero ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal1) ).
cnf(quotient_smaller_than_numerator,axiom,
less_equal(divide(X1,X2),X1),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_smaller_than_numerator) ).
cnf(less_equal_and_equal,axiom,
( ~ less_equal(X2,X1)
| ~ less_equal(X1,X2)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',less_equal_and_equal) ).
cnf(quotient_less_equal2,axiom,
( divide(X1,X2) != zero
| less_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal2) ).
cnf(quotient_property,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_property) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X1),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',zero_is_smallest) ).
cnf(identity_is_largest,axiom,
less_equal(X1,identity),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',identity_is_largest) ).
cnf(identity_divide_b,hypothesis,
divide(identity,b) = d,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity_divide_b) ).
cnf(identity_divide_d,hypothesis,
divide(identity,d) = g,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity_divide_d) ).
cnf(identity_divide_a,hypothesis,
divide(identity,a) = c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity_divide_a) ).
cnf(identity_divide_c,hypothesis,
divide(identity,c) = e,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity_divide_c) ).
cnf(prove_commutativity,negated_conjecture,
divide(c,g) != divide(d,e),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_commutativity) ).
cnf(c_0_12,plain,
( ~ less_equal(X1,X2)
| divide(X1,X2) = zero ),
inference(fof_simplification,[status(thm)],[quotient_less_equal1]) ).
cnf(c_0_13,plain,
( ~ less_equal(X1,X2)
| divide(X1,X2) = zero ),
c_0_12 ).
cnf(c_0_14,axiom,
less_equal(divide(X1,X2),X1),
quotient_smaller_than_numerator ).
cnf(c_0_15,plain,
( ~ less_equal(X2,X1)
| ~ less_equal(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[less_equal_and_equal]) ).
cnf(c_0_16,plain,
( divide(X1,X2) != zero
| less_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[quotient_less_equal2]) ).
cnf(c_0_17,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
quotient_property ).
cnf(c_0_18,plain,
divide(divide(X1,X2),X1) = zero,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,axiom,
less_equal(zero,X1),
zero_is_smallest ).
cnf(c_0_20,plain,
( ~ less_equal(X2,X1)
| ~ less_equal(X1,X2)
| X1 = X2 ),
c_0_15 ).
cnf(c_0_21,axiom,
less_equal(X1,identity),
identity_is_largest ).
cnf(c_0_22,plain,
( divide(X1,X2) != zero
| less_equal(X1,X2) ),
c_0_16 ).
cnf(c_0_23,plain,
less_equal(divide(divide(X1,X1),divide(X2,X1)),zero),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
divide(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_13,c_0_19]) ).
cnf(c_0_25,plain,
( ~ less_equal(divide(divide(X1,X3),X2),divide(divide(X1,X2),divide(X3,X2)))
| divide(divide(X1,X2),divide(X3,X2)) = divide(divide(X1,X3),X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_26,hypothesis,
divide(identity,b) = d,
identity_divide_b ).
cnf(c_0_27,plain,
divide(X1,identity) = zero,
inference(spm,[status(thm)],[c_0_13,c_0_21]) ).
cnf(c_0_28,plain,
( ~ less_equal(X1,divide(X1,X2))
| divide(X1,X2) = X1 ),
inference(spm,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_29,plain,
( ~ less_equal(X1,X2)
| divide(X2,X1) != zero
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_20,c_0_22]) ).
cnf(c_0_30,plain,
less_equal(divide(divide(X1,X1),zero),zero),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,hypothesis,
divide(identity,d) = g,
identity_divide_d ).
cnf(c_0_32,hypothesis,
divide(divide(X1,b),d) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_24]),c_0_27]),c_0_24]),c_0_19])]) ).
cnf(c_0_33,plain,
( divide(X1,divide(X1,X2)) != zero
| divide(X1,X2) = X1 ),
inference(spm,[status(thm)],[c_0_28,c_0_22]) ).
cnf(c_0_34,plain,
divide(divide(X1,X1),zero) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_24])]) ).
cnf(c_0_35,hypothesis,
less_equal(divide(divide(X1,d),g),zero),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_31]),c_0_27]),c_0_24]) ).
cnf(c_0_36,hypothesis,
divide(identity,a) = c,
identity_divide_a ).
cnf(c_0_37,hypothesis,
divide(divide(X1,d),divide(b,d)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_32]),c_0_19])]) ).
cnf(c_0_38,plain,
( ~ less_equal(divide(divide(X1,zero),X2),divide(divide(X1,X2),zero))
| divide(divide(X1,X2),zero) = divide(divide(X1,zero),X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_39,plain,
divide(X1,X1) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_34])]) ).
cnf(c_0_40,plain,
divide(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)) = zero,
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_41,hypothesis,
divide(divide(X1,d),g) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_35]),c_0_19])]) ).
cnf(c_0_42,hypothesis,
divide(divide(X1,a),c) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_36]),c_0_27]),c_0_24]),c_0_27]),c_0_24]),c_0_19])]) ).
cnf(c_0_43,hypothesis,
divide(identity,c) = e,
identity_divide_c ).
cnf(c_0_44,plain,
( divide(X1,X2) != zero
| divide(X2,X1) != zero
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_29,c_0_22]) ).
cnf(c_0_45,hypothesis,
divide(g,divide(b,d)) = zero,
inference(spm,[status(thm)],[c_0_37,c_0_31]) ).
cnf(c_0_46,plain,
divide(divide(X1,divide(X1,zero)),zero) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_19])]) ).
cnf(c_0_47,hypothesis,
divide(divide(divide(X1,g),divide(d,g)),zero) = zero,
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_48,hypothesis,
divide(divide(X1,c),divide(a,c)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_42]),c_0_19])]) ).
cnf(c_0_49,hypothesis,
less_equal(divide(divide(X1,c),e),zero),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_43]),c_0_27]),c_0_24]) ).
cnf(c_0_50,hypothesis,
divide(b,d) = g,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_41])]) ).
cnf(c_0_51,plain,
divide(X1,divide(X1,zero)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_46]),c_0_46])]) ).
cnf(c_0_52,hypothesis,
divide(divide(X1,g),divide(d,g)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_47]),c_0_24])]) ).
cnf(c_0_53,hypothesis,
divide(e,divide(a,c)) = zero,
inference(spm,[status(thm)],[c_0_48,c_0_43]) ).
cnf(c_0_54,hypothesis,
divide(divide(X1,c),e) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_49]),c_0_19])]) ).
cnf(c_0_55,plain,
divide(divide(X1,X2),divide(identity,X2)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_27]),c_0_24]),c_0_24]),c_0_19])]) ).
cnf(c_0_56,hypothesis,
divide(g,b) = zero,
inference(spm,[status(thm)],[c_0_18,c_0_50]) ).
cnf(c_0_57,plain,
divide(X1,zero) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_51]),c_0_18])]) ).
cnf(c_0_58,hypothesis,
( divide(divide(d,g),divide(X1,g)) != zero
| divide(d,g) = divide(X1,g) ),
inference(spm,[status(thm)],[c_0_44,c_0_52]) ).
cnf(c_0_59,hypothesis,
divide(a,c) = e,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_53]),c_0_54])]) ).
cnf(c_0_60,hypothesis,
divide(divide(X1,e),divide(c,e)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_54]),c_0_19])]) ).
cnf(c_0_61,plain,
( divide(divide(identity,X1),divide(X2,X1)) != zero
| divide(identity,X1) = divide(X2,X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_55]) ).
cnf(c_0_62,hypothesis,
divide(divide(X1,b),divide(divide(X1,g),b)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_56]),c_0_57]) ).
cnf(c_0_63,hypothesis,
divide(d,g) = divide(identity,g),
inference(spm,[status(thm)],[c_0_58,c_0_55]) ).
cnf(c_0_64,hypothesis,
divide(e,a) = zero,
inference(spm,[status(thm)],[c_0_18,c_0_59]) ).
cnf(c_0_65,hypothesis,
( divide(divide(c,e),divide(X1,e)) != zero
| divide(c,e) = divide(X1,e) ),
inference(spm,[status(thm)],[c_0_44,c_0_60]) ).
cnf(c_0_66,hypothesis,
divide(divide(identity,g),b) = d,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_26]) ).
cnf(c_0_67,hypothesis,
less_equal(divide(identity,g),d),
inference(spm,[status(thm)],[c_0_14,c_0_63]) ).
cnf(c_0_68,hypothesis,
divide(divide(X1,a),divide(divide(X1,e),a)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_64]),c_0_57]) ).
cnf(c_0_69,hypothesis,
divide(c,e) = divide(identity,e),
inference(spm,[status(thm)],[c_0_65,c_0_55]) ).
cnf(c_0_70,plain,
divide(divide(divide(X1,X2),zero),divide(divide(X1,divide(X2,X3)),X2)) = zero,
inference(spm,[status(thm)],[c_0_40,c_0_18]) ).
cnf(c_0_71,hypothesis,
divide(divide(divide(identity,X1),divide(c,X1)),divide(e,X1)) = zero,
inference(spm,[status(thm)],[c_0_40,c_0_43]) ).
cnf(c_0_72,hypothesis,
divide(identity,g) = d,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_66]),c_0_67])]) ).
cnf(c_0_73,hypothesis,
divide(divide(identity,e),a) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_68]),c_0_36]) ).
cnf(c_0_74,hypothesis,
less_equal(divide(identity,e),c),
inference(spm,[status(thm)],[c_0_14,c_0_69]) ).
cnf(c_0_75,plain,
divide(divide(X1,X2),divide(divide(X1,divide(X2,X3)),X2)) = zero,
inference(rw,[status(thm)],[c_0_70,c_0_57]) ).
cnf(c_0_76,hypothesis,
divide(divide(d,divide(c,g)),divide(e,g)) = zero,
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_77,hypothesis,
divide(divide(divide(identity,X1),divide(d,X1)),divide(g,X1)) = zero,
inference(spm,[status(thm)],[c_0_40,c_0_31]) ).
cnf(c_0_78,hypothesis,
divide(identity,e) = c,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_73]),c_0_74])]) ).
cnf(c_0_79,hypothesis,
divide(divide(d,divide(c,g)),e) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_24]),c_0_57]) ).
cnf(c_0_80,hypothesis,
divide(divide(c,divide(d,e)),divide(g,e)) = zero,
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_81,hypothesis,
divide(divide(d,e),divide(divide(c,g),e)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_79]),c_0_19])]) ).
cnf(c_0_82,negated_conjecture,
divide(c,g) != divide(d,e),
inference(fof_simplification,[status(thm)],[prove_commutativity]) ).
cnf(c_0_83,hypothesis,
divide(divide(c,divide(d,e)),g) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_80]),c_0_24]),c_0_57]) ).
cnf(c_0_84,hypothesis,
divide(divide(d,e),divide(c,g)) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_81]),c_0_24]),c_0_57]) ).
cnf(c_0_85,negated_conjecture,
divide(c,g) != divide(d,e),
c_0_82 ).
cnf(c_0_86,hypothesis,
divide(divide(c,g),divide(divide(d,e),g)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_83]),c_0_19])]) ).
cnf(c_0_87,hypothesis,
divide(divide(c,g),divide(d,e)) != zero,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_84]),c_0_85]) ).
cnf(c_0_88,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_86]),c_0_24]),c_0_57]),c_0_87]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN011-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n011.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 20:46:41 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/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
% 1.91/0.72 % Version: 3.5.1
% 1.91/0.72 % Preprocessing class: FSMSSMSMSSSNFFN.
% 1.91/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.91/0.72 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.91/0.72 % Starting new_bool_3 with 300s (1) cores
% 1.91/0.72 % Starting new_bool_1 with 300s (1) cores
% 1.91/0.72 % Starting sh5l with 300s (1) cores
% 1.91/0.72 % new_bool_3 with pid 151710 completed with status 9
% 1.91/0.72 % new_bool_1 with pid 151711 completed with status 9
% 1.91/0.72 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 151709 completed with status 0
% 1.91/0.72 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 1.91/0.72 % Preprocessing class: FSMSSMSMSSSNFFN.
% 1.91/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.91/0.72 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.91/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.91/0.72 % No SInE strategy applied
% 1.91/0.72 % Search class: FHUSM-FFSS22-MFFFFFNN
% 1.91/0.72 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.91/0.72 % Starting SubtermCWHack with 136s (1) cores
% 1.91/0.72 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1.91/0.72 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 1.91/0.72 % Starting new_bool_3 with 136s (1) cores
% 1.91/0.72 % Starting new_bool_1 with 136s (1) cores
% 1.91/0.72 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 151716 completed with status 0
% 1.91/0.72 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 1.91/0.72 % Preprocessing class: FSMSSMSMSSSNFFN.
% 1.91/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.91/0.72 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.91/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.91/0.72 % No SInE strategy applied
% 1.91/0.72 % Search class: FHUSM-FFSS22-MFFFFFNN
% 1.91/0.72 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.91/0.72 % Starting SubtermCWHack with 136s (1) cores
% 1.91/0.72 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1.91/0.72 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 1.91/0.72 % Preprocessing time : 0.001 s
% 1.91/0.72 % Presaturation interreduction done
% 1.91/0.72
% 1.91/0.72 % Proof found!
% 1.91/0.72 % SZS status Unsatisfiable
% 1.91/0.72 % SZS output start CNFRefutation
% See solution above
% 1.91/0.72 % Parsed axioms : 13
% 1.91/0.72 % Removed by relevancy pruning/SinE : 0
% 1.91/0.72 % Initial clauses : 13
% 1.91/0.72 % Removed in clause preprocessing : 0
% 1.91/0.72 % Initial clauses in saturation : 13
% 1.91/0.72 % Processed clauses : 2985
% 1.91/0.72 % ...of these trivial : 369
% 1.91/0.72 % ...subsumed : 1764
% 1.91/0.72 % ...remaining for further processing : 852
% 1.91/0.72 % Other redundant clauses eliminated : 0
% 1.91/0.72 % Clauses deleted for lack of memory : 0
% 1.91/0.72 % Backward-subsumed : 205
% 1.91/0.72 % Backward-rewritten : 254
% 1.91/0.72 % Generated clauses : 46469
% 1.91/0.72 % ...of the previous two non-redundant : 24571
% 1.91/0.72 % ...aggressively subsumed : 0
% 1.91/0.72 % Contextual simplify-reflections : 2
% 1.91/0.72 % Paramodulations : 46469
% 1.91/0.72 % Factorizations : 0
% 1.91/0.72 % NegExts : 0
% 1.91/0.72 % Equation resolutions : 0
% 1.91/0.72 % Disequality decompositions : 0
% 1.91/0.72 % Total rewrite steps : 88653
% 1.91/0.72 % ...of those cached : 79070
% 1.91/0.72 % Propositional unsat checks : 0
% 1.91/0.72 % Propositional check models : 0
% 1.91/0.72 % Propositional check unsatisfiable : 0
% 1.91/0.72 % Propositional clauses : 0
% 1.91/0.72 % Propositional clauses after purity: 0
% 1.91/0.72 % Propositional unsat core size : 0
% 1.91/0.72 % Propositional preprocessing time : 0.000
% 1.91/0.72 % Propositional encoding time : 0.000
% 1.91/0.72 % Propositional solver time : 0.000
% 1.91/0.72 % Success case prop preproc time : 0.000
% 1.91/0.72 % Success case prop encoding time : 0.000
% 1.91/0.72 % Success case prop solver time : 0.000
% 1.91/0.72 % Current number of processed clauses : 381
% 1.91/0.72 % Positive orientable unit clauses : 242
% 1.91/0.72 % Positive unorientable unit clauses: 0
% 1.91/0.72 % Negative unit clauses : 5
% 1.91/0.72 % Non-unit-clauses : 134
% 1.91/0.72 % Current number of unprocessed clauses: 20170
% 1.91/0.72 % ...number of literals in the above : 34308
% 1.91/0.72 % Current number of archived formulas : 0
% 1.91/0.72 % Current number of archived clauses : 471
% 1.91/0.72 % Clause-clause subsumption calls (NU) : 16703
% 1.91/0.72 % Rec. Clause-clause subsumption calls : 16172
% 1.91/0.72 % Non-unit clause-clause subsumptions : 1756
% 1.91/0.72 % Unit Clause-clause subsumption calls : 1515
% 1.91/0.72 % Rewrite failures with RHS unbound : 0
% 1.91/0.72 % BW rewrite match attempts : 850
% 1.91/0.72 % BW rewrite match successes : 135
% 1.91/0.72 % Condensation attempts : 0
% 1.91/0.72 % Condensation successes : 0
% 1.91/0.72 % Termbank termtop insertions : 841057
% 1.91/0.72 % Search garbage collected termcells : 12
% 1.91/0.72
% 1.91/0.72 % -------------------------------------------------
% 1.91/0.72 % User time : 0.273 s
% 1.91/0.72 % System time : 0.018 s
% 1.91/0.72 % Total time : 0.291 s
% 1.91/0.72 % Maximum resident set size: 3640 pages
% 1.91/0.72
% 1.91/0.72 % -------------------------------------------------
% 1.91/0.72 % User time : 1.518 s
% 1.91/0.72 % System time : 0.137 s
% 1.91/0.72 % Total time : 1.656 s
% 1.91/0.72 % Maximum resident set size: 4864 pages
% 1.91/0.72 % E exiting
%------------------------------------------------------------------------------