%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP186-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:55 PM UTC 2026
% Result : Unsatisfiable 10.20s 2.05s
% Output : CNFRefutation 10.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 15
% Syntax : Number of clauses : 83 ( 83 unt; 0 nHn; 5 RR)
% Number of literals : 83 ( 82 equ; 4 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 : 153 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
cnf(monotony_lub2,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
cnf(monotony_glb1,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb1) ).
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/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).
cnf(idempotence_of_gld,axiom,
greatest_lower_bound(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',idempotence_of_gld) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
cnf(lub_absorbtion,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
cnf(monotony_lub1,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
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/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).
cnf(prove_p23,negated_conjecture,
least_upper_bound(multiply(a,b),identity) != multiply(a,inverse(greatest_lower_bound(a,inverse(b)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p23) ).
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,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_16,c_0_21]) ).
cnf(c_0_23,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_24,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_25,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,X2)))) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_22]) ).
cnf(c_0_26,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_27,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_lub2 ).
cnf(c_0_28,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_29,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_30,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_31,axiom,
greatest_lower_bound(X1,X1) = X1,
idempotence_of_gld ).
cnf(c_0_32,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_23,c_0_17]),c_0_24]) ).
cnf(c_0_33,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_25]),c_0_26]) ).
cnf(c_0_34,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_27,c_0_17]),c_0_28]) ).
cnf(c_0_35,plain,
greatest_lower_bound(identity,multiply(inverse(X1),X2)) = multiply(inverse(X1),greatest_lower_bound(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_16]),c_0_24]) ).
cnf(c_0_36,plain,
greatest_lower_bound(X1,greatest_lower_bound(X1,X2)) = greatest_lower_bound(X1,X2),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_18,c_0_21]) ).
cnf(c_0_38,plain,
multiply(greatest_lower_bound(identity,inverse(X1)),X1) = greatest_lower_bound(X1,identity),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_16]),c_0_24]) ).
cnf(c_0_39,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_33]),c_0_21]) ).
cnf(c_0_40,plain,
multiply(least_upper_bound(X1,identity),inverse(X1)) = least_upper_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_22]),c_0_28]) ).
cnf(c_0_41,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_42,plain,
greatest_lower_bound(identity,multiply(inverse(greatest_lower_bound(X1,X2)),X1)) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_16]) ).
cnf(c_0_43,plain,
greatest_lower_bound(identity,multiply(X1,inverse(X2))) = multiply(greatest_lower_bound(X2,X1),inverse(X2)),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_44,plain,
inverse(multiply(X1,inverse(X2))) = multiply(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_37,c_0_33]) ).
cnf(c_0_45,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_46,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_38,c_0_21]),c_0_24]) ).
cnf(c_0_47,plain,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(X3,greatest_lower_bound(X1,X2)),
inference(spm,[status(thm)],[c_0_24,c_0_30]) ).
cnf(c_0_48,plain,
greatest_lower_bound(X1,multiply(X1,X2)) = multiply(X1,greatest_lower_bound(identity,X2)),
inference(spm,[status(thm)],[c_0_29,c_0_26]) ).
cnf(c_0_49,plain,
multiply(inverse(least_upper_bound(identity,inverse(X1))),least_upper_bound(X1,identity)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_21]) ).
cnf(c_0_50,plain,
greatest_lower_bound(X1,least_upper_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_41,c_0_28]) ).
cnf(c_0_51,plain,
multiply(inverse(X1),greatest_lower_bound(X2,multiply(X1,X3))) = greatest_lower_bound(multiply(inverse(X1),X2),X3),
inference(spm,[status(thm)],[c_0_29,c_0_18]) ).
cnf(c_0_52,plain,
greatest_lower_bound(identity,multiply(X1,inverse(greatest_lower_bound(X1,X2)))) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_26]) ).
cnf(c_0_53,plain,
least_upper_bound(identity,multiply(greatest_lower_bound(X1,X2),inverse(X1))) = identity,
inference(spm,[status(thm)],[c_0_45,c_0_43]) ).
cnf(c_0_54,plain,
multiply(greatest_lower_bound(X1,greatest_lower_bound(identity,X2)),inverse(greatest_lower_bound(X2,X1))) = greatest_lower_bound(identity,inverse(greatest_lower_bound(X2,X1))),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_55,plain,
greatest_lower_bound(X1,inverse(least_upper_bound(identity,inverse(X1)))) = inverse(least_upper_bound(identity,inverse(X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_26]),c_0_24]) ).
cnf(c_0_56,plain,
multiply(greatest_lower_bound(inverse(X1),X2),X1) = greatest_lower_bound(identity,multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_23,c_0_16]) ).
cnf(c_0_57,plain,
greatest_lower_bound(inverse(X1),inverse(greatest_lower_bound(X1,X2))) = inverse(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_26]),c_0_26]) ).
cnf(c_0_58,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_59,plain,
least_upper_bound(identity,multiply(greatest_lower_bound(X1,X2),inverse(X2))) = identity,
inference(spm,[status(thm)],[c_0_53,c_0_24]) ).
cnf(c_0_60,plain,
greatest_lower_bound(identity,multiply(greatest_lower_bound(identity,X1),least_upper_bound(identity,inverse(X1)))) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_21]),c_0_56]),c_0_21]),c_0_41]) ).
cnf(c_0_61,plain,
least_upper_bound(X1,greatest_lower_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_45,c_0_24]) ).
cnf(c_0_62,plain,
greatest_lower_bound(inverse(X1),inverse(greatest_lower_bound(X2,X1))) = inverse(X1),
inference(spm,[status(thm)],[c_0_57,c_0_24]) ).
cnf(c_0_63,plain,
greatest_lower_bound(identity,inverse(greatest_lower_bound(identity,X1))) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_36]),c_0_22]) ).
cnf(c_0_64,plain,
multiply(X1,least_upper_bound(X2,inverse(multiply(X3,X1)))) = least_upper_bound(multiply(X1,X2),inverse(X3)),
inference(spm,[status(thm)],[c_0_58,c_0_33]) ).
cnf(c_0_65,plain,
least_upper_bound(identity,inverse(multiply(greatest_lower_bound(identity,X1),least_upper_bound(identity,inverse(X1))))) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_17]) ).
cnf(c_0_66,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_67,plain,
least_upper_bound(inverse(X1),inverse(greatest_lower_bound(X2,X1))) = inverse(greatest_lower_bound(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_28]) ).
cnf(c_0_68,plain,
least_upper_bound(identity,inverse(greatest_lower_bound(identity,X1))) = inverse(greatest_lower_bound(identity,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_63]),c_0_28]) ).
cnf(c_0_69,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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_26]),c_0_26]),c_0_66]),c_0_67]),c_0_68]) ).
cnf(c_0_70,plain,
least_upper_bound(X1,multiply(X2,multiply(inverse(X3),X1))) = multiply(least_upper_bound(X2,X3),multiply(inverse(X3),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_37]),c_0_28]) ).
cnf(c_0_71,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_34,c_0_15]),c_0_28]) ).
cnf(c_0_72,plain,
inverse(least_upper_bound(identity,inverse(X1))) = greatest_lower_bound(identity,X1),
inference(spm,[status(thm)],[c_0_21,c_0_69]) ).
cnf(c_0_73,plain,
multiply(least_upper_bound(identity,multiply(X1,inverse(X2))),X3) = multiply(least_upper_bound(X1,X2),multiply(inverse(X2),X3)),
inference(rw,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_74,plain,
inverse(least_upper_bound(identity,X1)) = greatest_lower_bound(identity,inverse(X1)),
inference(spm,[status(thm)],[c_0_72,c_0_21]) ).
cnf(c_0_75,negated_conjecture,
least_upper_bound(multiply(a,b),identity) != multiply(a,inverse(greatest_lower_bound(a,inverse(b)))),
inference(fof_simplification,[status(thm)],[prove_p23]) ).
cnf(c_0_76,plain,
greatest_lower_bound(inverse(X1),inverse(X2)) = inverse(least_upper_bound(X2,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_33,c_0_73]),c_0_15]),c_0_33]),c_0_74]),c_0_44]),c_0_51]),c_0_26]) ).
cnf(c_0_77,negated_conjecture,
least_upper_bound(multiply(a,b),identity) != multiply(a,inverse(greatest_lower_bound(a,inverse(b)))),
c_0_75 ).
cnf(c_0_78,plain,
inverse(least_upper_bound(X1,inverse(X2))) = greatest_lower_bound(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_76,c_0_21]) ).
cnf(c_0_79,negated_conjecture,
multiply(a,inverse(greatest_lower_bound(a,inverse(b)))) != least_upper_bound(identity,multiply(a,b)),
inference(rw,[status(thm)],[c_0_77,c_0_28]) ).
cnf(c_0_80,plain,
inverse(greatest_lower_bound(X1,inverse(X2))) = least_upper_bound(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_21,c_0_78]) ).
cnf(c_0_81,plain,
multiply(X1,least_upper_bound(X2,inverse(X1))) = least_upper_bound(identity,multiply(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_22]),c_0_28]) ).
cnf(c_0_82,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_80]),c_0_81])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP186-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.42 % Computer : n020.cluster.edu
% 0.17/0.42 % Model : x86_64 x86_64
% 0.17/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42 % Memory : 8046.5625MB
% 0.17/0.42 % OS : Linux 6.8.0-71-generic
% 0.17/0.42 % CPULimit : 300
% 0.17/0.42 % WCLimit : 300
% 0.17/0.42 % DateTime : Sun Sep 20 20:06:03 UTC 2026
% 0.17/0.42 % CPUTime :
% 0.17/0.42 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.50 Running first-order theorem proving
% 0.17/0.50 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
% 10.20/2.05 % Version: 3.5.1
% 10.20/2.05 % Preprocessing class: FSMSSMSSSSSNFFN.
% 10.20/2.05 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.20/2.05 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.20/2.05 % Starting new_bool_3 with 300s (1) cores
% 10.20/2.05 % Starting new_bool_1 with 300s (1) cores
% 10.20/2.05 % Starting sh5l with 300s (1) cores
% 10.20/2.05 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1106256 completed with status 0
% 10.20/2.05 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 10.20/2.05 % Preprocessing class: FSMSSMSSSSSNFFN.
% 10.20/2.05 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.20/2.05 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.20/2.05 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 10.20/2.05 % No SInE strategy applied
% 10.20/2.05 % Search class: FUUPM-FFSF21-MFFFFFNN
% 10.20/2.05 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 10.20/2.05 % Starting SubtermCWHack with 136s (1) cores
% 10.20/2.05 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 10.20/2.05 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 10.20/2.05 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 10.20/2.05 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 10.20/2.05 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1106261 completed with status 0
% 10.20/2.05 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 10.20/2.05 % Preprocessing class: FSMSSMSSSSSNFFN.
% 10.20/2.05 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.20/2.05 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.20/2.05 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 10.20/2.05 % No SInE strategy applied
% 10.20/2.05 % Search class: FUUPM-FFSF21-MFFFFFNN
% 10.20/2.05 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 10.20/2.05 % Starting SubtermCWHack with 136s (1) cores
% 10.20/2.05 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 10.20/2.05 % Preprocessing time : 0.001 s
% 10.20/2.05 % Presaturation interreduction done
% 10.20/2.05
% 10.20/2.05 % Proof found!
% 10.20/2.05 % SZS status Unsatisfiable
% 10.20/2.05 % SZS output start CNFRefutation
% See solution above
% 10.20/2.05 % Parsed axioms : 16
% 10.20/2.05 % Removed by relevancy pruning/SinE : 0
% 10.20/2.05 % Initial clauses : 16
% 10.20/2.05 % Removed in clause preprocessing : 0
% 10.20/2.05 % Initial clauses in saturation : 16
% 10.20/2.05 % Processed clauses : 4443
% 10.20/2.05 % ...of these trivial : 2043
% 10.20/2.05 % ...subsumed : 1737
% 10.20/2.05 % ...remaining for further processing : 663
% 10.20/2.05 % Other redundant clauses eliminated : 0
% 10.20/2.05 % Clauses deleted for lack of memory : 0
% 10.20/2.05 % Backward-subsumed : 0
% 10.20/2.05 % Backward-rewritten : 162
% 10.20/2.05 % Generated clauses : 135189
% 10.20/2.05 % ...of the previous two non-redundant : 79186
% 10.20/2.05 % ...aggressively subsumed : 0
% 10.20/2.05 % Contextual simplify-reflections : 0
% 10.20/2.05 % Paramodulations : 135189
% 10.20/2.05 % Factorizations : 0
% 10.20/2.05 % NegExts : 0
% 10.20/2.05 % Equation resolutions : 0
% 10.20/2.05 % Disequality decompositions : 0
% 10.20/2.05 % Total rewrite steps : 216194
% 10.20/2.05 % ...of those cached : 182168
% 10.20/2.05 % Propositional unsat checks : 0
% 10.20/2.05 % Propositional check models : 0
% 10.20/2.05 % Propositional check unsatisfiable : 0
% 10.20/2.05 % Propositional clauses : 0
% 10.20/2.05 % Propositional clauses after purity: 0
% 10.20/2.05 % Propositional unsat core size : 0
% 10.20/2.05 % Propositional preprocessing time : 0.000
% 10.20/2.05 % Propositional encoding time : 0.000
% 10.20/2.05 % Propositional solver time : 0.000
% 10.20/2.05 % Success case prop preproc time : 0.000
% 10.20/2.05 % Success case prop encoding time : 0.000
% 10.20/2.05 % Success case prop solver time : 0.000
% 10.20/2.05 % Current number of processed clauses : 485
% 10.20/2.05 % Positive orientable unit clauses : 448
% 10.20/2.05 % Positive unorientable unit clauses: 37
% 10.20/2.05 % Negative unit clauses : 0
% 10.20/2.05 % Non-unit-clauses : 0
% 10.20/2.05 % Current number of unprocessed clauses: 74441
% 10.20/2.05 % ...number of literals in the above : 74441
% 10.20/2.05 % Current number of archived formulas : 0
% 10.20/2.05 % Current number of archived clauses : 178
% 10.20/2.05 % Clause-clause subsumption calls (NU) : 0
% 10.20/2.05 % Rec. Clause-clause subsumption calls : 0
% 10.20/2.05 % Non-unit clause-clause subsumptions : 0
% 10.20/2.05 % Unit Clause-clause subsumption calls : 125
% 10.20/2.05 % Rewrite failures with RHS unbound : 0
% 10.20/2.05 % BW rewrite match attempts : 2170
% 10.20/2.05 % BW rewrite match successes : 339
% 10.20/2.05 % Condensation attempts : 0
% 10.20/2.05 % Condensation successes : 0
% 10.20/2.05 % Termbank termtop insertions : 1648138
% 10.20/2.05 % Search garbage collected termcells : 2
% 10.20/2.05
% 10.20/2.05 % -------------------------------------------------
% 10.20/2.05 % User time : 1.382 s
% 10.20/2.05 % System time : 0.079 s
% 10.20/2.05 % Total time : 1.461 s
% 10.20/2.05 % Maximum resident set size: 3384 pages
% 10.20/2.05
% 10.20/2.05 % -------------------------------------------------
% 10.20/2.05 % User time : 6.890 s
% 10.20/2.05 % System time : 0.352 s
% 10.20/2.05 % Total time : 7.242 s
% 10.20/2.05 % Maximum resident set size: 4864 pages
% 10.20/2.05 % E exiting
%------------------------------------------------------------------------------