%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL385-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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 01:19:18 PM UTC 2026
% Result : Unsatisfiable 213.91s 42.93s
% Output : CNFRefutation 213.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 6
% Syntax : Number of clauses : 77 ( 77 unt; 0 nHn; 4 RR)
% Number of literals : 77 ( 76 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-4 aty)
% Number of variables : 209 ( 54 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
ifeq(is_a_theorem(implies(X1,X2)),true,ifeq(is_a_theorem(X1),true,is_a_theorem(X2),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(cn_1,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_1) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(cn_2,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_2) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).
cnf(prove_cn_47,negated_conjecture,
is_a_theorem(implies(implies(x,not(y)),implies(y,not(x)))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_47) ).
cnf(c_0_6,axiom,
ifeq(is_a_theorem(implies(X1,X2)),true,ifeq(is_a_theorem(X1),true,is_a_theorem(X2),true),true) = true,
condensed_detachment ).
cnf(c_0_7,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))) = true,
cn_1 ).
cnf(c_0_8,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_9,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)) = true,
cn_2 ).
cnf(c_0_10,plain,
ifeq(is_a_theorem(implies(X1,X2)),true,is_a_theorem(implies(implies(X2,X3),implies(X1,X3))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_11,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))) = true,
cn_3 ).
cnf(c_0_12,plain,
ifeq(is_a_theorem(implies(implies(implies(not(X1),X1),X1),X2)),true,is_a_theorem(X2),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_9]),c_0_8]) ).
cnf(c_0_13,plain,
is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X1,X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_8]) ).
cnf(c_0_14,plain,
ifeq(is_a_theorem(X1),true,is_a_theorem(implies(not(X1),X2)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_11]),c_0_8]) ).
cnf(c_0_15,plain,
is_a_theorem(implies(X1,X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_8]) ).
cnf(c_0_16,plain,
ifeq(is_a_theorem(implies(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(not(implies(X1,X1)),X2)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_8]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(X1,implies(implies(X2,X3),implies(not(X1),X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_13]),c_0_8]) ).
cnf(c_0_19,plain,
ifeq(is_a_theorem(implies(implies(not(X1),X2),X3)),true,is_a_theorem(implies(X1,X3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_13]),c_0_8]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(implies(X1,X2),implies(not(implies(X3,X3)),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_17]),c_0_8]) ).
cnf(c_0_21,plain,
ifeq(is_a_theorem(implies(implies(implies(implies(not(X1),X2),X3),implies(X1,X3)),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_13]),c_0_8]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(not(X3),X2)),X4),implies(X3,X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_18]),c_0_8]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X1),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_9]),c_0_8]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(X1,implies(not(implies(X2,X2)),X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_8]) ).
cnf(c_0_25,plain,
is_a_theorem(implies(X1,implies(X2,implies(not(X1),X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_8]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(implies(implies(implies(not(X1),X1),X2),X3),implies(implies(X1,X2),X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_23]),c_0_8]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(implies(implies(not(implies(X1,X1)),X2),X3),implies(X4,X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_24]),c_0_8]) ).
cnf(c_0_28,plain,
is_a_theorem(implies(implies(implies(X1,implies(not(X2),X3)),X4),implies(X2,X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_25]),c_0_8]) ).
cnf(c_0_29,plain,
ifeq(is_a_theorem(implies(implies(implies(implies(implies(not(X1),X1),X2),X3),implies(implies(X1,X2),X3)),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_26]),c_0_8]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),X4),implies(implies(X3,X1),X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_7]),c_0_8]) ).
cnf(c_0_31,plain,
is_a_theorem(implies(X1,implies(X2,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_27]),c_0_8]) ).
cnf(c_0_32,plain,
ifeq(is_a_theorem(implies(implies(X1,implies(not(X2),X3)),X4)),true,is_a_theorem(implies(X2,X4)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_28]),c_0_8]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(implies(X2,X3),implies(X1,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_8]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),implies(X3,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_31]),c_0_8]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),implies(X3,X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_8]) ).
cnf(c_0_36,plain,
ifeq(is_a_theorem(implies(implies(X1,X1),X2)),true,is_a_theorem(implies(X3,X2)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_34]),c_0_8]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),X4),implies(X1,X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_35]),c_0_8]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),X2),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_23]),c_0_8]) ).
cnf(c_0_39,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(implies(X4,X4),X2),X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_34]),c_0_8]) ).
cnf(c_0_40,plain,
is_a_theorem(implies(not(X1),implies(X1,implies(X2,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_37]),c_0_8]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(implies(implies(implies(not(X1),X1),X1),X2),implies(X3,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_38]),c_0_8]) ).
cnf(c_0_42,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),X2)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_39]),c_0_8]) ).
cnf(c_0_43,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),X4),implies(not(X1),X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_40]),c_0_8]) ).
cnf(c_0_44,plain,
ifeq(is_a_theorem(implies(implies(implies(implies(implies(not(X1),X1),X1),X2),implies(X3,X2)),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_41]),c_0_8]) ).
cnf(c_0_45,plain,
ifeq(is_a_theorem(implies(implies(implies(implies(X1,X1),X2),X2),X3)),true,is_a_theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_42]),c_0_8]) ).
cnf(c_0_46,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),X3),X4),implies(implies(implies(implies(not(X1),X1),X2),X3),X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_26]),c_0_8]) ).
cnf(c_0_47,plain,
ifeq(is_a_theorem(implies(implies(X1,implies(X2,X3)),X4)),true,is_a_theorem(implies(not(X1),X4)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_43]),c_0_8]) ).
cnf(c_0_48,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X3,implies(X1,X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_30]),c_0_8]) ).
cnf(c_0_49,plain,
is_a_theorem(implies(X1,implies(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_37]),c_0_8]) ).
cnf(c_0_50,plain,
ifeq(is_a_theorem(implies(implies(implies(X1,X2),implies(X3,X2)),X4)),true,is_a_theorem(implies(implies(X3,X1),X4)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_30]),c_0_8]) ).
cnf(c_0_51,plain,
is_a_theorem(implies(implies(implies(implies(not(X1),X1),X1),X2),X2)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_8]) ).
cnf(c_0_52,plain,
is_a_theorem(implies(not(X1),implies(X2,implies(X1,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_8]) ).
cnf(c_0_53,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_49]),c_0_8]) ).
cnf(c_0_54,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X1,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_8]) ).
cnf(c_0_55,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),X4),implies(not(X2),X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_52]),c_0_8]) ).
cnf(c_0_56,plain,
ifeq(is_a_theorem(implies(implies(X1,X2),X3)),true,is_a_theorem(implies(X2,X3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_53]),c_0_8]) ).
cnf(c_0_57,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,X1),X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_54]),c_0_8]) ).
cnf(c_0_58,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_55]),c_0_8]) ).
cnf(c_0_59,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_8]) ).
cnf(c_0_60,plain,
ifeq(is_a_theorem(implies(implies(not(X1),implies(X1,X2)),X3)),true,is_a_theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_58]),c_0_8]) ).
cnf(c_0_61,plain,
ifeq(is_a_theorem(X1),true,is_a_theorem(implies(implies(X1,X2),X2)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_59]),c_0_8]) ).
cnf(c_0_62,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_57]),c_0_8]) ).
cnf(c_0_63,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),X2),X3),implies(X1,X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_59]),c_0_8]) ).
cnf(c_0_64,plain,
is_a_theorem(implies(implies(implies(implies(implies(X1,X2),X1),X1),X3),X3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_8]) ).
cnf(c_0_65,plain,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_63]),c_0_8]) ).
cnf(c_0_66,plain,
is_a_theorem(implies(implies(X1,implies(implies(X2,X3),X2)),implies(X1,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_64]),c_0_8]) ).
cnf(c_0_67,plain,
ifeq(is_a_theorem(implies(X1,implies(X2,X3))),true,is_a_theorem(implies(X2,implies(X1,X3))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_65]),c_0_8]) ).
cnf(c_0_68,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(X3,X1),X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_66]),c_0_8]) ).
cnf(c_0_69,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(implies(X2,X3),X1),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_8]) ).
cnf(c_0_70,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),not(X1)),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_69]),c_0_8]) ).
cnf(c_0_71,negated_conjecture,
is_a_theorem(implies(implies(x,not(y)),implies(y,not(x)))) != true,
inference(fof_simplification,[status(thm)],[prove_cn_47]) ).
cnf(c_0_72,plain,
ifeq(is_a_theorem(implies(implies(implies(not(X1),X1),X2),X3)),true,is_a_theorem(implies(implies(X1,X2),X3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_26]),c_0_8]) ).
cnf(c_0_73,plain,
is_a_theorem(implies(implies(implies(X1,X2),not(X3)),implies(X3,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_70]),c_0_8]) ).
cnf(c_0_74,negated_conjecture,
is_a_theorem(implies(implies(x,not(y)),implies(y,not(x)))) != true,
c_0_71 ).
cnf(c_0_75,plain,
is_a_theorem(implies(implies(X1,not(X2)),implies(X2,not(X1)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_8]) ).
cnf(c_0_76,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL385-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/5.46 % Computer : n018.cluster.edu
% 0.19/5.46 % Model : x86_64 x86_64
% 0.19/5.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/5.46 % Memory : 8046.5625MB
% 0.19/5.46 % OS : Linux 6.8.0-71-generic
% 0.19/5.46 % CPULimit : 300
% 0.19/5.46 % WCLimit : 300
% 0.19/5.46 % DateTime : Mon Sep 21 00:29:04 UTC 2026
% 0.19/5.46 % CPUTime :
% 0.19/5.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/5.51 Running first-order theorem proving
% 0.24/5.51 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
% 213.91/42.93 % Version: 3.5.1
% 213.91/42.93 % Preprocessing class: FSSSSMSSSSSNFFN.
% 213.91/42.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 213.91/42.93 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 213.91/42.93 % Starting new_bool_3 with 300s (1) cores
% 213.91/42.93 % Starting new_bool_1 with 300s (1) cores
% 213.91/42.93 % Starting sh5l with 300s (1) cores
% 213.91/42.93 % new_bool_1 with pid 578453 completed with status 9
% 213.91/42.93 % new_bool_3 with pid 578452 completed with status 9
% 213.91/42.93 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 578451 completed with status 0
% 213.91/42.93 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 213.91/42.93 % Preprocessing class: FSSSSMSSSSSNFFN.
% 213.91/42.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 213.91/42.93 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 213.91/42.93 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 213.91/42.93 % No SInE strategy applied
% 213.91/42.93 % Search class: FUUPM-FFSF32-MFFFFFNN
% 213.91/42.93 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 213.91/42.93 % Starting SubtermCWHack with 136s (1) cores
% 213.91/42.93 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 213.91/42.93 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 213.91/42.93 % Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 213.91/42.93 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 213.91/42.93 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 578456 completed with status 0
% 213.91/42.93 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 213.91/42.93 % Preprocessing class: FSSSSMSSSSSNFFN.
% 213.91/42.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 213.91/42.93 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 213.91/42.93 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 213.91/42.93 % No SInE strategy applied
% 213.91/42.93 % Search class: FUUPM-FFSF32-MFFFFFNN
% 213.91/42.93 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 213.91/42.93 % Starting SubtermCWHack with 136s (1) cores
% 213.91/42.93 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 213.91/42.93 % Preprocessing time : 0.002 s
% 213.91/42.93
% 213.91/42.93 % Proof found!
% 213.91/42.93 % SZS status Unsatisfiable
% 213.91/42.93 % SZS output start CNFRefutation
% See solution above
% 213.91/42.93 % Parsed axioms : 6
% 213.91/42.93 % Removed by relevancy pruning/SinE : 0
% 213.91/42.93 % Initial clauses : 6
% 213.91/42.93 % Removed in clause preprocessing : 0
% 213.91/42.93 % Initial clauses in saturation : 6
% 213.91/42.93 % Processed clauses : 10766
% 213.91/42.93 % ...of these trivial : 6476
% 213.91/42.93 % ...subsumed : 0
% 213.91/42.93 % ...remaining for further processing : 4290
% 213.91/42.93 % Other redundant clauses eliminated : 0
% 213.91/42.93 % Clauses deleted for lack of memory : 0
% 213.91/42.93 % Backward-subsumed : 0
% 213.91/42.93 % Backward-rewritten : 120
% 213.91/42.93 % Generated clauses : 2326496
% 213.91/42.93 % ...of the previous two non-redundant : 507269
% 213.91/42.93 % ...aggressively subsumed : 0
% 213.91/42.93 % Contextual simplify-reflections : 0
% 213.91/42.93 % Paramodulations : 2326496
% 213.91/42.93 % Factorizations : 0
% 213.91/42.93 % NegExts : 0
% 213.91/42.93 % Equation resolutions : 0
% 213.91/42.93 % Disequality decompositions : 0
% 213.91/42.93 % Total rewrite steps : 2647250
% 213.91/42.93 % ...of those cached : 1270743
% 213.91/42.93 % Propositional unsat checks : 0
% 213.91/42.93 % Propositional check models : 0
% 213.91/42.93 % Propositional check unsatisfiable : 0
% 213.91/42.93 % Propositional clauses : 0
% 213.91/42.93 % Propositional clauses after purity: 0
% 213.91/42.93 % Propositional unsat core size : 0
% 213.91/42.93 % Propositional preprocessing time : 0.000
% 213.91/42.93 % Propositional encoding time : 0.000
% 213.91/42.93 % Propositional solver time : 0.000
% 213.91/42.93 % Success case prop preproc time : 0.000
% 213.91/42.93 % Success case prop encoding time : 0.000
% 213.91/42.93 % Success case prop solver time : 0.000
% 213.91/42.93 % Current number of processed clauses : 4170
% 213.91/42.93 % Positive orientable unit clauses : 4170
% 213.91/42.93 % Positive unorientable unit clauses: 0
% 213.91/42.93 % Negative unit clauses : 0
% 213.91/42.93 % Non-unit-clauses : 0
% 213.91/42.93 % Current number of unprocessed clauses: 496127
% 213.91/42.93 % ...number of literals in the above : 496127
% 213.91/42.93 % Current number of archived formulas : 0
% 213.91/42.93 % Current number of archived clauses : 120
% 213.91/42.93 % Clause-clause subsumption calls (NU) : 0
% 213.91/42.93 % Rec. Clause-clause subsumption calls : 0
% 213.91/42.93 % Non-unit clause-clause subsumptions : 0
% 213.91/42.93 % Unit Clause-clause subsumption calls : 0
% 213.91/42.93 % Rewrite failures with RHS unbound : 0
% 213.91/42.93 % BW rewrite match attempts : 1831773
% 213.91/42.93 % BW rewrite match successes : 119
% 213.91/42.93 % Condensation attempts : 0
% 213.91/42.93 % Condensation successes : 0
% 213.91/42.93 % Termbank termtop insertions : 57939556
% 213.91/42.93 % Search garbage collected termcells : 2
% 213.91/42.93
% 213.91/42.93 % -------------------------------------------------
% 213.91/42.93 % User time : 35.812 s
% 213.91/42.93 % System time : 1.010 s
% 213.91/42.93 % Total time : 36.823 s
% 213.91/42.93 % Maximum resident set size: 3376 pages
% 213.91/42.93
% 213.91/42.93 % -------------------------------------------------
% 213.91/42.93 % User time : 180.864 s
% 213.91/42.93 % System time : 4.696 s
% 213.91/42.93 % Total time : 185.560 s
% 213.91/42.93 % Maximum resident set size: 4608 pages
% 213.91/42.93 % E exiting
%------------------------------------------------------------------------------