%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HEN009-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 : n026.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:38 PM UTC 2026
% Result : Unsatisfiable 0.19s 0.55s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 13
% Syntax : Number of clauses : 102 ( 62 unt; 0 nHn; 64 RR)
% Number of literals : 176 ( 28 equ; 78 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 : 180 ( 36 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_idQa,hypothesis,
quotient(identity,idQa,idQ_idQa),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity_divide_idQa) ).
cnf(identity_divide_a,hypothesis,
quotient(identity,a,idQa),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity_divide_a) ).
cnf(identity_divide_idQ_idQa,hypothesis,
quotient(identity,idQ_idQa,idQ__idQ_idQa),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity_divide_idQ_idQa) ).
cnf(prove_one_inversion_equals_three,negated_conjecture,
idQa != idQ__idQ_idQa,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_one_inversion_equals_three) ).
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(divide(X1,divide(X1,zero)),zero,zero),
inference(spm,[status(thm)],[c_0_17,c_0_42]) ).
cnf(c_0_44,plain,
less_equal(divide(X1,divide(X1,zero)),zero),
inference(spm,[status(thm)],[c_0_33,c_0_43]) ).
cnf(c_0_45,plain,
divide(X1,divide(X1,zero)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_44]),c_0_23])]) ).
cnf(c_0_46,plain,
quotient(X1,divide(X1,zero),zero),
inference(spm,[status(thm)],[c_0_17,c_0_45]) ).
cnf(c_0_47,plain,
( ~ quotient(X1,X2,X4)
| ~ quotient(X1,X2,X3)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[well_defined]) ).
cnf(c_0_48,axiom,
less_equal(X1,identity),
identity_is_largest ).
cnf(c_0_49,plain,
( ~ quotient(X4,X3,X1)
| ~ quotient(X4,X2,divide(X3,X5))
| less_equal(divide(X1,divide(X2,X3)),zero) ),
inference(spm,[status(thm)],[c_0_24,c_0_17]) ).
cnf(c_0_50,hypothesis,
quotient(identity,idQa,idQ_idQa),
identity_divide_idQa ).
cnf(c_0_51,plain,
less_equal(X1,divide(X1,zero)),
inference(spm,[status(thm)],[c_0_33,c_0_46]) ).
cnf(c_0_52,plain,
( ~ quotient(X1,X2,X4)
| ~ quotient(X1,X2,X3)
| X3 = X4 ),
c_0_47 ).
cnf(c_0_53,plain,
quotient(X1,identity,zero),
inference(spm,[status(thm)],[c_0_19,c_0_48]) ).
cnf(c_0_54,hypothesis,
( ~ quotient(identity,X1,divide(idQa,X2))
| less_equal(divide(idQ_idQa,divide(X1,idQa)),zero) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,plain,
divide(X1,zero) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_51]),c_0_20])]) ).
cnf(c_0_56,hypothesis,
( ~ quotient(X2,idQa,X1)
| ~ quotient(X2,identity,divide(idQa,X3))
| less_equal(divide(X1,idQ_idQa),zero) ),
inference(spm,[status(thm)],[c_0_24,c_0_50]) ).
cnf(c_0_57,plain,
( ~ quotient(X2,identity,X1)
| X1 = zero ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_58,hypothesis,
( ~ quotient(identity,X1,idQa)
| less_equal(divide(idQ_idQa,divide(X1,idQa)),zero) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,hypothesis,
quotient(identity,a,idQa),
identity_divide_a ).
cnf(c_0_60,hypothesis,
( ~ quotient(X1,identity,divide(idQa,X2))
| less_equal(divide(divide(X1,idQa),idQ_idQa),zero) ),
inference(spm,[status(thm)],[c_0_56,c_0_17]) ).
cnf(c_0_61,plain,
divide(X1,identity) = zero,
inference(spm,[status(thm)],[c_0_57,c_0_17]) ).
cnf(c_0_62,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_63,hypothesis,
less_equal(divide(idQ_idQa,divide(a,idQa)),zero),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_64,hypothesis,
less_equal(divide(divide(X1,idQa),idQ_idQa),zero),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_53])]) ).
cnf(c_0_65,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_62,c_0_17]) ).
cnf(c_0_66,hypothesis,
quotient(identity,idQ_idQa,idQ__idQ_idQa),
identity_divide_idQ_idQa ).
cnf(c_0_67,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_68,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_63]),c_0_23])]) ).
cnf(c_0_69,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_64]),c_0_23])]) ).
cnf(c_0_70,hypothesis,
( ~ quotient(identity,X1,X2)
| less_equal(divide(idQ__idQ_idQa,divide(X1,idQ_idQa)),divide(X2,idQ_idQa)) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_71,hypothesis,
( ~ quotient(X2,idQ_idQa,X1)
| less_equal(divide(X1,idQ__idQ_idQa),zero) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_66]),c_0_53])]) ).
cnf(c_0_72,hypothesis,
quotient(idQ_idQa,divide(a,idQa),zero),
inference(spm,[status(thm)],[c_0_17,c_0_68]) ).
cnf(c_0_73,hypothesis,
quotient(divide(X1,idQa),idQ_idQa,zero),
inference(spm,[status(thm)],[c_0_17,c_0_69]) ).
cnf(c_0_74,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_67,c_0_59]),c_0_53])]) ).
cnf(c_0_75,hypothesis,
less_equal(divide(idQ__idQ_idQa,divide(idQa,idQ_idQa)),zero),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_50]),c_0_36]) ).
cnf(c_0_76,hypothesis,
less_equal(divide(divide(X1,idQ_idQa),idQ__idQ_idQa),zero),
inference(spm,[status(thm)],[c_0_71,c_0_17]) ).
cnf(c_0_77,plain,
( ~ quotient(divide(X2,X3),X2,X1)
| X1 = zero ),
inference(spm,[status(thm)],[c_0_52,c_0_22]) ).
cnf(c_0_78,hypothesis,
less_equal(idQ_idQa,divide(a,idQa)),
inference(spm,[status(thm)],[c_0_33,c_0_72]) ).
cnf(c_0_79,hypothesis,
less_equal(divide(X1,idQa),idQ_idQa),
inference(spm,[status(thm)],[c_0_33,c_0_73]) ).
cnf(c_0_80,hypothesis,
less_equal(divide(divide(X1,a),idQa),zero),
inference(spm,[status(thm)],[c_0_74,c_0_17]) ).
cnf(c_0_81,hypothesis,
divide(idQ__idQ_idQa,divide(idQa,idQ_idQa)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_75]),c_0_23])]) ).
cnf(c_0_82,hypothesis,
divide(divide(X1,idQ_idQa),idQ__idQ_idQa) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_76]),c_0_23])]) ).
cnf(c_0_83,plain,
divide(divide(X1,X2),X1) = zero,
inference(spm,[status(thm)],[c_0_77,c_0_17]) ).
cnf(c_0_84,hypothesis,
divide(a,idQa) = idQ_idQa,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_78]),c_0_79])]) ).
cnf(c_0_85,hypothesis,
divide(divide(X1,a),idQa) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_80]),c_0_23])]) ).
cnf(c_0_86,hypothesis,
quotient(idQ__idQ_idQa,divide(idQa,idQ_idQa),zero),
inference(spm,[status(thm)],[c_0_17,c_0_81]) ).
cnf(c_0_87,hypothesis,
quotient(divide(X1,idQ_idQa),idQ__idQ_idQa,zero),
inference(spm,[status(thm)],[c_0_17,c_0_82]) ).
cnf(c_0_88,hypothesis,
( ~ quotient(identity,X1,X2)
| less_equal(divide(idQa,divide(X1,a)),divide(X2,a)) ),
inference(spm,[status(thm)],[c_0_65,c_0_59]) ).
cnf(c_0_89,hypothesis,
divide(idQ_idQa,a) = zero,
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_90,hypothesis,
quotient(divide(X1,a),idQa,zero),
inference(spm,[status(thm)],[c_0_17,c_0_85]) ).
cnf(c_0_91,hypothesis,
less_equal(idQ__idQ_idQa,divide(idQa,idQ_idQa)),
inference(spm,[status(thm)],[c_0_33,c_0_86]) ).
cnf(c_0_92,hypothesis,
less_equal(divide(X1,idQ_idQa),idQ__idQ_idQa),
inference(spm,[status(thm)],[c_0_33,c_0_87]) ).
cnf(c_0_93,negated_conjecture,
idQa != idQ__idQ_idQa,
inference(fof_simplification,[status(thm)],[prove_one_inversion_equals_three]) ).
cnf(c_0_94,hypothesis,
less_equal(idQa,divide(idQ__idQ_idQa,a)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_66]),c_0_89]),c_0_55]) ).
cnf(c_0_95,hypothesis,
less_equal(divide(X1,a),idQa),
inference(spm,[status(thm)],[c_0_33,c_0_90]) ).
cnf(c_0_96,plain,
( ~ less_equal(X1,divide(X1,X2))
| divide(X1,X2) = X1 ),
inference(spm,[status(thm)],[c_0_29,c_0_20]) ).
cnf(c_0_97,hypothesis,
divide(idQa,idQ_idQa) = idQ__idQ_idQa,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_91]),c_0_92])]) ).
cnf(c_0_98,negated_conjecture,
idQa != idQ__idQ_idQa,
c_0_93 ).
cnf(c_0_99,hypothesis,
divide(idQ__idQ_idQa,a) = idQa,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_94]),c_0_95])]) ).
cnf(c_0_100,hypothesis,
~ less_equal(idQa,idQ__idQ_idQa),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_98]) ).
cnf(c_0_101,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_99]),c_0_100]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN009-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.10/0.37 % Computer : n026.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:49:08 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.43 Running first-order theorem proving
% 0.10/0.43 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
% 0.19/0.55 % Version: 3.5.1
% 0.19/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.55 % Starting sh5l with 300s (1) cores
% 0.19/0.55 % new_bool_1 with pid 571336 completed with status 9
% 0.19/0.55 % new_bool_3 with pid 571335 completed with status 9
% 0.19/0.55 % sh5l with pid 571337 completed with status 9
% 0.19/0.55 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 571334 completed with status 0
% 0.19/0.55 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.55 % No SInE strategy applied
% 0.19/0.55 % Search class: FHUSS-FFSS22-SFFFFFNN
% 0.19/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.55 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.19/0.55 % Starting new_bool_3 with 136s (1) cores
% 0.19/0.55 % Starting new_bool_1 with 136s (1) cores
% 0.19/0.55 % new_bool_1 with pid 571346 completed with status 0
% 0.19/0.55 % Result found by new_bool_1
% 0.19/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.55 % No SInE strategy applied
% 0.19/0.55 % Search class: FHUSS-FFSS22-SFFFFFNN
% 0.19/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.55 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.19/0.55 % Starting new_bool_3 with 136s (1) cores
% 0.19/0.55 % Starting new_bool_1 with 136s (1) cores
% 0.19/0.55 % Preprocessing time : 0.002 s
% 0.19/0.55 % Presaturation interreduction done
% 0.19/0.55
% 0.19/0.55 % Proof found!
% 0.19/0.55 % SZS status Unsatisfiable
% 0.19/0.55 % SZS output start CNFRefutation
% See solution above
% 0.19/0.55 % Parsed axioms : 13
% 0.19/0.55 % Removed by relevancy pruning/SinE : 0
% 0.19/0.55 % Initial clauses : 13
% 0.19/0.55 % Removed in clause preprocessing : 0
% 0.19/0.55 % Initial clauses in saturation : 13
% 0.19/0.55 % Processed clauses : 1068
% 0.19/0.55 % ...of these trivial : 11
% 0.19/0.55 % ...subsumed : 527
% 0.19/0.55 % ...remaining for further processing : 530
% 0.19/0.55 % Other redundant clauses eliminated : 0
% 0.19/0.55 % Clauses deleted for lack of memory : 0
% 0.19/0.55 % Backward-subsumed : 30
% 0.19/0.55 % Backward-rewritten : 118
% 0.19/0.55 % Generated clauses : 2765
% 0.19/0.55 % ...of the previous two non-redundant : 1656
% 0.19/0.55 % ...aggressively subsumed : 0
% 0.19/0.55 % Contextual simplify-reflections : 0
% 0.19/0.55 % Paramodulations : 2765
% 0.19/0.55 % Factorizations : 0
% 0.19/0.55 % NegExts : 0
% 0.19/0.55 % Equation resolutions : 0
% 0.19/0.55 % Disequality decompositions : 0
% 0.19/0.55 % Total rewrite steps : 2204
% 0.19/0.55 % ...of those cached : 2003
% 0.19/0.55 % Propositional unsat checks : 0
% 0.19/0.55 % Propositional check models : 0
% 0.19/0.55 % Propositional check unsatisfiable : 0
% 0.19/0.55 % Propositional clauses : 0
% 0.19/0.55 % Propositional clauses after purity: 0
% 0.19/0.55 % Propositional unsat core size : 0
% 0.19/0.55 % Propositional preprocessing time : 0.000
% 0.19/0.55 % Propositional encoding time : 0.000
% 0.19/0.55 % Propositional solver time : 0.000
% 0.19/0.55 % Success case prop preproc time : 0.000
% 0.19/0.55 % Success case prop encoding time : 0.000
% 0.19/0.55 % Success case prop solver time : 0.000
% 0.19/0.55 % Current number of processed clauses : 369
% 0.19/0.55 % Positive orientable unit clauses : 50
% 0.19/0.55 % Positive unorientable unit clauses: 0
% 0.19/0.55 % Negative unit clauses : 2
% 0.19/0.55 % Non-unit-clauses : 317
% 0.19/0.55 % Current number of unprocessed clauses: 484
% 0.19/0.55 % ...number of literals in the above : 1208
% 0.19/0.55 % Current number of archived formulas : 0
% 0.19/0.55 % Current number of archived clauses : 161
% 0.19/0.55 % Clause-clause subsumption calls (NU) : 21067
% 0.19/0.55 % Rec. Clause-clause subsumption calls : 17781
% 0.19/0.55 % Non-unit clause-clause subsumptions : 556
% 0.19/0.55 % Unit Clause-clause subsumption calls : 314
% 0.19/0.55 % Rewrite failures with RHS unbound : 0
% 0.19/0.55 % BW rewrite match attempts : 352
% 0.19/0.55 % BW rewrite match successes : 45
% 0.19/0.55 % Condensation attempts : 0
% 0.19/0.55 % Condensation successes : 0
% 0.19/0.55 % Termbank termtop insertions : 37177
% 0.19/0.55 % Search garbage collected termcells : 30
% 0.19/0.55
% 0.19/0.55 % -------------------------------------------------
% 0.19/0.55 % User time : 0.075 s
% 0.19/0.55 % System time : 0.005 s
% 0.19/0.55 % Total time : 0.080 s
% 0.19/0.55 % Maximum resident set size: 3388 pages
% 0.19/0.55
% 0.19/0.55 % -------------------------------------------------
% 0.19/0.55 % User time : 0.504 s
% 0.19/0.55 % System time : 0.079 s
% 0.19/0.55 % Total time : 0.583 s
% 0.19/0.55 % Maximum resident set size: 4608 pages
% 0.19/0.55 % E exiting
%------------------------------------------------------------------------------