%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP179-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:52 PM UTC 2026
% Result : Unsatisfiable 23.78s 3.97s
% Output : CNFRefutation 23.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 14
% Syntax : Number of clauses : 85 ( 85 unt; 0 nHn; 4 RR)
% Number of literals : 85 ( 84 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 159 ( 20 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_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(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(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(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(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(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(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(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_p10,negated_conjecture,
inverse(least_upper_bound(a,b)) != greatest_lower_bound(inverse(a),inverse(b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p10) ).
cnf(c_0_14,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_15,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_16,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_17,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_18,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_19,plain,
multiply(inverse(inverse(inverse(X1))),X1) = identity,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_19]),c_0_18]) ).
cnf(c_0_21,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_22,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_23,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_24,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_25,axiom,
greatest_lower_bound(X1,X1) = X1,
idempotence_of_gld ).
cnf(c_0_26,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,X2)))) = identity,
inference(spm,[status(thm)],[c_0_14,c_0_21]) ).
cnf(c_0_27,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_28,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_22,c_0_15]),c_0_23]) ).
cnf(c_0_29,plain,
greatest_lower_bound(X1,greatest_lower_bound(X1,X2)) = greatest_lower_bound(X1,X2),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_31,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_32,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_26]),c_0_27]) ).
cnf(c_0_33,plain,
greatest_lower_bound(identity,multiply(inverse(greatest_lower_bound(X1,X2)),X1)) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_15]) ).
cnf(c_0_34,plain,
greatest_lower_bound(identity,multiply(X1,inverse(X2))) = multiply(greatest_lower_bound(X2,X1),inverse(X2)),
inference(spm,[status(thm)],[c_0_30,c_0_21]) ).
cnf(c_0_35,plain,
inverse(multiply(X1,inverse(X2))) = multiply(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,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_22,c_0_17]) ).
cnf(c_0_37,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_33,c_0_34]),c_0_35]),c_0_27]) ).
cnf(c_0_38,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_39,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_36,c_0_37]),c_0_27]),c_0_27]) ).
cnf(c_0_40,plain,
least_upper_bound(X1,greatest_lower_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_38,c_0_23]) ).
cnf(c_0_41,plain,
greatest_lower_bound(inverse(X1),inverse(greatest_lower_bound(X2,X1))) = inverse(X1),
inference(spm,[status(thm)],[c_0_39,c_0_23]) ).
cnf(c_0_42,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_43,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_30,c_0_16]),c_0_23]) ).
cnf(c_0_44,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_40,c_0_41]),c_0_42]) ).
cnf(c_0_45,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_46,plain,
multiply(greatest_lower_bound(identity,inverse(X1)),X1) = greatest_lower_bound(X1,identity),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_15]),c_0_23]) ).
cnf(c_0_47,plain,
least_upper_bound(inverse(X1),inverse(least_upper_bound(X1,X2))) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_42]) ).
cnf(c_0_48,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_46,c_0_20]),c_0_23]) ).
cnf(c_0_49,plain,
least_upper_bound(X1,inverse(least_upper_bound(inverse(X1),X2))) = X1,
inference(spm,[status(thm)],[c_0_47,c_0_20]) ).
cnf(c_0_50,plain,
least_upper_bound(greatest_lower_bound(X1,X2),greatest_lower_bound(X1,greatest_lower_bound(X2,X3))) = greatest_lower_bound(X1,X2),
inference(spm,[status(thm)],[c_0_38,c_0_24]) ).
cnf(c_0_51,plain,
greatest_lower_bound(identity,inverse(least_upper_bound(identity,X1))) = inverse(least_upper_bound(identity,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_45]),c_0_16]) ).
cnf(c_0_52,plain,
greatest_lower_bound(X1,least_upper_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_45,c_0_42]) ).
cnf(c_0_53,plain,
least_upper_bound(X1,inverse(least_upper_bound(X2,inverse(X1)))) = X1,
inference(spm,[status(thm)],[c_0_49,c_0_42]) ).
cnf(c_0_54,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_55,plain,
greatest_lower_bound(identity,inverse(greatest_lower_bound(identity,X1))) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_29]),c_0_21]) ).
cnf(c_0_56,plain,
multiply(greatest_lower_bound(X1,identity),inverse(X1)) = greatest_lower_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_21]),c_0_23]) ).
cnf(c_0_57,plain,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(X2,greatest_lower_bound(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_23]),c_0_24]) ).
cnf(c_0_58,plain,
least_upper_bound(greatest_lower_bound(X1,identity),greatest_lower_bound(X1,inverse(least_upper_bound(identity,X2)))) = greatest_lower_bound(X1,identity),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_59,plain,
greatest_lower_bound(X1,inverse(least_upper_bound(X2,inverse(X1)))) = inverse(least_upper_bound(X2,inverse(X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_23]) ).
cnf(c_0_60,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_54,c_0_17]) ).
cnf(c_0_61,plain,
least_upper_bound(identity,multiply(greatest_lower_bound(X1,X2),inverse(X1))) = identity,
inference(spm,[status(thm)],[c_0_38,c_0_34]) ).
cnf(c_0_62,plain,
greatest_lower_bound(identity,inverse(greatest_lower_bound(X1,identity))) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_43]),c_0_27]) ).
cnf(c_0_63,plain,
multiply(greatest_lower_bound(X1,greatest_lower_bound(X2,identity)),inverse(greatest_lower_bound(X1,X2))) = greatest_lower_bound(identity,inverse(greatest_lower_bound(X1,X2))),
inference(spm,[status(thm)],[c_0_56,c_0_24]) ).
cnf(c_0_64,plain,
greatest_lower_bound(identity,greatest_lower_bound(X1,inverse(greatest_lower_bound(identity,X2)))) = greatest_lower_bound(X1,identity),
inference(spm,[status(thm)],[c_0_57,c_0_55]) ).
cnf(c_0_65,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_52,c_0_38]),c_0_24]) ).
cnf(c_0_66,plain,
least_upper_bound(inverse(X1),inverse(least_upper_bound(X2,X1))) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_52]),c_0_42]) ).
cnf(c_0_67,plain,
least_upper_bound(greatest_lower_bound(X1,identity),inverse(least_upper_bound(identity,inverse(X1)))) = greatest_lower_bound(X1,identity),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_68,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_69,plain,
least_upper_bound(inverse(X1),inverse(greatest_lower_bound(X1,X2))) = inverse(greatest_lower_bound(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_27]),c_0_27]),c_0_42]) ).
cnf(c_0_70,plain,
least_upper_bound(identity,inverse(greatest_lower_bound(X1,identity))) = inverse(greatest_lower_bound(X1,identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_62]),c_0_42]) ).
cnf(c_0_71,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_30,c_0_31]),c_0_23]) ).
cnf(c_0_72,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_43,c_0_14]),c_0_23]) ).
cnf(c_0_73,plain,
multiply(greatest_lower_bound(identity,X1),inverse(greatest_lower_bound(X1,identity))) = identity,
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_63,c_0_64]),c_0_24]),c_0_23]),c_0_55]),c_0_65]),c_0_62]) ).
cnf(c_0_74,plain,
inverse(greatest_lower_bound(X1,identity)) = 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_66,c_0_67]),c_0_20]),c_0_68]),c_0_69]),c_0_70]),c_0_20]) ).
cnf(c_0_75,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_71,c_0_72]) ).
cnf(c_0_76,plain,
multiply(greatest_lower_bound(identity,X1),least_upper_bound(identity,inverse(X1))) = identity,
inference(rw,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_77,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(spm,[status(thm)],[c_0_75,c_0_76]),c_0_35]),c_0_60]),c_0_27]) ).
cnf(c_0_78,plain,
least_upper_bound(inverse(X1),inverse(X2)) = inverse(greatest_lower_bound(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_77]),c_0_27]) ).
cnf(c_0_79,plain,
inverse(greatest_lower_bound(inverse(X1),X2)) = least_upper_bound(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_78,c_0_20]) ).
cnf(c_0_80,negated_conjecture,
inverse(least_upper_bound(a,b)) != greatest_lower_bound(inverse(a),inverse(b)),
inference(fof_simplification,[status(thm)],[prove_p10]) ).
cnf(c_0_81,plain,
inverse(least_upper_bound(inverse(X1),X2)) = greatest_lower_bound(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_20,c_0_79]) ).
cnf(c_0_82,negated_conjecture,
inverse(least_upper_bound(a,b)) != greatest_lower_bound(inverse(a),inverse(b)),
c_0_80 ).
cnf(c_0_83,plain,
greatest_lower_bound(inverse(X1),inverse(X2)) = inverse(least_upper_bound(X2,X1)),
inference(spm,[status(thm)],[c_0_81,c_0_20]) ).
cnf(c_0_84,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_83]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP179-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.38 % Computer : n020.cluster.edu
% 0.09/0.38 % Model : x86_64 x86_64
% 0.09/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38 % Memory : 8046.5625MB
% 0.09/0.38 % OS : Linux 6.8.0-71-generic
% 0.09/0.38 % CPULimit : 300
% 0.09/0.38 % WCLimit : 300
% 0.09/0.38 % DateTime : Sun Sep 20 20:05:33 UTC 2026
% 0.14/0.38 % CPUTime :
% 0.14/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/0.42 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
% 23.78/3.97 % Version: 3.5.1
% 23.78/3.97 % Preprocessing class: FSMSSMSSSSSNFFN.
% 23.78/3.97 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.78/3.97 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 23.78/3.97 % Starting new_bool_3 with 300s (1) cores
% 23.78/3.97 % Starting new_bool_1 with 300s (1) cores
% 23.78/3.97 % Starting sh5l with 300s (1) cores
% 23.78/3.97 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1104991 completed with status 0
% 23.78/3.97 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 23.78/3.97 % Preprocessing class: FSMSSMSSSSSNFFN.
% 23.78/3.97 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.78/3.97 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 23.78/3.97 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 23.78/3.97 % No SInE strategy applied
% 23.78/3.97 % Search class: FUUPM-FFSF21-SFFFFFNN
% 23.78/3.97 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 23.78/3.97 % Starting SubtermCWHack with 136s (1) cores
% 23.78/3.97 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 23.78/3.97 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 23.78/3.97 % Starting new_bool_3 with 136s (1) cores
% 23.78/3.97 % Starting new_bool_1 with 136s (1) cores
% 23.78/3.97 % SAT001_MinMin_p005000_rr_RG with pid 1104999 completed with status 0
% 23.78/3.97 % Result found by SAT001_MinMin_p005000_rr_RG
% 23.78/3.97 % Preprocessing class: FSMSSMSSSSSNFFN.
% 23.78/3.97 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.78/3.97 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 23.78/3.97 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 23.78/3.97 % No SInE strategy applied
% 23.78/3.97 % Search class: FUUPM-FFSF21-SFFFFFNN
% 23.78/3.97 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 23.78/3.97 % Starting SubtermCWHack with 136s (1) cores
% 23.78/3.97 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 23.78/3.97 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 23.78/3.97 % Preprocessing time : 0.001 s
% 23.78/3.97 % Presaturation interreduction done
% 23.78/3.97
% 23.78/3.97 % Proof found!
% 23.78/3.97 % SZS status Unsatisfiable
% 23.78/3.97 % SZS output start CNFRefutation
% See solution above
% 23.78/3.97 % Parsed axioms : 16
% 23.78/3.97 % Removed by relevancy pruning/SinE : 0
% 23.78/3.97 % Initial clauses : 16
% 23.78/3.97 % Removed in clause preprocessing : 0
% 23.78/3.97 % Initial clauses in saturation : 16
% 23.78/3.97 % Processed clauses : 5602
% 23.78/3.97 % ...of these trivial : 2120
% 23.78/3.97 % ...subsumed : 2783
% 23.78/3.97 % ...remaining for further processing : 699
% 23.78/3.97 % Other redundant clauses eliminated : 0
% 23.78/3.97 % Clauses deleted for lack of memory : 0
% 23.78/3.97 % Backward-subsumed : 0
% 23.78/3.97 % Backward-rewritten : 191
% 23.78/3.97 % Generated clauses : 174978
% 23.78/3.97 % ...of the previous two non-redundant : 112238
% 23.78/3.97 % ...aggressively subsumed : 0
% 23.78/3.97 % Contextual simplify-reflections : 0
% 23.78/3.97 % Paramodulations : 174978
% 23.78/3.97 % Factorizations : 0
% 23.78/3.97 % NegExts : 0
% 23.78/3.97 % Equation resolutions : 0
% 23.78/3.97 % Disequality decompositions : 0
% 23.78/3.97 % Total rewrite steps : 280241
% 23.78/3.97 % ...of those cached : 235045
% 23.78/3.97 % Propositional unsat checks : 0
% 23.78/3.97 % Propositional check models : 0
% 23.78/3.97 % Propositional check unsatisfiable : 0
% 23.78/3.97 % Propositional clauses : 0
% 23.78/3.97 % Propositional clauses after purity: 0
% 23.78/3.97 % Propositional unsat core size : 0
% 23.78/3.97 % Propositional preprocessing time : 0.000
% 23.78/3.97 % Propositional encoding time : 0.000
% 23.78/3.97 % Propositional solver time : 0.000
% 23.78/3.97 % Success case prop preproc time : 0.000
% 23.78/3.97 % Success case prop encoding time : 0.000
% 23.78/3.97 % Success case prop solver time : 0.000
% 23.78/3.97 % Current number of processed clauses : 492
% 23.78/3.97 % Positive orientable unit clauses : 457
% 23.78/3.97 % Positive unorientable unit clauses: 35
% 23.78/3.97 % Negative unit clauses : 0
% 23.78/3.97 % Non-unit-clauses : 0
% 23.78/3.97 % Current number of unprocessed clauses: 106281
% 23.78/3.97 % ...number of literals in the above : 106281
% 23.78/3.97 % Current number of archived formulas : 0
% 23.78/3.97 % Current number of archived clauses : 207
% 23.78/3.97 % Clause-clause subsumption calls (NU) : 0
% 23.78/3.97 % Rec. Clause-clause subsumption calls : 0
% 23.78/3.97 % Non-unit clause-clause subsumptions : 0
% 23.78/3.97 % Unit Clause-clause subsumption calls : 224
% 23.78/3.97 % Rewrite failures with RHS unbound : 0
% 23.78/3.97 % BW rewrite match attempts : 2438
% 23.78/3.97 % BW rewrite match successes : 515
% 23.78/3.97 % Condensation attempts : 0
% 23.78/3.97 % Condensation successes : 0
% 23.78/3.97 % Termbank termtop insertions : 2230068
% 23.78/3.97 % Search garbage collected termcells : 2
% 23.78/3.97
% 23.78/3.97 % -------------------------------------------------
% 23.78/3.97 % User time : 3.231 s
% 23.78/3.97 % System time : 0.155 s
% 23.78/3.97 % Total time : 3.386 s
% 23.78/3.97 % Maximum resident set size: 3384 pages
% 23.78/3.97
% 23.78/3.97 % -------------------------------------------------
% 23.78/3.97 % User time : 15.989 s
% 23.78/3.97 % System time : 0.736 s
% 23.78/3.97 % Total time : 16.725 s
% 23.78/3.97 % Maximum resident set size: 4864 pages
% 23.78/3.97 % E exiting
%------------------------------------------------------------------------------