%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP180-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:38:52 PM UTC 2026
% Result : Unsatisfiable 60.64s 9.35s
% Output : CNFRefutation 60.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 15
% Syntax : Number of clauses : 83 ( 83 unt; 0 nHn; 4 RR)
% Number of literals : 83 ( 82 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 149 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(monotony_glb2,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
cnf(monotony_glb1,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_glb1) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
cnf(monotony_lub1,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
cnf(monotony_lub2,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
cnf(associativity_of_glb,axiom,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).
cnf(associativity_of_lub,axiom,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).
cnf(lub_absorbtion,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
cnf(idempotence_of_gld,axiom,
greatest_lower_bound(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',idempotence_of_gld) ).
cnf(prove_p11,negated_conjecture,
multiply(a,multiply(inverse(greatest_lower_bound(a,b)),b)) != least_upper_bound(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p11) ).
cnf(c_0_15,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_16,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_17,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_18,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_19,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_20,plain,
multiply(inverse(inverse(inverse(X1))),X1) = identity,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_20]),c_0_19]) ).
cnf(c_0_22,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_23,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_24,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_25,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_26,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_27,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_28,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_29,plain,
greatest_lower_bound(X1,multiply(X2,X1)) = multiply(greatest_lower_bound(X2,identity),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_17]),c_0_23]) ).
cnf(c_0_30,plain,
greatest_lower_bound(X1,multiply(X1,X2)) = multiply(X1,greatest_lower_bound(identity,X2)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_lub2 ).
cnf(c_0_32,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_16,c_0_21]) ).
cnf(c_0_33,axiom,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
associativity_of_glb ).
cnf(c_0_34,plain,
greatest_lower_bound(X1,least_upper_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,axiom,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
associativity_of_lub ).
cnf(c_0_36,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_37,plain,
least_upper_bound(X1,multiply(X1,X2)) = multiply(X1,least_upper_bound(identity,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_25]) ).
cnf(c_0_38,plain,
multiply(greatest_lower_bound(X1,identity),X1) = multiply(X1,greatest_lower_bound(identity,X1)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_39,plain,
least_upper_bound(X1,multiply(X2,X1)) = multiply(least_upper_bound(X2,identity),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_17]),c_0_27]) ).
cnf(c_0_40,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,X2)))) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_32]) ).
cnf(c_0_41,plain,
greatest_lower_bound(X1,greatest_lower_bound(X2,least_upper_bound(X3,greatest_lower_bound(X1,X2)))) = greatest_lower_bound(X1,X2),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_42,plain,
least_upper_bound(X1,least_upper_bound(greatest_lower_bound(X1,X2),X3)) = least_upper_bound(X1,X3),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,plain,
least_upper_bound(greatest_lower_bound(X1,identity),multiply(X1,greatest_lower_bound(identity,X1))) = multiply(greatest_lower_bound(X1,identity),least_upper_bound(identity,X1)),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
multiply(least_upper_bound(X1,identity),X1) = multiply(X1,least_upper_bound(identity,X1)),
inference(spm,[status(thm)],[c_0_39,c_0_37]) ).
cnf(c_0_45,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_40]),c_0_25]) ).
cnf(c_0_46,plain,
greatest_lower_bound(X1,greatest_lower_bound(multiply(X2,X1),least_upper_bound(X3,multiply(greatest_lower_bound(X2,identity),X1)))) = multiply(greatest_lower_bound(X2,identity),X1),
inference(spm,[status(thm)],[c_0_41,c_0_29]) ).
cnf(c_0_47,plain,
least_upper_bound(X1,multiply(greatest_lower_bound(X1,identity),least_upper_bound(identity,X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_37]),c_0_36]),c_0_25]) ).
cnf(c_0_48,plain,
multiply(X1,greatest_lower_bound(identity,inverse(X1))) = greatest_lower_bound(X1,identity),
inference(spm,[status(thm)],[c_0_30,c_0_32]) ).
cnf(c_0_49,plain,
multiply(greatest_lower_bound(identity,inverse(X1)),X1) = greatest_lower_bound(X1,identity),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_16]),c_0_23]) ).
cnf(c_0_50,plain,
multiply(least_upper_bound(identity,inverse(X1)),X1) = least_upper_bound(X1,identity),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_16]),c_0_27]) ).
cnf(c_0_51,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_18,c_0_21]) ).
cnf(c_0_52,plain,
multiply(least_upper_bound(identity,X1),X1) = multiply(X1,least_upper_bound(identity,X1)),
inference(spm,[status(thm)],[c_0_44,c_0_27]) ).
cnf(c_0_53,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_45]),c_0_21]) ).
cnf(c_0_54,plain,
multiply(greatest_lower_bound(X1,identity),least_upper_bound(identity,X1)) = X1,
inference(rw,[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_46,c_0_47]),c_0_23]),c_0_30]),c_0_26]),c_0_25]),c_0_23]),c_0_34]) ).
cnf(c_0_55,plain,
multiply(inverse(X1),greatest_lower_bound(X1,identity)) = greatest_lower_bound(identity,inverse(X1)),
inference(spm,[status(thm)],[c_0_18,c_0_48]) ).
cnf(c_0_56,axiom,
greatest_lower_bound(X1,X1) = X1,
idempotence_of_gld ).
cnf(c_0_57,plain,
multiply(greatest_lower_bound(identity,X1),inverse(X1)) = greatest_lower_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_21]),c_0_23]) ).
cnf(c_0_58,plain,
multiply(least_upper_bound(identity,X1),inverse(X1)) = least_upper_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_21]),c_0_27]) ).
cnf(c_0_59,plain,
greatest_lower_bound(X1,multiply(X2,multiply(inverse(X3),X1))) = multiply(greatest_lower_bound(X2,X3),multiply(inverse(X3),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_51]),c_0_23]) ).
cnf(c_0_60,plain,
greatest_lower_bound(X1,multiply(X2,multiply(X3,X1))) = multiply(greatest_lower_bound(identity,multiply(X2,X3)),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_15]),c_0_23]) ).
cnf(c_0_61,plain,
multiply(X1,inverse(multiply(X1,least_upper_bound(identity,X1)))) = inverse(least_upper_bound(identity,X1)),
inference(spm,[status(thm)],[c_0_45,c_0_52]) ).
cnf(c_0_62,plain,
inverse(least_upper_bound(identity,X1)) = greatest_lower_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]) ).
cnf(c_0_63,plain,
greatest_lower_bound(X1,greatest_lower_bound(X1,X2)) = greatest_lower_bound(X1,X2),
inference(spm,[status(thm)],[c_0_33,c_0_56]) ).
cnf(c_0_64,plain,
multiply(inverse(greatest_lower_bound(identity,X1)),greatest_lower_bound(identity,inverse(X1))) = inverse(X1),
inference(spm,[status(thm)],[c_0_18,c_0_57]) ).
cnf(c_0_65,plain,
inverse(greatest_lower_bound(X1,identity)) = least_upper_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_54]),c_0_58]) ).
cnf(c_0_66,plain,
greatest_lower_bound(X1,greatest_lower_bound(X2,X1)) = greatest_lower_bound(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_36]),c_0_33]) ).
cnf(c_0_67,plain,
multiply(greatest_lower_bound(identity,multiply(X1,inverse(X2))),X3) = multiply(greatest_lower_bound(X1,X2),multiply(inverse(X2),X3)),
inference(rw,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_68,plain,
multiply(X1,inverse(multiply(X1,least_upper_bound(identity,X1)))) = greatest_lower_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_69,plain,
greatest_lower_bound(identity,inverse(greatest_lower_bound(identity,X1))) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_63]),c_0_32]) ).
cnf(c_0_70,plain,
inverse(greatest_lower_bound(identity,X1)) = least_upper_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]),c_0_26]),c_0_25]) ).
cnf(c_0_71,plain,
inverse(multiply(X1,inverse(X2))) = multiply(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_51,c_0_45]) ).
cnf(c_0_72,plain,
multiply(inverse(X1),least_upper_bound(X2,multiply(X1,X3))) = least_upper_bound(multiply(inverse(X1),X2),X3),
inference(spm,[status(thm)],[c_0_28,c_0_18]) ).
cnf(c_0_73,plain,
multiply(greatest_lower_bound(X1,X2),least_upper_bound(inverse(X2),inverse(X1))) = identity,
inference(rw,[status(thm)],[inference(rw,[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_67,c_0_68]),c_0_69]),c_0_36]),c_0_25]),c_0_70]),c_0_71]),c_0_72]),c_0_25]) ).
cnf(c_0_74,plain,
least_upper_bound(X1,multiply(X2,multiply(X3,X1))) = multiply(least_upper_bound(identity,multiply(X2,X3)),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_15]),c_0_27]) ).
cnf(c_0_75,plain,
multiply(inverse(X1),least_upper_bound(identity,X1)) = least_upper_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_16]),c_0_27]) ).
cnf(c_0_76,plain,
least_upper_bound(inverse(X1),inverse(X2)) = inverse(greatest_lower_bound(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_73]),c_0_25]) ).
cnf(c_0_77,negated_conjecture,
multiply(a,multiply(inverse(greatest_lower_bound(a,b)),b)) != least_upper_bound(a,b),
inference(fof_simplification,[status(thm)],[prove_p11]) ).
cnf(c_0_78,plain,
multiply(least_upper_bound(identity,multiply(X1,X2)),inverse(X2)) = least_upper_bound(inverse(X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_32]),c_0_25]) ).
cnf(c_0_79,plain,
multiply(X1,inverse(greatest_lower_bound(X1,X2))) = least_upper_bound(identity,multiply(X1,inverse(X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_71]),c_0_15]),c_0_72]),c_0_25]),c_0_76]) ).
cnf(c_0_80,negated_conjecture,
multiply(a,multiply(inverse(greatest_lower_bound(a,b)),b)) != least_upper_bound(a,b),
c_0_77 ).
cnf(c_0_81,plain,
multiply(X1,multiply(inverse(greatest_lower_bound(X1,X2)),X2)) = least_upper_bound(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_21]),c_0_15]),c_0_21]) ).
cnf(c_0_82,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_81]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP180-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n007.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:02:36 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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
% 60.64/9.35 % Version: 3.5.1
% 60.64/9.35 % Preprocessing class: FSMSSMSSSSSNFFN.
% 60.64/9.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 60.64/9.35 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 60.64/9.35 % Starting new_bool_3 with 300s (1) cores
% 60.64/9.35 % Starting new_bool_1 with 300s (1) cores
% 60.64/9.35 % Starting sh5l with 300s (1) cores
% 60.64/9.35 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3461180 completed with status 0
% 60.64/9.35 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 60.64/9.35 % Preprocessing class: FSMSSMSSSSSNFFN.
% 60.64/9.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 60.64/9.35 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 60.64/9.35 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 60.64/9.35 % No SInE strategy applied
% 60.64/9.35 % Search class: FUUPM-FFSF21-MFFFFFNN
% 60.64/9.35 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 60.64/9.35 % Starting SubtermCWHack with 136s (1) cores
% 60.64/9.35 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 60.64/9.35 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 60.64/9.35 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 60.64/9.35 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 60.64/9.35 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3461185 completed with status 0
% 60.64/9.35 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 60.64/9.35 % Preprocessing class: FSMSSMSSSSSNFFN.
% 60.64/9.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 60.64/9.35 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 60.64/9.35 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 60.64/9.35 % No SInE strategy applied
% 60.64/9.35 % Search class: FUUPM-FFSF21-MFFFFFNN
% 60.64/9.35 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 60.64/9.35 % Starting SubtermCWHack with 136s (1) cores
% 60.64/9.35 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 60.64/9.35 % Preprocessing time : 0.001 s
% 60.64/9.35 % Presaturation interreduction done
% 60.64/9.35
% 60.64/9.35 % Proof found!
% 60.64/9.35 % SZS status Unsatisfiable
% 60.64/9.35 % SZS output start CNFRefutation
% See solution above
% 60.64/9.35 % Parsed axioms : 16
% 60.64/9.35 % Removed by relevancy pruning/SinE : 0
% 60.64/9.35 % Initial clauses : 16
% 60.64/9.35 % Removed in clause preprocessing : 0
% 60.64/9.35 % Initial clauses in saturation : 16
% 60.64/9.35 % Processed clauses : 11126
% 60.64/9.35 % ...of these trivial : 4114
% 60.64/9.35 % ...subsumed : 5959
% 60.64/9.35 % ...remaining for further processing : 1053
% 60.64/9.35 % Other redundant clauses eliminated : 0
% 60.64/9.35 % Clauses deleted for lack of memory : 0
% 60.64/9.35 % Backward-subsumed : 0
% 60.64/9.35 % Backward-rewritten : 229
% 60.64/9.35 % Generated clauses : 366090
% 60.64/9.35 % ...of the previous two non-redundant : 254977
% 60.64/9.35 % ...aggressively subsumed : 0
% 60.64/9.35 % Contextual simplify-reflections : 0
% 60.64/9.35 % Paramodulations : 366090
% 60.64/9.35 % Factorizations : 0
% 60.64/9.35 % NegExts : 0
% 60.64/9.35 % Equation resolutions : 0
% 60.64/9.35 % Disequality decompositions : 0
% 60.64/9.35 % Total rewrite steps : 662995
% 60.64/9.35 % ...of those cached : 560737
% 60.64/9.35 % Propositional unsat checks : 0
% 60.64/9.35 % Propositional check models : 0
% 60.64/9.35 % Propositional check unsatisfiable : 0
% 60.64/9.35 % Propositional clauses : 0
% 60.64/9.35 % Propositional clauses after purity: 0
% 60.64/9.35 % Propositional unsat core size : 0
% 60.64/9.35 % Propositional preprocessing time : 0.000
% 60.64/9.35 % Propositional encoding time : 0.000
% 60.64/9.35 % Propositional solver time : 0.000
% 60.64/9.35 % Success case prop preproc time : 0.000
% 60.64/9.35 % Success case prop encoding time : 0.000
% 60.64/9.35 % Success case prop solver time : 0.000
% 60.64/9.35 % Current number of processed clauses : 808
% 60.64/9.35 % Positive orientable unit clauses : 750
% 60.64/9.35 % Positive unorientable unit clauses: 58
% 60.64/9.35 % Negative unit clauses : 0
% 60.64/9.35 % Non-unit-clauses : 0
% 60.64/9.35 % Current number of unprocessed clauses: 242606
% 60.64/9.35 % ...number of literals in the above : 242606
% 60.64/9.35 % Current number of archived formulas : 0
% 60.64/9.35 % Current number of archived clauses : 245
% 60.64/9.35 % Clause-clause subsumption calls (NU) : 0
% 60.64/9.35 % Rec. Clause-clause subsumption calls : 0
% 60.64/9.35 % Non-unit clause-clause subsumptions : 0
% 60.64/9.35 % Unit Clause-clause subsumption calls : 701
% 60.64/9.35 % Rewrite failures with RHS unbound : 0
% 60.64/9.35 % BW rewrite match attempts : 4334
% 60.64/9.35 % BW rewrite match successes : 790
% 60.64/9.35 % Condensation attempts : 0
% 60.64/9.35 % Condensation successes : 0
% 60.64/9.35 % Termbank termtop insertions : 5236040
% 60.64/9.35 % Search garbage collected termcells : 2
% 60.64/9.35
% 60.64/9.35 % -------------------------------------------------
% 60.64/9.35 % User time : 8.266 s
% 60.64/9.35 % System time : 0.348 s
% 60.64/9.35 % Total time : 8.615 s
% 60.64/9.35 % Maximum resident set size: 3384 pages
% 60.64/9.35
% 60.64/9.35 % -------------------------------------------------
% 60.64/9.35 % User time : 41.033 s
% 60.64/9.35 % System time : 1.749 s
% 60.64/9.35 % Total time : 42.782 s
% 60.64/9.35 % Maximum resident set size: 4864 pages
% 60.64/9.35 % E exiting
%------------------------------------------------------------------------------