%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP416-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:39:45 PM UTC 2026
% Result : Unsatisfiable 4.37s 1.02s
% Output : CNFRefutation 4.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 2
% Syntax : Number of clauses : 57 ( 57 unt; 0 nHn; 12 RR)
% Number of literals : 57 ( 56 equ; 10 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 16 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 133 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,inverse(X3)))),inverse(multiply(inverse(X1),X1)))))) = X3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(c_0_2,axiom,
inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,inverse(X3)))),inverse(multiply(inverse(X1),X1)))))) = X3,
single_axiom ).
cnf(c_0_3,plain,
inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,X3))),inverse(multiply(inverse(X1),X1)))))) = multiply(X4,inverse(multiply(inverse(multiply(inverse(multiply(X5,X4)),multiply(X5,inverse(X3)))),inverse(multiply(inverse(X4),X4))))),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(b2,inverse(multiply(inverse(multiply(inverse(multiply(b2,b2)),multiply(b2,inverse(inverse(X1))))),inverse(multiply(inverse(b2),b2))))) = X1,
inference(rw,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,inverse(X3)))),inverse(multiply(inverse(X1),X1))))) = multiply(X4,inverse(multiply(inverse(multiply(inverse(multiply(X5,X4)),multiply(X5,inverse(X3)))),inverse(multiply(inverse(X4),X4))))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_6,plain,
multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,inverse(inverse(X3))))),inverse(multiply(inverse(X1),X1))))) = X3,
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),X3)),inverse(multiply(inverse(X1),X1)))))) = multiply(inverse(multiply(inverse(multiply(X4,X2)),multiply(X4,inverse(inverse(X3))))),inverse(multiply(inverse(X2),X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_6]),c_0_6]) ).
cnf(c_0_8,plain,
multiply(X1,inverse(inverse(multiply(X2,inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),X3)),inverse(multiply(inverse(X2),X2)))))))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_7]),c_0_6]) ).
cnf(c_0_9,plain,
multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(b2,b2)),multiply(b2,inverse(inverse(multiply(b2,inverse(X2))))))),inverse(multiply(inverse(b2),b2))))) = multiply(X1,inverse(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_3]),c_0_3]),c_0_7]) ).
cnf(c_0_10,plain,
multiply(inverse(multiply(inverse(multiply(b2,b2)),multiply(b2,inverse(inverse(multiply(b2,inverse(X1))))))),inverse(multiply(inverse(b2),b2))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_9]),c_0_3]),c_0_6]),c_0_6]) ).
cnf(c_0_11,plain,
multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(inverse(X3))))),inverse(multiply(inverse(X2),X2))) = multiply(inverse(multiply(inverse(multiply(X4,X2)),multiply(X4,inverse(inverse(X3))))),inverse(multiply(inverse(X2),X2))),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_12,plain,
multiply(inverse(multiply(inverse(multiply(X1,b2)),multiply(X1,inverse(inverse(multiply(b2,inverse(X2))))))),inverse(multiply(inverse(b2),b2))) = X2,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X2,b2)),multiply(X2,inverse(inverse(multiply(b2,inverse(X3))))))),X1)),X3)),inverse(multiply(inverse(X1),X1)))))) = multiply(inverse(b2),b2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_12]),c_0_6]) ).
cnf(c_0_14,plain,
inverse(multiply(inverse(multiply(inverse(b2),b2)),inverse(multiply(inverse(multiply(inverse(X1),X1)),inverse(multiply(inverse(inverse(multiply(inverse(b2),b2))),inverse(multiply(inverse(b2),b2)))))))) = multiply(inverse(b2),b2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_11]),c_0_12]) ).
cnf(c_0_15,plain,
inverse(inverse(multiply(b2,inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),b2)),X3)),inverse(multiply(inverse(b2),b2))))))) = multiply(X1,inverse(inverse(multiply(X2,inverse(multiply(inverse(X3),inverse(multiply(inverse(X2),X2)))))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_6]),c_0_7]) ).
cnf(c_0_16,plain,
inverse(multiply(inverse(multiply(inverse(X1),X1)),inverse(multiply(inverse(inverse(multiply(inverse(b2),b2))),inverse(multiply(inverse(b2),b2)))))) = multiply(inverse(b2),inverse(inverse(multiply(b2,inverse(multiply(multiply(inverse(b2),b2),inverse(multiply(inverse(b2),b2)))))))),
inference(spm,[status(thm)],[c_0_8,c_0_14]) ).
cnf(c_0_17,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(inverse(multiply(X2,inverse(multiply(inverse(X3),inverse(multiply(inverse(X2),X2))))))))) = X3,
inference(spm,[status(thm)],[c_0_8,c_0_15]) ).
cnf(c_0_18,plain,
inverse(multiply(inverse(multiply(inverse(b2),b2)),multiply(inverse(b2),inverse(inverse(multiply(b2,inverse(multiply(multiply(inverse(b2),b2),inverse(multiply(inverse(b2),b2)))))))))) = multiply(inverse(b2),b2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_16]),c_0_6]) ).
cnf(c_0_19,plain,
multiply(inverse(multiply(X1,inverse(multiply(inverse(b2),b2)))),multiply(X1,inverse(multiply(inverse(b2),b2)))) = multiply(inverse(X2),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_16]),c_0_18]) ).
cnf(c_0_20,plain,
multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_19,c_0_19]) ).
cnf(c_0_21,plain,
multiply(X1,inverse(inverse(multiply(X2,inverse(multiply(inverse(multiply(inverse(X3),X3)),inverse(multiply(inverse(X2),X2)))))))) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_8,c_0_20]) ).
cnf(c_0_22,plain,
inverse(inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(X2),X2)),inverse(multiply(inverse(X1),X1))))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_21]),c_0_8]) ).
cnf(c_0_23,plain,
inverse(inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(X2),X2)),inverse(multiply(inverse(X3),X3))))))) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_24,plain,
multiply(inverse(multiply(inverse(multiply(X1,b2)),multiply(X1,X2))),inverse(multiply(inverse(b2),b2))) = multiply(inverse(multiply(inverse(multiply(X3,b2)),multiply(X3,X2))),inverse(multiply(inverse(b2),b2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_3]),c_0_3]),c_0_6]) ).
cnf(c_0_25,plain,
inverse(inverse(multiply(inverse(X1),X1))) = inverse(inverse(multiply(inverse(multiply(inverse(X2),X2)),inverse(multiply(inverse(X3),X3))))),
inference(spm,[status(thm)],[c_0_23,c_0_20]) ).
cnf(c_0_26,plain,
multiply(inverse(multiply(X1,b2)),multiply(X1,X2)) = multiply(inverse(multiply(X3,b2)),multiply(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_24]),c_0_17]) ).
cnf(c_0_27,plain,
inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(b2,inverse(multiply(inverse(multiply(inverse(multiply(b2,b2)),multiply(b2,inverse(X3)))),inverse(multiply(inverse(b2),b2))))))),inverse(multiply(inverse(X1),X1)))))) = multiply(inverse(multiply(inverse(multiply(X4,X2)),multiply(X4,inverse(X3)))),inverse(multiply(inverse(X2),X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_3]),c_0_3]),c_0_6]) ).
cnf(c_0_28,plain,
multiply(inverse(X1),X1) = multiply(inverse(multiply(inverse(X2),X2)),inverse(multiply(inverse(X3),X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_25]),c_0_6]) ).
cnf(c_0_29,plain,
multiply(inverse(multiply(inverse(X1),X1)),multiply(inverse(b2),X2)) = multiply(inverse(multiply(X3,b2)),multiply(X3,X2)),
inference(spm,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_30,plain,
multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(X3)))),inverse(multiply(inverse(X2),X2))) = multiply(inverse(multiply(inverse(multiply(X4,X2)),multiply(X4,inverse(X3)))),inverse(multiply(inverse(X2),X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_27]),c_0_7]),c_0_10]) ).
cnf(c_0_31,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
inference(fof_simplification,[status(thm)],[prove_these_axioms_2]) ).
cnf(c_0_32,plain,
inverse(multiply(inverse(X1),X1)) = multiply(inverse(b2),b2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_28]),c_0_23]),c_0_20]) ).
cnf(c_0_33,plain,
multiply(inverse(multiply(inverse(X1),X1)),multiply(inverse(X2),X2)) = multiply(inverse(b2),b2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_20]),c_0_20]) ).
cnf(c_0_34,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(X3))) = multiply(inverse(multiply(X4,X2)),multiply(X4,inverse(X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_30]),c_0_17]) ).
cnf(c_0_35,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
c_0_31 ).
cnf(c_0_36,plain,
inverse(inverse(multiply(X1,multiply(inverse(b2),b2)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_32]),c_0_33]),c_0_32]) ).
cnf(c_0_37,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,X3)) = multiply(inverse(multiply(X4,X2)),multiply(X4,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_21]),c_0_21]) ).
cnf(c_0_38,negated_conjecture,
multiply(multiply(inverse(X1),X1),a2) != a2,
inference(spm,[status(thm)],[c_0_35,c_0_20]) ).
cnf(c_0_39,plain,
inverse(inverse(multiply(X1,multiply(inverse(X2),X2)))) = X1,
inference(spm,[status(thm)],[c_0_36,c_0_20]) ).
cnf(c_0_40,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,X3)) = multiply(inverse(multiply(inverse(X3),X2)),multiply(inverse(X4),X4)),
inference(spm,[status(thm)],[c_0_37,c_0_20]) ).
cnf(c_0_41,negated_conjecture,
multiply(multiply(X1,inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(X2),X2)),inverse(multiply(inverse(X1),X1))))))),a2) != a2,
inference(spm,[status(thm)],[c_0_38,c_0_22]) ).
cnf(c_0_42,plain,
inverse(multiply(X1,inverse(multiply(X1,multiply(inverse(X2),X2))))) = multiply(inverse(b2),b2),
inference(spm,[status(thm)],[c_0_32,c_0_39]) ).
cnf(c_0_43,plain,
multiply(multiply(inverse(b2),b2),multiply(inverse(X1),X1)) = multiply(inverse(b2),b2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_32]),c_0_20]) ).
cnf(c_0_44,negated_conjecture,
multiply(multiply(X1,inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(X2),X2)),inverse(multiply(inverse(X3),X3))))))),a2) != a2,
inference(spm,[status(thm)],[c_0_41,c_0_20]) ).
cnf(c_0_45,plain,
multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),X3)),inverse(multiply(inverse(X1),X1))))) = multiply(X4,inverse(multiply(inverse(multiply(inverse(multiply(X2,X4)),X3)),inverse(multiply(inverse(X4),X4))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_8]),c_0_6]) ).
cnf(c_0_46,plain,
multiply(X1,inverse(multiply(X1,multiply(inverse(X2),X2)))) = multiply(inverse(b2),b2),
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_17,c_0_42]),c_0_32]),c_0_43]),c_0_32]),c_0_39]),c_0_20]) ).
cnf(c_0_47,negated_conjecture,
multiply(multiply(X1,multiply(b2,inverse(multiply(inverse(multiply(inverse(multiply(b2,b2)),multiply(b2,inverse(X1)))),inverse(multiply(inverse(b2),b2)))))),a2) != a2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_3]) ).
cnf(c_0_48,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(inverse(multiply(X2,inverse(multiply(inverse(X3),X3))))))) = inverse(multiply(inverse(X2),X2)),
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_49,plain,
inverse(multiply(inverse(multiply(X1,X2)),multiply(inverse(X3),X3))) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_46]),c_0_21]) ).
cnf(c_0_50,negated_conjecture,
multiply(multiply(inverse(multiply(b2,inverse(multiply(inverse(X1),X1)))),multiply(b2,inverse(multiply(inverse(b2),b2)))),a2) != a2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_20]) ).
cnf(c_0_51,plain,
inverse(multiply(inverse(X1),multiply(inverse(X2),X2))) = X1,
inference(spm,[status(thm)],[c_0_49,c_0_17]) ).
cnf(c_0_52,negated_conjecture,
multiply(multiply(inverse(multiply(b2,inverse(multiply(inverse(X1),X1)))),multiply(b2,inverse(multiply(inverse(X2),X2)))),a2) != a2,
inference(spm,[status(thm)],[c_0_50,c_0_20]) ).
cnf(c_0_53,plain,
multiply(inverse(inverse(inverse(multiply(X1,X2)))),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_17]),c_0_32]),c_0_51]) ).
cnf(c_0_54,negated_conjecture,
multiply(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),X2)))),multiply(X1,inverse(multiply(inverse(X3),X3)))),a2) != a2,
inference(spm,[status(thm)],[c_0_52,c_0_37]) ).
cnf(c_0_55,plain,
multiply(multiply(inverse(b2),b2),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_46]),c_0_32]),c_0_32]),c_0_32]),c_0_39]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(cn,[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_54,c_0_55]),c_0_32]),c_0_32]),c_0_32]),c_0_43]),c_0_43]),c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GRP416-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.05/0.31 % Computer : n012.cluster.edu
% 0.05/0.31 % Model : x86_64 x86_64
% 0.05/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.31 % Memory : 8046.5625MB
% 0.05/0.31 % OS : Linux 6.8.0-71-generic
% 0.05/0.31 % CPULimit : 300
% 0.05/0.31 % WCLimit : 300
% 0.05/0.31 % DateTime : Sun Sep 20 20:12:06 UTC 2026
% 0.05/0.31 % CPUTime :
% 0.05/0.31 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.34 Running first-order theorem proving
% 0.08/0.34 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
% 4.37/1.01 % Version: 3.5.1
% 4.37/1.01 % Preprocessing class: FSSSSMSSSSSNFFN.
% 4.37/1.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.37/1.01 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 4.37/1.01 % Starting new_bool_3 with 300s (1) cores
% 4.37/1.01 % Starting new_bool_1 with 300s (1) cores
% 4.37/1.01 % Starting sh5l with 300s (1) cores
% 4.37/1.01 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 771952 completed with status 0
% 4.37/1.01 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 4.37/1.01 % Preprocessing class: FSSSSMSSSSSNFFN.
% 4.37/1.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.37/1.01 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 4.37/1.01 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.37/1.01 % No SInE strategy applied
% 4.37/1.01 % Search class: FUUPF-FFSF21-DFFFFFNN
% 4.37/1.01 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.37/1.01 % Starting SubtermCWHack with 136s (1) cores
% 4.37/1.01 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 4.37/1.01 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 4.37/1.01 % Starting new_bool_3 with 136s (1) cores
% 4.37/1.02 % Starting new_bool_1 with 136s (1) cores
% 4.37/1.02 % U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 771959 completed with status 0
% 4.37/1.02 % Result found by U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 4.37/1.02 % Preprocessing class: FSSSSMSSSSSNFFN.
% 4.37/1.02 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.37/1.02 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 4.37/1.02 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.37/1.02 % No SInE strategy applied
% 4.37/1.02 % Search class: FUUPF-FFSF21-DFFFFFNN
% 4.37/1.02 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.37/1.02 % Starting SubtermCWHack with 136s (1) cores
% 4.37/1.02 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 4.37/1.02 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 4.37/1.02 % Preprocessing time : 0.001 s
% 4.37/1.02 % Presaturation interreduction done
% 4.37/1.02
% 4.37/1.02 % Proof found!
% 4.37/1.02 % SZS status Unsatisfiable
% 4.37/1.02 % SZS output start CNFRefutation
% See solution above
% 4.37/1.02 % Parsed axioms : 2
% 4.37/1.02 % Removed by relevancy pruning/SinE : 0
% 4.37/1.02 % Initial clauses : 2
% 4.37/1.02 % Removed in clause preprocessing : 0
% 4.37/1.02 % Initial clauses in saturation : 2
% 4.37/1.02 % Processed clauses : 1292
% 4.37/1.02 % ...of these trivial : 80
% 4.37/1.02 % ...subsumed : 1077
% 4.37/1.02 % ...remaining for further processing : 135
% 4.37/1.02 % Other redundant clauses eliminated : 0
% 4.37/1.02 % Clauses deleted for lack of memory : 0
% 4.37/1.02 % Backward-subsumed : 29
% 4.37/1.02 % Backward-rewritten : 41
% 4.37/1.02 % Generated clauses : 22634
% 4.37/1.02 % ...of the previous two non-redundant : 21580
% 4.37/1.02 % ...aggressively subsumed : 0
% 4.37/1.02 % Contextual simplify-reflections : 0
% 4.37/1.02 % Paramodulations : 22634
% 4.37/1.02 % Factorizations : 0
% 4.37/1.02 % NegExts : 0
% 4.37/1.02 % Equation resolutions : 0
% 4.37/1.02 % Disequality decompositions : 0
% 4.37/1.02 % Total rewrite steps : 22872
% 4.37/1.02 % ...of those cached : 20544
% 4.37/1.02 % Propositional unsat checks : 0
% 4.37/1.02 % Propositional check models : 0
% 4.37/1.02 % Propositional check unsatisfiable : 0
% 4.37/1.02 % Propositional clauses : 0
% 4.37/1.02 % Propositional clauses after purity: 0
% 4.37/1.02 % Propositional unsat core size : 0
% 4.37/1.02 % Propositional preprocessing time : 0.000
% 4.37/1.02 % Propositional encoding time : 0.000
% 4.37/1.02 % Propositional solver time : 0.000
% 4.37/1.02 % Success case prop preproc time : 0.000
% 4.37/1.02 % Success case prop encoding time : 0.000
% 4.37/1.02 % Success case prop solver time : 0.000
% 4.37/1.02 % Current number of processed clauses : 63
% 4.37/1.02 % Positive orientable unit clauses : 18
% 4.37/1.02 % Positive unorientable unit clauses: 19
% 4.37/1.02 % Negative unit clauses : 26
% 4.37/1.02 % Non-unit-clauses : 0
% 4.37/1.02 % Current number of unprocessed clauses: 19814
% 4.37/1.02 % ...number of literals in the above : 19814
% 4.37/1.02 % Current number of archived formulas : 0
% 4.37/1.02 % Current number of archived clauses : 72
% 4.37/1.02 % Clause-clause subsumption calls (NU) : 0
% 4.37/1.02 % Rec. Clause-clause subsumption calls : 0
% 4.37/1.02 % Non-unit clause-clause subsumptions : 0
% 4.37/1.02 % Unit Clause-clause subsumption calls : 681
% 4.37/1.02 % Rewrite failures with RHS unbound : 0
% 4.37/1.02 % BW rewrite match attempts : 1420
% 4.37/1.02 % BW rewrite match successes : 193
% 4.37/1.02 % Condensation attempts : 0
% 4.37/1.02 % Condensation successes : 0
% 4.37/1.02 % Termbank termtop insertions : 1472840
% 4.37/1.02 % Search garbage collected termcells : 2
% 4.37/1.02
% 4.37/1.02 % -------------------------------------------------
% 4.37/1.02 % User time : 0.606 s
% 4.37/1.02 % System time : 0.038 s
% 4.37/1.02 % Total time : 0.645 s
% 4.37/1.02 % Maximum resident set size: 3636 pages
% 4.37/1.02
% 4.37/1.02 % -------------------------------------------------
% 4.37/1.02 % User time : 3.084 s
% 4.37/1.02 % System time : 0.138 s
% 4.37/1.02 % Total time : 3.222 s
% 4.37/1.02 % Maximum resident set size: 4864 pages
% 4.37/1.02 % E exiting
%------------------------------------------------------------------------------