%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL085-1 : TPTP v9.3.1. Released v1.0.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 01:11:43 PM UTC 2026
% Result : Unsatisfiable 7.65s 1.40s
% Output : CNFRefutation 7.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 47
% Number of leaves : 3
% Syntax : Number of clauses : 84 ( 57 unt; 0 nHn; 14 RR)
% Number of literals : 115 ( 0 equ; 34 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 297 ( 130 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(ic_JLukasiewicz,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(X3,X1),implies(X4,X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ic_JLukasiewicz) ).
cnf(prove_ic_5,negated_conjecture,
~ is_a_theorem(implies(a,implies(implies(a,b),b))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ic_5) ).
cnf(c_0_3,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
inference(fof_simplification,[status(thm)],[condensed_detachment]) ).
cnf(c_0_4,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
c_0_3 ).
cnf(c_0_5,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(X3,X1),implies(X4,X1)))),
ic_JLukasiewicz ).
cnf(c_0_6,plain,
( ~ is_a_theorem(implies(implies(X2,X4),X1))
| is_a_theorem(implies(implies(X1,X2),implies(X3,X2))) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4)))),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_8,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),implies(implies(X4,X2),implies(X5,X2))),implies(X6,implies(implies(X4,X2),implies(X5,X2))))),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
( ~ is_a_theorem(implies(implies(X5,implies(X3,X6)),implies(implies(X2,X3),implies(X4,X3))))
| is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,X3)))) ),
inference(spm,[status(thm)],[c_0_4,c_0_8]) ).
cnf(c_0_10,plain,
is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X3,X3)))),
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_11,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(implies(implies(X1,X2),implies(X2,X2))) ),
inference(spm,[status(thm)],[c_0_4,c_0_10]) ).
cnf(c_0_12,plain,
is_a_theorem(implies(implies(X1,X2),implies(X2,X2))),
inference(spm,[status(thm)],[c_0_11,c_0_5]) ).
cnf(c_0_13,plain,
( ~ is_a_theorem(implies(X2,X1))
| is_a_theorem(implies(X1,X1)) ),
inference(spm,[status(thm)],[c_0_4,c_0_12]) ).
cnf(c_0_14,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),implies(X3,X2))),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_15,plain,
is_a_theorem(implies(implies(X1,X2),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1))),
inference(spm,[status(thm)],[c_0_6,c_0_15]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(implies(implies(X1,X2),implies(X2,X3)),implies(X4,implies(X2,X3)))),
inference(spm,[status(thm)],[c_0_6,c_0_16]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),implies(X4,X2)),implies(X5,implies(X4,X2)))),
inference(spm,[status(thm)],[c_0_6,c_0_17]) ).
cnf(c_0_19,plain,
( ~ is_a_theorem(implies(implies(X4,implies(X3,X5)),implies(X2,X3)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_4,c_0_18]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(X1,implies(implies(implies(implies(X2,X3),X4),X3),implies(X2,X3)))),
inference(spm,[status(thm)],[c_0_19,c_0_5]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),implies(X4,X2)))),
inference(spm,[status(thm)],[c_0_9,c_0_5]) ).
cnf(c_0_22,plain,
( ~ is_a_theorem(X4)
| is_a_theorem(implies(implies(implies(implies(X1,X2),X3),X2),implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_4,c_0_20]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(implies(implies(implies(implies(X1,X2),X1),implies(X3,X1)),X4),implies(X5,X4))),
inference(spm,[status(thm)],[c_0_6,c_0_21]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),X3),X2),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_22,c_0_5]) ).
cnf(c_0_25,plain,
( ~ is_a_theorem(implies(implies(implies(implies(X3,X4),X3),implies(X5,X3)),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_23]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(implies(implies(X1,X2),implies(implies(X1,X2),X3)),implies(X4,implies(implies(X1,X2),X3)))),
inference(spm,[status(thm)],[c_0_6,c_0_24]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(X1,implies(X2,implies(implies(implies(X3,X4),X3),X3)))),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,plain,
( ~ is_a_theorem(X4)
| is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),X2))) ),
inference(spm,[status(thm)],[c_0_4,c_0_27]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),X2))),
inference(spm,[status(thm)],[c_0_28,c_0_5]) ).
cnf(c_0_30,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(implies(implies(implies(X1,X2),X1),X1)) ),
inference(spm,[status(thm)],[c_0_4,c_0_29]) ).
cnf(c_0_31,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),implies(X4,implies(X3,X5))),implies(X6,implies(X4,implies(X3,X5))))),
inference(spm,[status(thm)],[c_0_6,c_0_18]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),X1)),
inference(spm,[status(thm)],[c_0_30,c_0_5]) ).
cnf(c_0_33,plain,
( ~ is_a_theorem(implies(implies(X5,implies(X6,X3)),implies(X2,implies(X3,X4))))
| is_a_theorem(implies(X1,implies(X2,implies(X3,X4)))) ),
inference(spm,[status(thm)],[c_0_4,c_0_31]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X3,implies(X1,X2)))),
inference(spm,[status(thm)],[c_0_6,c_0_32]) ).
cnf(c_0_35,plain,
( ~ is_a_theorem(implies(implies(X1,X2),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_32]) ).
cnf(c_0_36,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X4),implies(X3,X4)))),
inference(spm,[status(thm)],[c_0_33,c_0_5]) ).
cnf(c_0_37,plain,
( ~ is_a_theorem(implies(X2,implies(X2,X3)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_4,c_0_34]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,plain,
is_a_theorem(implies(X1,implies(implies(X2,implies(X2,X3)),implies(X2,X3)))),
inference(spm,[status(thm)],[c_0_37,c_0_34]) ).
cnf(c_0_40,plain,
( ~ is_a_theorem(implies(implies(X3,X1),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_38]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_35,c_0_39]) ).
cnf(c_0_42,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_40,c_0_5]) ).
cnf(c_0_43,plain,
( ~ is_a_theorem(implies(X1,implies(X1,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_41]) ).
cnf(c_0_44,plain,
is_a_theorem(implies(implies(implies(implies(implies(X1,X2),X3),implies(X4,X3)),X1),implies(X5,X1))),
inference(spm,[status(thm)],[c_0_6,c_0_42]) ).
cnf(c_0_45,plain,
( ~ is_a_theorem(implies(implies(implies(X4,X2),implies(X5,X2)),implies(X2,X3)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_4,c_0_7]) ).
cnf(c_0_46,plain,
is_a_theorem(implies(implies(implies(implies(implies(X1,X2),X3),implies(X4,X3)),X1),X1)),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_45,c_0_14]) ).
cnf(c_0_48,plain,
is_a_theorem(implies(implies(implies(implies(implies(X1,X2),X1),implies(X3,X1)),X4),X4)),
inference(spm,[status(thm)],[c_0_43,c_0_23]) ).
cnf(c_0_49,plain,
is_a_theorem(implies(implies(X1,implies(implies(implies(X1,X2),X3),implies(X4,X3))),implies(X5,implies(implies(implies(X1,X2),X3),implies(X4,X3))))),
inference(spm,[status(thm)],[c_0_6,c_0_46]) ).
cnf(c_0_50,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(implies(X1,implies(X2,X1))) ),
inference(spm,[status(thm)],[c_0_4,c_0_47]) ).
cnf(c_0_51,plain,
( ~ is_a_theorem(implies(implies(implies(implies(X2,X3),X2),implies(X4,X2)),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_48]) ).
cnf(c_0_52,plain,
is_a_theorem(implies(implies(X1,implies(implies(implies(X1,X2),X3),implies(X4,X3))),implies(implies(implies(X1,X2),X3),implies(X4,X3)))),
inference(spm,[status(thm)],[c_0_43,c_0_49]) ).
cnf(c_0_53,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_50,c_0_5]) ).
cnf(c_0_54,plain,
is_a_theorem(implies(implies(implies(implies(implies(implies(X1,X2),X3),implies(X1,X2)),X4),X2),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_53]) ).
cnf(c_0_56,plain,
is_a_theorem(implies(implies(implies(X1,X2),implies(implies(implies(implies(X1,X2),X3),implies(X1,X2)),X4)),implies(X5,implies(implies(implies(implies(X1,X2),X3),implies(X1,X2)),X4)))),
inference(spm,[status(thm)],[c_0_6,c_0_54]) ).
cnf(c_0_57,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(implies(X1,X2),implies(X3,X2))) ),
inference(spm,[status(thm)],[c_0_6,c_0_55]) ).
cnf(c_0_58,plain,
is_a_theorem(implies(implies(implies(X1,X2),implies(implies(implies(implies(X1,X2),X3),implies(X1,X2)),X4)),implies(implies(implies(implies(X1,X2),X3),implies(X1,X2)),X4))),
inference(spm,[status(thm)],[c_0_43,c_0_56]) ).
cnf(c_0_59,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(implies(X3,X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_57]) ).
cnf(c_0_60,plain,
is_a_theorem(implies(implies(implies(implies(implies(X1,X2),X1),X3),implies(implies(X1,X2),X1)),X1)),
inference(spm,[status(thm)],[c_0_51,c_0_58]) ).
cnf(c_0_61,plain,
( ~ is_a_theorem(implies(implies(X4,X2),X3))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_59,c_0_38]) ).
cnf(c_0_62,plain,
is_a_theorem(implies(implies(X1,implies(implies(implies(X1,X2),X1),X3)),implies(X4,implies(implies(implies(X1,X2),X1),X3)))),
inference(spm,[status(thm)],[c_0_6,c_0_60]) ).
cnf(c_0_63,plain,
is_a_theorem(implies(X1,implies(X2,implies(implies(X2,X3),implies(X4,X3))))),
inference(spm,[status(thm)],[c_0_61,c_0_5]) ).
cnf(c_0_64,plain,
is_a_theorem(implies(implies(implies(X1,implies(implies(implies(X2,X3),X2),X4)),X2),implies(X5,X2))),
inference(spm,[status(thm)],[c_0_6,c_0_62]) ).
cnf(c_0_65,plain,
is_a_theorem(implies(implies(implies(X1,implies(implies(X1,X2),implies(X3,X2))),X4),implies(X5,X4))),
inference(spm,[status(thm)],[c_0_6,c_0_63]) ).
cnf(c_0_66,plain,
is_a_theorem(implies(implies(implies(X1,implies(implies(implies(X2,X3),X2),X4)),X2),X2)),
inference(spm,[status(thm)],[c_0_43,c_0_64]) ).
cnf(c_0_67,plain,
( ~ is_a_theorem(implies(implies(X3,X5),X2))
| is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,X3)))) ),
inference(spm,[status(thm)],[c_0_59,c_0_5]) ).
cnf(c_0_68,plain,
is_a_theorem(implies(implies(implies(X1,implies(implies(X1,X2),implies(X3,X2))),X4),X4)),
inference(spm,[status(thm)],[c_0_43,c_0_65]) ).
cnf(c_0_69,plain,
is_a_theorem(implies(implies(X1,implies(X2,implies(implies(implies(X1,X3),X1),X4))),implies(X5,implies(X2,implies(implies(implies(X1,X3),X1),X4))))),
inference(spm,[status(thm)],[c_0_6,c_0_66]) ).
cnf(c_0_70,plain,
is_a_theorem(implies(X1,implies(implies(X2,implies(X2,X3)),implies(X4,implies(X2,X3))))),
inference(spm,[status(thm)],[c_0_67,c_0_32]) ).
cnf(c_0_71,plain,
( ~ is_a_theorem(implies(implies(X2,implies(implies(X2,X3),implies(X4,X3))),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_68]) ).
cnf(c_0_72,plain,
is_a_theorem(implies(implies(X1,implies(X2,implies(implies(implies(X1,X3),X1),X4))),implies(X2,implies(implies(implies(X1,X3),X1),X4)))),
inference(spm,[status(thm)],[c_0_43,c_0_69]) ).
cnf(c_0_73,plain,
is_a_theorem(implies(implies(implies(implies(X1,implies(X1,X2)),implies(X3,implies(X1,X2))),X4),implies(X5,X4))),
inference(spm,[status(thm)],[c_0_6,c_0_70]) ).
cnf(c_0_74,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(implies(X1,X3),X1),X2))),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_75,plain,
is_a_theorem(implies(implies(implies(implies(X1,implies(X1,X2)),implies(X3,implies(X1,X2))),X4),X4)),
inference(spm,[status(thm)],[c_0_43,c_0_73]) ).
cnf(c_0_76,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),implies(implies(X1,X3),implies(X4,X3)))),
inference(spm,[status(thm)],[c_0_71,c_0_74]) ).
cnf(c_0_77,plain,
( ~ is_a_theorem(implies(implies(implies(X2,implies(X2,X3)),implies(X4,implies(X2,X3))),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_75]) ).
cnf(c_0_78,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X1,X4)),implies(X5,implies(X1,X4)))),
inference(spm,[status(thm)],[c_0_6,c_0_76]) ).
cnf(c_0_79,negated_conjecture,
~ is_a_theorem(implies(a,implies(implies(a,b),b))),
inference(fof_simplification,[status(thm)],[prove_ic_5]) ).
cnf(c_0_80,plain,
is_a_theorem(implies(X1,implies(X2,implies(implies(X2,X3),X3)))),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_81,negated_conjecture,
~ is_a_theorem(implies(a,implies(implies(a,b),b))),
c_0_79 ).
cnf(c_0_82,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_35,c_0_80]) ).
cnf(c_0_83,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_82])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL085-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Mon Sep 21 00:04:21 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.32 Running first-order theorem proving
% 0.07/0.32 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
% 7.65/1.40 % Version: 3.5.1
% 7.65/1.40 % Preprocessing class: FSSSSMSSSSSNFFN.
% 7.65/1.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.65/1.40 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 7.65/1.40 % Starting new_bool_3 with 300s (1) cores
% 7.65/1.40 % Starting new_bool_1 with 300s (1) cores
% 7.65/1.40 % Starting sh5l with 300s (1) cores
% 7.65/1.40 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1191887 completed with status 0
% 7.65/1.40 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 7.65/1.40 % Preprocessing class: FSSSSMSSSSSNFFN.
% 7.65/1.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.65/1.40 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 7.65/1.40 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.65/1.40 % No SInE strategy applied
% 7.65/1.40 % Search class: FHUNF-FFSF22-MFFFFFNN
% 7.65/1.40 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 7.65/1.40 % Starting SubtermCWHack with 136s (1) cores
% 7.65/1.40 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 7.65/1.40 % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 7.65/1.40 % Starting new_bool_3 with 136s (1) cores
% 7.65/1.40 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 7.65/1.40 % U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 1191898 completed with status 0
% 7.65/1.40 % Result found by U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 7.65/1.40 % Preprocessing class: FSSSSMSSSSSNFFN.
% 7.65/1.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.65/1.40 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 7.65/1.40 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.65/1.40 % No SInE strategy applied
% 7.65/1.40 % Search class: FHUNF-FFSF22-MFFFFFNN
% 7.65/1.40 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 7.65/1.40 % Starting SubtermCWHack with 136s (1) cores
% 7.65/1.40 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 7.65/1.40 % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 7.65/1.40 % Starting new_bool_3 with 136s (1) cores
% 7.65/1.40 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 7.65/1.40 % Preprocessing time : 0.001 s
% 7.65/1.40 % Presaturation interreduction done
% 7.65/1.40
% 7.65/1.40 % Proof found!
% 7.65/1.40 % SZS status Unsatisfiable
% 7.65/1.40 % SZS output start CNFRefutation
% See solution above
% 7.65/1.40 % Parsed axioms : 3
% 7.65/1.40 % Removed by relevancy pruning/SinE : 0
% 7.65/1.40 % Initial clauses : 3
% 7.65/1.40 % Removed in clause preprocessing : 0
% 7.65/1.40 % Initial clauses in saturation : 3
% 7.65/1.40 % Processed clauses : 8083
% 7.65/1.40 % ...of these trivial : 1634
% 7.65/1.40 % ...subsumed : 5412
% 7.65/1.40 % ...remaining for further processing : 1037
% 7.65/1.40 % Other redundant clauses eliminated : 0
% 7.65/1.40 % Clauses deleted for lack of memory : 0
% 7.65/1.40 % Backward-subsumed : 9
% 7.65/1.40 % Backward-rewritten : 62
% 7.65/1.40 % Generated clauses : 115853
% 7.65/1.40 % ...of the previous two non-redundant : 39949
% 7.65/1.40 % ...aggressively subsumed : 0
% 7.65/1.40 % Contextual simplify-reflections : 0
% 7.65/1.40 % Paramodulations : 115853
% 7.65/1.40 % Factorizations : 0
% 7.65/1.40 % NegExts : 0
% 7.65/1.40 % Equation resolutions : 0
% 7.65/1.40 % Disequality decompositions : 0
% 7.65/1.40 % Total rewrite steps : 76981
% 7.65/1.40 % ...of those cached : 73653
% 7.65/1.40 % Propositional unsat checks : 0
% 7.65/1.40 % Propositional check models : 0
% 7.65/1.40 % Propositional check unsatisfiable : 0
% 7.65/1.40 % Propositional clauses : 0
% 7.65/1.40 % Propositional clauses after purity: 0
% 7.65/1.40 % Propositional unsat core size : 0
% 7.65/1.40 % Propositional preprocessing time : 0.000
% 7.65/1.40 % Propositional encoding time : 0.000
% 7.65/1.40 % Propositional solver time : 0.000
% 7.65/1.40 % Success case prop preproc time : 0.000
% 7.65/1.40 % Success case prop encoding time : 0.000
% 7.65/1.40 % Success case prop solver time : 0.000
% 7.65/1.40 % Current number of processed clauses : 963
% 7.65/1.40 % Positive orientable unit clauses : 659
% 7.65/1.40 % Positive unorientable unit clauses: 0
% 7.65/1.40 % Negative unit clauses : 3
% 7.65/1.40 % Non-unit-clauses : 301
% 7.65/1.40 % Current number of unprocessed clauses: 31170
% 7.65/1.40 % ...number of literals in the above : 39106
% 7.65/1.40 % Current number of archived formulas : 0
% 7.65/1.40 % Current number of archived clauses : 74
% 7.65/1.40 % Clause-clause subsumption calls (NU) : 70164
% 7.65/1.40 % Rec. Clause-clause subsumption calls : 70164
% 7.65/1.40 % Non-unit clause-clause subsumptions : 5419
% 7.65/1.40 % Unit Clause-clause subsumption calls : 1594
% 7.65/1.40 % Rewrite failures with RHS unbound : 0
% 7.65/1.40 % BW rewrite match attempts : 191011
% 7.65/1.40 % BW rewrite match successes : 62
% 7.65/1.40 % Condensation attempts : 0
% 7.65/1.40 % Condensation successes : 0
% 7.65/1.40 % Termbank termtop insertions : 1301202
% 7.65/1.40 % Search garbage collected termcells : 8
% 7.65/1.40
% 7.65/1.40 % -------------------------------------------------
% 7.65/1.40 % User time : 0.909 s
% 7.65/1.40 % System time : 0.025 s
% 7.65/1.40 % Total time : 0.934 s
% 7.65/1.40 % Maximum resident set size: 3632 pages
% 7.65/1.40
% 7.65/1.40 % -------------------------------------------------
% 7.65/1.40 % User time : 4.980 s
% 7.65/1.40 % System time : 0.164 s
% 7.65/1.40 % Total time : 5.144 s
% 7.65/1.40 % Maximum resident set size: 4608 pages
% 7.65/1.40 % E exiting
%------------------------------------------------------------------------------