%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HEN010-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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:39 PM UTC 2026
% Result : Unsatisfiable 1.32s 0.67s
% Output : CNFRefutation 1.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 13
% Syntax : Number of clauses : 94 ( 57 unt; 0 nHn; 61 RR)
% Number of literals : 164 ( 26 equ; 74 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 164 ( 25 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(divisor_existence,axiom,
( ~ quotient(X1,X2,X3)
| less_equal(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',divisor_existence) ).
cnf(quotient_property,axiom,
( ~ quotient(X3,X4,X8)
| ~ quotient(X6,X5,X7)
| ~ quotient(X1,X4,X6)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X2,X3)
| less_equal(X7,X8) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',quotient_property) ).
cnf(quotient_less_equal,axiom,
( ~ less_equal(X1,X2)
| quotient(X1,X2,zero) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',quotient_less_equal) ).
cnf(closure,axiom,
quotient(X1,X2,divide(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',closure) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',zero_is_smallest) ).
cnf(less_equal_and_equal,axiom,
( ~ less_equal(X2,X1)
| ~ less_equal(X1,X2)
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',less_equal_and_equal) ).
cnf(less_equal_quotient,axiom,
( ~ quotient(X1,X2,zero)
| less_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',less_equal_quotient) ).
cnf(well_defined,axiom,
( ~ quotient(X1,X2,X4)
| ~ quotient(X1,X2,X3)
| X3 = X4 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',well_defined) ).
cnf(identity_is_largest,axiom,
less_equal(X1,identity),
file('/export/starexec/sandbox2/benchmark/Axioms/HEN001-0.ax',identity_is_largest) ).
cnf(identity_divide_a,hypothesis,
quotient(identity,a,idQa),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity_divide_a) ).
cnf(identity_divide_idQa,hypothesis,
quotient(identity,idQa,idQ_idQa),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity_divide_idQa) ).
cnf(identity_divide_idQ_idQa,hypothesis,
quotient(idQa,idQ_idQa,idQa_Q__idQ_idQa),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity_divide_idQ_idQa) ).
cnf(prove_idQa_equals_idQa_Q__idQ_idQa,negated_conjecture,
idQa != idQa_Q__idQ_idQa,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_idQa_equals_idQa_Q__idQ_idQa) ).
cnf(c_0_13,plain,
( ~ quotient(X1,X2,X3)
| less_equal(X3,X1) ),
inference(fof_simplification,[status(thm)],[divisor_existence]) ).
cnf(c_0_14,plain,
( ~ quotient(X3,X4,X8)
| ~ quotient(X6,X5,X7)
| ~ quotient(X1,X4,X6)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X2,X3)
| less_equal(X7,X8) ),
inference(fof_simplification,[status(thm)],[quotient_property]) ).
cnf(c_0_15,plain,
( ~ less_equal(X1,X2)
| quotient(X1,X2,zero) ),
inference(fof_simplification,[status(thm)],[quotient_less_equal]) ).
cnf(c_0_16,plain,
( ~ quotient(X1,X2,X3)
| less_equal(X3,X1) ),
c_0_13 ).
cnf(c_0_17,axiom,
quotient(X1,X2,divide(X1,X2)),
closure ).
cnf(c_0_18,plain,
( ~ quotient(X3,X4,X8)
| ~ quotient(X6,X5,X7)
| ~ quotient(X1,X4,X6)
| ~ quotient(X2,X4,X5)
| ~ quotient(X1,X2,X3)
| less_equal(X7,X8) ),
c_0_14 ).
cnf(c_0_19,plain,
( ~ less_equal(X1,X2)
| quotient(X1,X2,zero) ),
c_0_15 ).
cnf(c_0_20,plain,
less_equal(divide(X1,X2),X1),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( ~ quotient(X7,X6,X4)
| ~ quotient(X7,X5,X1)
| ~ quotient(X6,X5,X2)
| ~ quotient(X4,X5,X3)
| less_equal(divide(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_22,plain,
quotient(divide(X1,X2),X1,zero),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,axiom,
less_equal(zero,X1),
zero_is_smallest ).
cnf(c_0_24,plain,
( ~ quotient(X3,X5,X1)
| ~ quotient(X4,X5,X2)
| ~ quotient(X3,X4,divide(X5,X6))
| less_equal(divide(X1,X2),zero) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
quotient(zero,X1,zero),
inference(spm,[status(thm)],[c_0_19,c_0_23]) ).
cnf(c_0_26,plain,
( ~ quotient(X2,X3,X1)
| ~ quotient(X2,zero,divide(X3,X4))
| less_equal(divide(X1,zero),zero) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,plain,
( ~ less_equal(X2,X1)
| ~ less_equal(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[less_equal_and_equal]) ).
cnf(c_0_28,plain,
( ~ quotient(X1,zero,divide(X2,X3))
| less_equal(divide(divide(X1,X2),zero),zero) ),
inference(spm,[status(thm)],[c_0_26,c_0_17]) ).
cnf(c_0_29,plain,
( ~ less_equal(X2,X1)
| ~ less_equal(X1,X2)
| X1 = X2 ),
c_0_27 ).
cnf(c_0_30,plain,
less_equal(divide(divide(X1,X1),zero),zero),
inference(spm,[status(thm)],[c_0_28,c_0_17]) ).
cnf(c_0_31,plain,
( ~ quotient(X1,X2,zero)
| less_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[less_equal_quotient]) ).
cnf(c_0_32,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_23])]) ).
cnf(c_0_33,plain,
( ~ quotient(X1,X2,zero)
| less_equal(X1,X2) ),
c_0_31 ).
cnf(c_0_34,plain,
quotient(divide(X1,X1),zero,zero),
inference(spm,[status(thm)],[c_0_17,c_0_32]) ).
cnf(c_0_35,plain,
less_equal(divide(X1,X1),zero),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,plain,
divide(X1,X1) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_35]),c_0_23])]) ).
cnf(c_0_37,plain,
quotient(X1,X1,zero),
inference(spm,[status(thm)],[c_0_17,c_0_36]) ).
cnf(c_0_38,plain,
( ~ quotient(X5,X3,X4)
| ~ quotient(X5,X4,X1)
| ~ quotient(X3,X4,X2)
| less_equal(divide(X1,X2),zero) ),
inference(spm,[status(thm)],[c_0_21,c_0_37]) ).
cnf(c_0_39,plain,
( ~ quotient(X2,X3,X1)
| ~ quotient(X2,zero,X3)
| less_equal(divide(X1,zero),zero) ),
inference(spm,[status(thm)],[c_0_38,c_0_25]) ).
cnf(c_0_40,plain,
( ~ quotient(X1,zero,X2)
| less_equal(divide(divide(X1,X2),zero),zero) ),
inference(spm,[status(thm)],[c_0_39,c_0_17]) ).
cnf(c_0_41,plain,
less_equal(divide(divide(X1,divide(X1,zero)),zero),zero),
inference(spm,[status(thm)],[c_0_40,c_0_17]) ).
cnf(c_0_42,plain,
divide(divide(X1,divide(X1,zero)),zero) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_41]),c_0_23])]) ).
cnf(c_0_43,plain,
( ~ quotient(X1,X2,X4)
| ~ quotient(X1,X2,X3)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[well_defined]) ).
cnf(c_0_44,plain,
quotient(divide(X1,divide(X1,zero)),zero,zero),
inference(spm,[status(thm)],[c_0_17,c_0_42]) ).
cnf(c_0_45,plain,
( ~ quotient(X6,X5,X3)
| ~ quotient(X6,X4,X1)
| ~ quotient(X5,X4,X2)
| less_equal(divide(X1,X2),divide(X3,X4)) ),
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_46,axiom,
less_equal(X1,identity),
identity_is_largest ).
cnf(c_0_47,plain,
( ~ quotient(X1,X2,X4)
| ~ quotient(X1,X2,X3)
| X3 = X4 ),
c_0_43 ).
cnf(c_0_48,hypothesis,
quotient(identity,a,idQa),
identity_divide_a ).
cnf(c_0_49,plain,
less_equal(divide(X1,divide(X1,zero)),zero),
inference(spm,[status(thm)],[c_0_33,c_0_44]) ).
cnf(c_0_50,plain,
( ~ quotient(X5,X2,X4)
| ~ quotient(X5,X3,X1)
| less_equal(divide(X1,divide(X2,X3)),divide(X4,X3)) ),
inference(spm,[status(thm)],[c_0_45,c_0_17]) ).
cnf(c_0_51,hypothesis,
quotient(identity,idQa,idQ_idQa),
identity_divide_idQa ).
cnf(c_0_52,plain,
( ~ quotient(X3,X5,X1)
| ~ quotient(X4,X5,X2)
| ~ quotient(X3,X4,zero)
| less_equal(divide(X1,X2),zero) ),
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_53,plain,
quotient(X1,identity,zero),
inference(spm,[status(thm)],[c_0_19,c_0_46]) ).
cnf(c_0_54,plain,
( ~ quotient(X4,X3,X2)
| ~ quotient(X4,X3,X1)
| less_equal(divide(X1,zero),divide(X2,X3)) ),
inference(spm,[status(thm)],[c_0_45,c_0_37]) ).
cnf(c_0_55,hypothesis,
( ~ quotient(identity,a,X1)
| X1 = idQa ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_56,plain,
divide(X1,divide(X1,zero)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_49]),c_0_23])]) ).
cnf(c_0_57,hypothesis,
( ~ quotient(identity,X1,X2)
| less_equal(divide(idQ_idQa,divide(X1,idQa)),divide(X2,idQa)) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_58,hypothesis,
( ~ quotient(X2,idQa,X1)
| less_equal(divide(X1,idQ_idQa),zero) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_51]),c_0_53])]) ).
cnf(c_0_59,hypothesis,
( ~ quotient(identity,a,X1)
| less_equal(divide(idQa,zero),divide(X1,a)) ),
inference(spm,[status(thm)],[c_0_54,c_0_48]) ).
cnf(c_0_60,hypothesis,
divide(identity,a) = idQa,
inference(spm,[status(thm)],[c_0_55,c_0_17]) ).
cnf(c_0_61,plain,
quotient(X1,divide(X1,zero),zero),
inference(spm,[status(thm)],[c_0_17,c_0_56]) ).
cnf(c_0_62,hypothesis,
less_equal(divide(idQ_idQa,divide(a,idQa)),zero),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_48]),c_0_36]) ).
cnf(c_0_63,hypothesis,
less_equal(divide(divide(X1,idQa),idQ_idQa),zero),
inference(spm,[status(thm)],[c_0_58,c_0_17]) ).
cnf(c_0_64,hypothesis,
less_equal(divide(idQa,zero),divide(idQa,a)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_17]),c_0_60]) ).
cnf(c_0_65,plain,
less_equal(X1,divide(X1,zero)),
inference(spm,[status(thm)],[c_0_33,c_0_61]) ).
cnf(c_0_66,hypothesis,
divide(idQ_idQa,divide(a,idQa)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_62]),c_0_23])]) ).
cnf(c_0_67,hypothesis,
divide(divide(X1,idQa),idQ_idQa) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_63]),c_0_23])]) ).
cnf(c_0_68,hypothesis,
( ~ less_equal(divide(idQa,a),divide(idQa,zero))
| divide(idQa,a) = divide(idQa,zero) ),
inference(spm,[status(thm)],[c_0_29,c_0_64]) ).
cnf(c_0_69,plain,
divide(X1,zero) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_65]),c_0_20])]) ).
cnf(c_0_70,hypothesis,
quotient(idQ_idQa,divide(a,idQa),zero),
inference(spm,[status(thm)],[c_0_17,c_0_66]) ).
cnf(c_0_71,hypothesis,
quotient(divide(X1,idQa),idQ_idQa,zero),
inference(spm,[status(thm)],[c_0_17,c_0_67]) ).
cnf(c_0_72,hypothesis,
( ~ quotient(X2,a,X1)
| less_equal(divide(X1,idQa),zero) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_48]),c_0_53])]) ).
cnf(c_0_73,hypothesis,
divide(idQa,a) = idQa,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69]),c_0_69]),c_0_20])]) ).
cnf(c_0_74,plain,
( ~ quotient(X2,X3,X1)
| X1 = divide(X2,X3) ),
inference(spm,[status(thm)],[c_0_47,c_0_17]) ).
cnf(c_0_75,hypothesis,
less_equal(idQ_idQa,divide(a,idQa)),
inference(spm,[status(thm)],[c_0_33,c_0_70]) ).
cnf(c_0_76,hypothesis,
less_equal(divide(X1,idQa),idQ_idQa),
inference(spm,[status(thm)],[c_0_33,c_0_71]) ).
cnf(c_0_77,hypothesis,
less_equal(divide(divide(X1,a),idQa),zero),
inference(spm,[status(thm)],[c_0_72,c_0_17]) ).
cnf(c_0_78,hypothesis,
quotient(idQa,a,idQa),
inference(spm,[status(thm)],[c_0_17,c_0_73]) ).
cnf(c_0_79,plain,
divide(divide(X1,X2),X1) = zero,
inference(spm,[status(thm)],[c_0_74,c_0_22]) ).
cnf(c_0_80,hypothesis,
divide(a,idQa) = idQ_idQa,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_75]),c_0_76])]) ).
cnf(c_0_81,hypothesis,
divide(divide(X1,a),idQa) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_77]),c_0_23])]) ).
cnf(c_0_82,hypothesis,
( ~ quotient(idQa,X1,X2)
| less_equal(divide(idQa,divide(X1,a)),divide(X2,a)) ),
inference(spm,[status(thm)],[c_0_50,c_0_78]) ).
cnf(c_0_83,hypothesis,
quotient(idQa,idQ_idQa,idQa_Q__idQ_idQa),
identity_divide_idQ_idQa ).
cnf(c_0_84,hypothesis,
divide(idQ_idQa,a) = zero,
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_85,hypothesis,
quotient(divide(X1,a),idQa,zero),
inference(spm,[status(thm)],[c_0_17,c_0_81]) ).
cnf(c_0_86,negated_conjecture,
idQa != idQa_Q__idQ_idQa,
inference(fof_simplification,[status(thm)],[prove_idQa_equals_idQa_Q__idQ_idQa]) ).
cnf(c_0_87,hypothesis,
less_equal(idQa,divide(idQa_Q__idQ_idQa,a)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84]),c_0_69]) ).
cnf(c_0_88,hypothesis,
less_equal(divide(X1,a),idQa),
inference(spm,[status(thm)],[c_0_33,c_0_85]) ).
cnf(c_0_89,hypothesis,
less_equal(idQa_Q__idQ_idQa,idQa),
inference(spm,[status(thm)],[c_0_16,c_0_83]) ).
cnf(c_0_90,negated_conjecture,
idQa != idQa_Q__idQ_idQa,
c_0_86 ).
cnf(c_0_91,hypothesis,
divide(idQa_Q__idQ_idQa,a) = idQa,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_87]),c_0_88])]) ).
cnf(c_0_92,hypothesis,
~ less_equal(idQa,idQa_Q__idQ_idQa),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_89]),c_0_90]) ).
cnf(c_0_93,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_91]),c_0_92]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN010-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n002.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 20:49:03 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/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
% 1.32/0.67 % Version: 3.5.1
% 1.32/0.67 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.32/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.32/0.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.32/0.67 % Starting new_bool_3 with 300s (1) cores
% 1.32/0.67 % Starting new_bool_1 with 300s (1) cores
% 1.32/0.67 % Starting sh5l with 300s (1) cores
% 1.32/0.67 % new_bool_3 with pid 1687143 completed with status 9
% 1.32/0.67 % new_bool_1 with pid 1687144 completed with status 9
% 1.32/0.67 % sh5l with pid 1687145 completed with status 9
% 1.32/0.67 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1687142 completed with status 0
% 1.32/0.67 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.32/0.67 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.32/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.32/0.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.32/0.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.32/0.67 % No SInE strategy applied
% 1.32/0.67 % Search class: FHUSS-FFSS22-SFFFFFNN
% 1.32/0.67 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.32/0.67 % Starting SubtermCWHack with 136s (1) cores
% 1.32/0.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.32/0.67 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 1.32/0.67 % Starting new_bool_3 with 136s (1) cores
% 1.32/0.67 % Starting new_bool_1 with 136s (1) cores
% 1.32/0.67 % new_bool_3 with pid 1687150 completed with status 0
% 1.32/0.67 % Result found by new_bool_3
% 1.32/0.67 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.32/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.32/0.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.32/0.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.32/0.67 % No SInE strategy applied
% 1.32/0.67 % Search class: FHUSS-FFSS22-SFFFFFNN
% 1.32/0.67 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.32/0.67 % Starting SubtermCWHack with 136s (1) cores
% 1.32/0.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.32/0.67 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 1.32/0.67 % Starting new_bool_3 with 136s (1) cores
% 1.32/0.67 % Preprocessing time : 0.001 s
% 1.32/0.67 % Presaturation interreduction done
% 1.32/0.67
% 1.32/0.67 % Proof found!
% 1.32/0.67 % SZS status Unsatisfiable
% 1.32/0.67 % SZS output start CNFRefutation
% See solution above
% 1.32/0.67 % Parsed axioms : 13
% 1.32/0.67 % Removed by relevancy pruning/SinE : 0
% 1.32/0.67 % Initial clauses : 13
% 1.32/0.67 % Removed in clause preprocessing : 0
% 1.32/0.67 % Initial clauses in saturation : 13
% 1.32/0.67 % Processed clauses : 3103
% 1.32/0.67 % ...of these trivial : 31
% 1.32/0.67 % ...subsumed : 1967
% 1.32/0.67 % ...remaining for further processing : 1105
% 1.32/0.67 % Other redundant clauses eliminated : 0
% 1.32/0.67 % Clauses deleted for lack of memory : 0
% 1.32/0.67 % Backward-subsumed : 64
% 1.32/0.67 % Backward-rewritten : 298
% 1.32/0.67 % Generated clauses : 8408
% 1.32/0.67 % ...of the previous two non-redundant : 5023
% 1.32/0.67 % ...aggressively subsumed : 0
% 1.32/0.67 % Contextual simplify-reflections : 0
% 1.32/0.67 % Paramodulations : 8408
% 1.32/0.67 % Factorizations : 0
% 1.32/0.67 % NegExts : 0
% 1.32/0.67 % Equation resolutions : 0
% 1.32/0.67 % Disequality decompositions : 0
% 1.32/0.67 % Total rewrite steps : 7036
% 1.32/0.67 % ...of those cached : 6525
% 1.32/0.67 % Propositional unsat checks : 0
% 1.32/0.67 % Propositional check models : 0
% 1.32/0.67 % Propositional check unsatisfiable : 0
% 1.32/0.67 % Propositional clauses : 0
% 1.32/0.67 % Propositional clauses after purity: 0
% 1.32/0.67 % Propositional unsat core size : 0
% 1.32/0.67 % Propositional preprocessing time : 0.000
% 1.32/0.67 % Propositional encoding time : 0.000
% 1.32/0.67 % Propositional solver time : 0.000
% 1.32/0.67 % Success case prop preproc time : 0.000
% 1.32/0.67 % Success case prop encoding time : 0.000
% 1.32/0.67 % Success case prop solver time : 0.000
% 1.32/0.67 % Current number of processed clauses : 730
% 1.32/0.67 % Positive orientable unit clauses : 102
% 1.32/0.67 % Positive unorientable unit clauses: 0
% 1.32/0.67 % Negative unit clauses : 2
% 1.32/0.67 % Non-unit-clauses : 626
% 1.32/0.67 % Current number of unprocessed clauses: 1250
% 1.32/0.67 % ...number of literals in the above : 3105
% 1.32/0.67 % Current number of archived formulas : 0
% 1.32/0.67 % Current number of archived clauses : 375
% 1.32/0.67 % Clause-clause subsumption calls (NU) : 118143
% 1.32/0.67 % Rec. Clause-clause subsumption calls : 89107
% 1.32/0.67 % Non-unit clause-clause subsumptions : 2014
% 1.32/0.67 % Unit Clause-clause subsumption calls : 640
% 1.32/0.67 % Rewrite failures with RHS unbound : 0
% 1.32/0.67 % BW rewrite match attempts : 546
% 1.32/0.67 % BW rewrite match successes : 79
% 1.32/0.67 % Condensation attempts : 0
% 1.32/0.67 % Condensation successes : 0
% 1.32/0.67 % Termbank termtop insertions : 111481
% 1.32/0.67 % Search garbage collected termcells : 30
% 1.32/0.67
% 1.32/0.67 % -------------------------------------------------
% 1.32/0.67 % User time : 0.208 s
% 1.32/0.67 % System time : 0.009 s
% 1.32/0.67 % Total time : 0.217 s
% 1.32/0.67 % Maximum resident set size: 3644 pages
% 1.32/0.67
% 1.32/0.67 % -------------------------------------------------
% 1.32/0.67 % User time : 1.226 s
% 1.32/0.67 % System time : 0.101 s
% 1.32/0.67 % Total time : 1.327 s
% 1.32/0.67 % Maximum resident set size: 4608 pages
% 1.32/0.67 % E exiting
%------------------------------------------------------------------------------