%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL119-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:18:32 PM UTC 2026
% Result : Unsatisfiable 70.32s 10.90s
% Output : CNFRefutation 80.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 39
% Number of leaves : 3
% Syntax : Number of clauses : 84 ( 37 unt; 0 nHn; 38 RR)
% Number of literals : 148 ( 0 equ; 67 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 242 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,X2))
| is_a_theorem(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(xgj,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X1)),equivalent(X2,X3)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xgj) ).
cnf(prove_wo,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(c,equivalent(b,a)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_wo) ).
cnf(c_0_3,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(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(equivalent(X1,X2))
| is_a_theorem(X2) ),
c_0_3 ).
cnf(c_0_5,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X1)),equivalent(X2,X3)))),
xgj ).
cnf(c_0_6,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,X2))) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_6]) ).
cnf(c_0_8,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(X2)
| is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),X1)) ),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_9,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_8]) ).
cnf(c_0_10,plain,
( ~ is_a_theorem(equivalent(X2,X3))
| ~ is_a_theorem(equivalent(X2,equivalent(X3,X1)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_5]) ).
cnf(c_0_11,plain,
( ~ is_a_theorem(equivalent(X3,equivalent(X1,equivalent(X2,X3))))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_5]) ).
cnf(c_0_12,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X2)),X1)),
inference(spm,[status(thm)],[c_0_11,c_0_5]) ).
cnf(c_0_13,plain,
( ~ is_a_theorem(equivalent(X2,X3))
| is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X1)))) ),
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_14,plain,
( ~ is_a_theorem(equivalent(X1,equivalent(X2,X2)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_12]) ).
cnf(c_0_15,plain,
( ~ is_a_theorem(equivalent(X2,X3))
| ~ is_a_theorem(equivalent(X3,X1))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_13]) ).
cnf(c_0_16,plain,
is_a_theorem(equivalent(equivalent(X1,X1),equivalent(X2,X2))),
inference(spm,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_17,plain,
( ~ is_a_theorem(equivalent(X2,equivalent(X1,equivalent(X3,X3))))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_18,plain,
is_a_theorem(equivalent(X1,X1)),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_19,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X1,X2)),X2)),
inference(spm,[status(thm)],[c_0_17,c_0_5]) ).
cnf(c_0_20,plain,
( ~ is_a_theorem(equivalent(X2,X1))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_21,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(X1,X2))
| is_a_theorem(equivalent(X1,equivalent(X2,X3))) ),
inference(spm,[status(thm)],[c_0_4,c_0_13]) ).
cnf(c_0_22,plain,
( ~ is_a_theorem(equivalent(equivalent(X2,X2),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_23,plain,
( ~ is_a_theorem(equivalent(equivalent(X2,equivalent(X2,equivalent(X3,X1))),X3))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_19]) ).
cnf(c_0_24,plain,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X3,X1))
| is_a_theorem(equivalent(equivalent(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X3,X3))),equivalent(X1,X2))),
inference(spm,[status(thm)],[c_0_22,c_0_5]) ).
cnf(c_0_26,plain,
( ~ is_a_theorem(equivalent(X3,X2))
| ~ is_a_theorem(equivalent(X2,equivalent(X3,X1)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( ~ is_a_theorem(equivalent(X3,equivalent(X1,equivalent(X2,equivalent(X4,X4)))))
| is_a_theorem(equivalent(equivalent(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_15,c_0_25]) ).
cnf(c_0_28,plain,
( ~ is_a_theorem(equivalent(X2,equivalent(X3,equivalent(X3,X1))))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_29,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(equivalent(equivalent(X1,X2),X1)) ),
inference(spm,[status(thm)],[c_0_7,c_0_18]) ).
cnf(c_0_30,plain,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),X3))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_5]) ).
cnf(c_0_31,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(equivalent(X2,X2),X3)),X1),X3)),
inference(spm,[status(thm)],[c_0_27,c_0_5]) ).
cnf(c_0_32,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X2,X1)),X3))) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,X1)))),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_34,plain,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_21]) ).
cnf(c_0_35,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,equivalent(X3,equivalent(X3,X1)))))),
inference(spm,[status(thm)],[c_0_28,c_0_19]) ).
cnf(c_0_36,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X3),X2)),X1)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
( ~ is_a_theorem(equivalent(equivalent(X3,equivalent(X3,X2)),X1))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_32]) ).
cnf(c_0_38,plain,
( ~ is_a_theorem(equivalent(X3,X2))
| is_a_theorem(equivalent(equivalent(X1,equivalent(X1,X2)),X3)) ),
inference(spm,[status(thm)],[c_0_15,c_0_33]) ).
cnf(c_0_39,plain,
( ~ is_a_theorem(equivalent(equivalent(X2,equivalent(X3,X1)),equivalent(X2,X3)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_5]) ).
cnf(c_0_40,plain,
( ~ is_a_theorem(equivalent(X3,X1))
| is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,X3)))) ),
inference(spm,[status(thm)],[c_0_10,c_0_35]) ).
cnf(c_0_41,plain,
( ~ is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X3),X2)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_36]) ).
cnf(c_0_42,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,equivalent(X3,equivalent(X3,X4)))),equivalent(X1,X2)),X4)),
inference(spm,[status(thm)],[c_0_37,c_0_5]) ).
cnf(c_0_43,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(equivalent(equivalent(X2,X1),X3),X2))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_29]) ).
cnf(c_0_44,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,X2)),X3)),
inference(spm,[status(thm)],[c_0_20,c_0_5]) ).
cnf(c_0_45,plain,
( ~ is_a_theorem(equivalent(X1,X3))
| is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,X3)))) ),
inference(spm,[status(thm)],[c_0_20,c_0_38]) ).
cnf(c_0_46,plain,
( ~ is_a_theorem(equivalent(X2,equivalent(X3,equivalent(equivalent(X3,X2),X1))))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_47,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,equivalent(X3,equivalent(equivalent(X4,X4),equivalent(X1,X2))))))),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,plain,
( ~ is_a_theorem(equivalent(X2,X3))
| ~ is_a_theorem(equivalent(equivalent(X2,X1),X3))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_38]) ).
cnf(c_0_49,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,equivalent(X4,equivalent(X4,X1)))),equivalent(X2,X3)))),
inference(spm,[status(thm)],[c_0_28,c_0_44]) ).
cnf(c_0_50,plain,
( ~ is_a_theorem(equivalent(X1,X3))
| ~ is_a_theorem(equivalent(X2,X3))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_45]) ).
cnf(c_0_51,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X3),equivalent(X2,X1)))),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,plain,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X2),X3)),X3))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_31]) ).
cnf(c_0_53,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(equivalent(X2,X2),equivalent(X3,equivalent(X3,X4)))),X1),X4)),
inference(spm,[status(thm)],[c_0_27,c_0_49]) ).
cnf(c_0_54,plain,
( ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X4,X4),equivalent(X3,X2))))
| is_a_theorem(equivalent(X1,equivalent(X2,X3))) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X1),X2),equivalent(equivalent(X3,X3),equivalent(X4,equivalent(X4,X2))))),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_56,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X1),X2),equivalent(equivalent(X3,X2),X3))),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_57,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X1),equivalent(equivalent(X3,X3),X2))),
inference(spm,[status(thm)],[c_0_20,c_0_56]) ).
cnf(c_0_58,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),X1),equivalent(X3,X2))),
inference(spm,[status(thm)],[c_0_54,c_0_57]) ).
cnf(c_0_59,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(equivalent(X3,X1),X3)),X2))),
inference(spm,[status(thm)],[c_0_28,c_0_58]) ).
cnf(c_0_60,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X2),X3)),X1)),
inference(spm,[status(thm)],[c_0_11,c_0_59]) ).
cnf(c_0_61,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,equivalent(X2,X1)),X3),equivalent(equivalent(X4,X3),X4)))),
inference(spm,[status(thm)],[c_0_28,c_0_60]) ).
cnf(c_0_62,plain,
( ~ is_a_theorem(equivalent(X2,equivalent(X2,X1)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_19]) ).
cnf(c_0_63,plain,
( ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X4,X3),X4)))
| is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X2),X3))) ),
inference(spm,[status(thm)],[c_0_50,c_0_56]) ).
cnf(c_0_64,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X1,X2)),X3),equivalent(X2,X3))),
inference(spm,[status(thm)],[c_0_11,c_0_61]) ).
cnf(c_0_65,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X2,equivalent(X2,X3)),X1),X3))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_38]) ).
cnf(c_0_66,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(equivalent(equivalent(X1,equivalent(X1,equivalent(X2,X3))),X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_19]) ).
cnf(c_0_67,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X1,equivalent(X2,X3))),X2),equivalent(equivalent(X4,X4),X3))),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_68,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(equivalent(equivalent(X1,equivalent(X1,X2)),equivalent(X2,X3))) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_69,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X4,X1),X3),X4))
| is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X2),X3))) ),
inference(spm,[status(thm)],[c_0_63,c_0_13]) ).
cnf(c_0_70,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X1,equivalent(X2,equivalent(X3,X4)))),X2),equivalent(X4,X3))),
inference(spm,[status(thm)],[c_0_54,c_0_67]) ).
cnf(c_0_71,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(X3,X1)))) ),
inference(spm,[status(thm)],[c_0_20,c_0_68]) ).
cnf(c_0_72,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(X2,X1))),equivalent(equivalent(X4,X4),X3))),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_73,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(equivalent(X2,X3),X1))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_71]) ).
cnf(c_0_74,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X4),equivalent(X2,X1))),equivalent(X4,X3))),
inference(spm,[status(thm)],[c_0_54,c_0_72]) ).
cnf(c_0_75,plain,
( ~ is_a_theorem(equivalent(equivalent(X2,X1),equivalent(X4,X3)))
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X4))) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_76,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X4),equivalent(X3,equivalent(X4,equivalent(X2,X1)))))),
inference(spm,[status(thm)],[c_0_75,c_0_5]) ).
cnf(c_0_77,plain,
( ~ is_a_theorem(equivalent(X3,equivalent(X4,equivalent(X2,X1))))
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X4))) ),
inference(spm,[status(thm)],[c_0_7,c_0_76]) ).
cnf(c_0_78,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(X2,equivalent(X1,X3))))),
inference(spm,[status(thm)],[c_0_77,c_0_5]) ).
cnf(c_0_79,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(c,equivalent(b,a)))),
inference(fof_simplification,[status(thm)],[prove_wo]) ).
cnf(c_0_80,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X1,X3),X2))),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_81,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(c,equivalent(b,a)))),
c_0_79 ).
cnf(c_0_82,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,equivalent(X2,X1)))),
inference(spm,[status(thm)],[c_0_75,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.05 % Problem : LCL119-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.46 % Computer : n014.cluster.edu
% 0.21/0.46 % Model : x86_64 x86_64
% 0.21/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.46 % Memory : 8046.5625MB
% 0.21/0.46 % OS : Linux 6.8.0-71-generic
% 0.21/0.46 % CPULimit : 300
% 0.21/0.46 % WCLimit : 300
% 0.21/0.46 % DateTime : Mon Sep 21 00:06:04 UTC 2026
% 0.21/0.46 % CPUTime :
% 0.21/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.54 Running first-order theorem proving
% 0.24/0.54 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
% 70.32/10.90 % Version: 3.5.1
% 70.32/10.90 % Preprocessing class: FSSSSMSSSSSNFFN.
% 70.32/10.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 70.32/10.90 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 70.32/10.90 % Starting new_bool_3 with 300s (1) cores
% 70.32/10.90 % Starting new_bool_1 with 300s (1) cores
% 70.32/10.90 % Starting sh5l with 300s (1) cores
% 70.32/10.90 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2729190 completed with status 0
% 70.32/10.90 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 70.32/10.90 % Preprocessing class: FSSSSMSSSSSNFFN.
% 70.32/10.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 70.32/10.90 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 70.32/10.90 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 70.32/10.90 % No SInE strategy applied
% 70.32/10.90 % Search class: FHUNF-FFSF22-MFFFFFNN
% 70.32/10.90 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 70.32/10.90 % Starting SubtermCWHack with 136s (1) cores
% 70.32/10.90 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 70.32/10.90 % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 70.32/10.90 % Starting new_bool_3 with 136s (1) cores
% 70.32/10.90 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 70.32/10.90 % G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with pid 2729197 completed with status 0
% 70.32/10.90 % Result found by G-E--_060_C18_F1_PI_AE_CS_SP_S0Y
% 70.32/10.90 % Preprocessing class: FSSSSMSSSSSNFFN.
% 70.32/10.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 70.32/10.90 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 70.32/10.90 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 70.32/10.90 % No SInE strategy applied
% 70.32/10.90 % Search class: FHUNF-FFSF22-MFFFFFNN
% 70.32/10.90 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 70.32/10.90 % Starting SubtermCWHack with 136s (1) cores
% 70.32/10.90 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 70.32/10.90 % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 70.32/10.90 % Preprocessing time : 0.002 s
% 70.32/10.90
% 70.32/10.90 % Proof found!
% 70.32/10.90 % SZS status Unsatisfiable
% 70.32/10.90 % SZS output start CNFRefutation
% See solution above
% 80.75/10.90 % Parsed axioms : 3
% 80.75/10.90 % Removed by relevancy pruning/SinE : 0
% 80.75/10.90 % Initial clauses : 3
% 80.75/10.90 % Removed in clause preprocessing : 0
% 80.75/10.90 % Initial clauses in saturation : 3
% 80.75/10.90 % Processed clauses : 62669
% 80.75/10.90 % ...of these trivial : 18962
% 80.75/10.90 % ...subsumed : 41561
% 80.75/10.90 % ...remaining for further processing : 2146
% 80.75/10.90 % Other redundant clauses eliminated : 0
% 80.75/10.90 % Clauses deleted for lack of memory : 0
% 80.75/10.90 % Backward-subsumed : 0
% 80.75/10.90 % Backward-rewritten : 1
% 80.75/10.90 % Generated clauses : 586898
% 80.75/10.90 % ...of the previous two non-redundant : 381298
% 80.75/10.90 % ...aggressively subsumed : 0
% 80.75/10.90 % Contextual simplify-reflections : 0
% 80.75/10.90 % Paramodulations : 586898
% 80.75/10.90 % Factorizations : 0
% 80.75/10.90 % NegExts : 0
% 80.75/10.90 % Equation resolutions : 0
% 80.75/10.90 % Disequality decompositions : 0
% 80.75/10.90 % Total rewrite steps : 241180
% 80.75/10.90 % ...of those cached : 239509
% 80.75/10.90 % Propositional unsat checks : 0
% 80.75/10.90 % Propositional check models : 0
% 80.75/10.90 % Propositional check unsatisfiable : 0
% 80.75/10.90 % Propositional clauses : 0
% 80.75/10.90 % Propositional clauses after purity: 0
% 80.75/10.90 % Propositional unsat core size : 0
% 80.75/10.90 % Propositional preprocessing time : 0.000
% 80.75/10.90 % Propositional encoding time : 0.000
% 80.75/10.90 % Propositional solver time : 0.000
% 80.75/10.90 % Success case prop preproc time : 0.000
% 80.75/10.90 % Success case prop encoding time : 0.000
% 80.75/10.90 % Success case prop solver time : 0.000
% 80.75/10.90 % Current number of processed clauses : 2145
% 80.75/10.90 % Positive orientable unit clauses : 1361
% 80.75/10.90 % Positive unorientable unit clauses: 0
% 80.75/10.90 % Negative unit clauses : 0
% 80.75/10.90 % Non-unit-clauses : 784
% 80.75/10.90 % Current number of unprocessed clauses: 318632
% 80.75/10.90 % ...number of literals in the above : 433058
% 80.75/10.90 % Current number of archived formulas : 0
% 80.75/10.90 % Current number of archived clauses : 1
% 80.75/10.90 % Clause-clause subsumption calls (NU) : 1636327
% 80.75/10.90 % Rec. Clause-clause subsumption calls : 1635939
% 80.75/10.90 % Non-unit clause-clause subsumptions : 41561
% 80.75/10.90 % Unit Clause-clause subsumption calls : 23
% 80.75/10.90 % Rewrite failures with RHS unbound : 0
% 80.75/10.90 % BW rewrite match attempts : 756343
% 80.75/10.90 % BW rewrite match successes : 1
% 80.75/10.90 % Condensation attempts : 0
% 80.75/10.90 % Condensation successes : 0
% 80.75/10.90 % Termbank termtop insertions : 6959887
% 80.75/10.90 % Search garbage collected termcells : 8
% 80.75/10.90
% 80.75/10.90 % -------------------------------------------------
% 80.75/10.90 % User time : 9.773 s
% 80.75/10.90 % System time : 0.253 s
% 80.75/10.90 % Total time : 10.026 s
% 80.75/10.90 % Maximum resident set size: 3632 pages
% 80.75/10.90
% 80.75/10.90 % -------------------------------------------------
% 80.75/10.90 % User time : 48.176 s
% 80.75/10.90 % System time : 1.474 s
% 80.75/10.90 % Total time : 49.650 s
% 80.75/10.90 % Maximum resident set size: 4608 pages
% 80.75/10.90 % E exiting
%------------------------------------------------------------------------------