%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL122-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:50 PM UTC 2026
% Result : Unsatisfiable 1.47s 0.76s
% Output : CNFRefutation 1.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 39
% Number of leaves : 3
% Syntax : Number of clauses : 58 ( 15 unt; 0 nHn; 47 RR)
% Number of literals : 138 ( 0 equ; 115 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 144 ( 25 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(lg_2,axiom,
is_a_theorem(equivalent(X1,equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X2,X4),equivalent(X3,X4)))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_2) ).
cnf(prove_lg_3,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f))))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_lg_3) ).
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(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X2,X4),equivalent(X3,X4)))))),
lg_2 ).
cnf(c_0_6,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X2,X4),equivalent(X3,X4))))) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
( ~ is_a_theorem(X4)
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))) ),
inference(spm,[status(thm)],[c_0_4,c_0_6]) ).
cnf(c_0_8,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f))))))),
inference(fof_simplification,[status(thm)],[prove_lg_3]) ).
cnf(c_0_9,plain,
( ~ is_a_theorem(X4)
| ~ is_a_theorem(equivalent(X1,X3))
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2))) ),
inference(spm,[status(thm)],[c_0_4,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f))))))),
c_0_8 ).
cnf(c_0_11,plain,
( ~ is_a_theorem(X4)
| ~ is_a_theorem(equivalent(X3,X1))
| ~ is_a_theorem(equivalent(X3,X2))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,a))
| ~ is_a_theorem(equivalent(X1,equivalent(a,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f))))))) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,a))
| ~ is_a_theorem(equivalent(X1,equivalent(a,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f))))))) ),
inference(spm,[status(thm)],[c_0_12,c_0_5]) ).
cnf(c_0_14,negated_conjecture,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,a))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f))))),a)) ),
inference(spm,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_15,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,a))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f))))),a)) ),
inference(spm,[status(thm)],[c_0_14,c_0_5]) ).
cnf(c_0_16,negated_conjecture,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(X1,a))
| ~ is_a_theorem(equivalent(X2,a))
| ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f))))))) ),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,a))
| ~ is_a_theorem(equivalent(X2,a))
| ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(b,equivalent(c,e)),equivalent(b,equivalent(equivalent(c,f),equivalent(e,f))))))) ),
inference(spm,[status(thm)],[c_0_16,c_0_5]) ).
cnf(c_0_18,negated_conjecture,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,equivalent(c,e))),a))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,equivalent(equivalent(c,f),equivalent(e,f)))),a)) ),
inference(spm,[status(thm)],[c_0_17,c_0_7]) ).
cnf(c_0_19,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,equivalent(c,e))),a))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,equivalent(equivalent(c,f),equivalent(e,f)))),a)) ),
inference(spm,[status(thm)],[c_0_18,c_0_5]) ).
cnf(c_0_20,negated_conjecture,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(X1,a))
| ~ is_a_theorem(equivalent(equivalent(X2,equivalent(b,equivalent(c,e))),a))
| ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(b,equivalent(equivalent(c,f),equivalent(e,f)))))) ),
inference(spm,[status(thm)],[c_0_19,c_0_11]) ).
cnf(c_0_21,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,a))
| ~ is_a_theorem(equivalent(equivalent(X2,equivalent(b,equivalent(c,e))),a))
| ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(b,equivalent(equivalent(c,f),equivalent(e,f)))))) ),
inference(spm,[status(thm)],[c_0_20,c_0_5]) ).
cnf(c_0_22,plain,
( ~ is_a_theorem(equivalent(X1,X3))
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2))) ),
inference(spm,[status(thm)],[c_0_9,c_0_5]) ).
cnf(c_0_23,plain,
( ~ is_a_theorem(equivalent(X3,X1))
| ~ is_a_theorem(equivalent(X3,X2))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_5]) ).
cnf(c_0_24,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))),
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_25,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X2,equivalent(b,equivalent(c,e))),a))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,equivalent(equivalent(c,f),equivalent(e,f)))),a)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( ~ is_a_theorem(equivalent(equivalent(X1,X3),X4))
| is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X4)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X2,b),a))
| ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(c,e))))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,equivalent(equivalent(c,f),equivalent(e,f)))),a)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,b),a))
| ~ is_a_theorem(equivalent(equivalent(X2,b),a))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(c,f),equivalent(e,f))),equivalent(X2,equivalent(c,e)))) ),
inference(spm,[status(thm)],[c_0_27,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X2,b),a))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(e,f)),b),a))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(c,f)),equivalent(X2,equivalent(c,e)))) ),
inference(spm,[status(thm)],[c_0_28,c_0_26]) ).
cnf(c_0_30,plain,
( ~ is_a_theorem(equivalent(equivalent(X2,X4),X1))
| is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X4,X3)))) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X2,e),b),a))
| ~ is_a_theorem(equivalent(equivalent(X2,c),equivalent(X1,equivalent(c,f))))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(e,f)),b),a)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X1,e),b),a))
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,f),equivalent(e,f)),b),a)) ),
inference(spm,[status(thm)],[c_0_31,c_0_24]) ).
cnf(c_0_33,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(X2,X3))
| ~ is_a_theorem(equivalent(X2,X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_23]) ).
cnf(c_0_34,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,a))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X2,e),b),a))
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,f),equivalent(e,f)),b))) ),
inference(spm,[status(thm)],[c_0_32,c_0_23]) ).
cnf(c_0_35,plain,
( ~ is_a_theorem(X4)
| ~ is_a_theorem(equivalent(X3,X2))
| ~ is_a_theorem(equivalent(X3,X4))
| ~ is_a_theorem(equivalent(X2,X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_23]) ).
cnf(c_0_36,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,b),a))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X2,e),b),a))
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X2,f),equivalent(e,f)))) ),
inference(spm,[status(thm)],[c_0_34,c_0_22]) ).
cnf(c_0_37,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(X3,X2))
| ~ is_a_theorem(equivalent(X2,X1))
| is_a_theorem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_6]),c_0_24])]) ).
cnf(c_0_38,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(X1,e),b),a)),
inference(spm,[status(thm)],[c_0_36,c_0_24]) ).
cnf(c_0_39,plain,
( ~ is_a_theorem(X4)
| ~ is_a_theorem(equivalent(X3,X1))
| ~ is_a_theorem(equivalent(equivalent(X3,X2),X4))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_33,c_0_22]) ).
cnf(c_0_40,plain,
( ~ is_a_theorem(equivalent(X2,X4))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_24]) ).
cnf(c_0_41,negated_conjecture,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(equivalent(X1,a),X3))
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X2,e),b))) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,plain,
( ~ is_a_theorem(equivalent(X1,X4))
| is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X4,X2),X3))) ),
inference(spm,[status(thm)],[c_0_40,c_0_24]) ).
cnf(c_0_43,negated_conjecture,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X3))
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,e),b),a),X2)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_44,negated_conjecture,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,e),b),a),X2)) ),
inference(spm,[status(thm)],[c_0_43,c_0_5]) ).
cnf(c_0_45,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,e),b),X2),equivalent(a,X2))),
inference(spm,[status(thm)],[c_0_44,c_0_24]) ).
cnf(c_0_46,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(X1,e),X2),equivalent(a,equivalent(X2,b)))),
inference(spm,[status(thm)],[c_0_45,c_0_26]) ).
cnf(c_0_47,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(X1,X2),equivalent(a,equivalent(equivalent(X2,e),b)))),
inference(spm,[status(thm)],[c_0_46,c_0_26]) ).
cnf(c_0_48,plain,
( ~ is_a_theorem(equivalent(X4,X2))
| ~ is_a_theorem(equivalent(equivalent(X4,X3),X1))
| is_a_theorem(equivalent(X1,equivalent(X2,X3))) ),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_49,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,a))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,e),b)),equivalent(X3,X2))) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_50,negated_conjecture,
~ is_a_theorem(equivalent(X1,a)),
inference(spm,[status(thm)],[c_0_49,c_0_5]) ).
cnf(c_0_51,negated_conjecture,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X3))
| ~ is_a_theorem(equivalent(equivalent(X1,a),X2)) ),
inference(spm,[status(thm)],[c_0_50,c_0_39]) ).
cnf(c_0_52,negated_conjecture,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(equivalent(X1,a),X2)) ),
inference(spm,[status(thm)],[c_0_51,c_0_5]) ).
cnf(c_0_53,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(X1,X2),equivalent(a,X2))),
inference(spm,[status(thm)],[c_0_52,c_0_24]) ).
cnf(c_0_54,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(X1,X2),equivalent(a,equivalent(X2,X3)))),
inference(spm,[status(thm)],[c_0_53,c_0_26]) ).
cnf(c_0_55,plain,
( ~ is_a_theorem(equivalent(X2,X1))
| is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(X3,X4),equivalent(equivalent(X3,X5),equivalent(X4,X5)))))) ),
inference(spm,[status(thm)],[c_0_23,c_0_5]) ).
cnf(c_0_56,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(X2,X3)))),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_56,c_0_5]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL122-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n013.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 00:05:36 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.45 Running first-order theorem proving
% 0.15/0.45 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
% 1.47/0.76 % Version: 3.5.1
% 1.47/0.76 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.47/0.76 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.47/0.76 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.47/0.76 % Starting new_bool_3 with 300s (1) cores
% 1.47/0.76 % Starting new_bool_1 with 300s (1) cores
% 1.47/0.76 % Starting sh5l with 300s (1) cores
% 1.47/0.76 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3740939 completed with status 0
% 1.47/0.76 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.47/0.76 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.47/0.76 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.47/0.76 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.47/0.76 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.47/0.76 % No SInE strategy applied
% 1.47/0.76 % Search class: FHUNF-FFSF22-DFFFFFNN
% 1.47/0.76 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.47/0.76 % Starting SubtermCWHack with 136s (1) cores
% 1.47/0.76 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.47/0.76 % Starting G-E--_208_C41_F1_AE_CS_SP_PS_S00 with 136s (1) cores
% 1.47/0.76 % Starting new_bool_3 with 136s (1) cores
% 1.47/0.76 % Starting new_bool_1 with 136s (1) cores
% 1.47/0.76 % G-E--_208_C41_F1_AE_CS_SP_PS_S00 with pid 3740945 completed with status 0
% 1.47/0.76 % Result found by G-E--_208_C41_F1_AE_CS_SP_PS_S00
% 1.47/0.76 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.47/0.76 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.47/0.76 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.47/0.76 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.47/0.76 % No SInE strategy applied
% 1.47/0.76 % Search class: FHUNF-FFSF22-DFFFFFNN
% 1.47/0.76 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.47/0.76 % Starting SubtermCWHack with 136s (1) cores
% 1.47/0.76 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.47/0.76 % Starting G-E--_208_C41_F1_AE_CS_SP_PS_S00 with 136s (1) cores
% 1.47/0.76 % Preprocessing time : 0.002 s
% 1.47/0.76 % Presaturation interreduction done
% 1.47/0.76
% 1.47/0.76 % Proof found!
% 1.47/0.76 % SZS status Unsatisfiable
% 1.47/0.76 % SZS output start CNFRefutation
% See solution above
% 1.47/0.76 % Parsed axioms : 3
% 1.47/0.76 % Removed by relevancy pruning/SinE : 0
% 1.47/0.76 % Initial clauses : 3
% 1.47/0.76 % Removed in clause preprocessing : 0
% 1.47/0.76 % Initial clauses in saturation : 3
% 1.47/0.76 % Processed clauses : 497
% 1.47/0.76 % ...of these trivial : 0
% 1.47/0.76 % ...subsumed : 250
% 1.47/0.76 % ...remaining for further processing : 247
% 1.47/0.76 % Other redundant clauses eliminated : 0
% 1.47/0.76 % Clauses deleted for lack of memory : 0
% 1.47/0.76 % Backward-subsumed : 196
% 1.47/0.76 % Backward-rewritten : 0
% 1.47/0.76 % Generated clauses : 4430
% 1.47/0.76 % ...of the previous two non-redundant : 4387
% 1.47/0.76 % ...aggressively subsumed : 0
% 1.47/0.76 % Contextual simplify-reflections : 0
% 1.47/0.76 % Paramodulations : 4430
% 1.47/0.76 % Factorizations : 0
% 1.47/0.76 % NegExts : 0
% 1.47/0.76 % Equation resolutions : 0
% 1.47/0.76 % Disequality decompositions : 0
% 1.47/0.76 % Total rewrite steps : 125
% 1.47/0.76 % ...of those cached : 120
% 1.47/0.76 % Propositional unsat checks : 0
% 1.47/0.76 % Propositional check models : 0
% 1.47/0.76 % Propositional check unsatisfiable : 0
% 1.47/0.76 % Propositional clauses : 0
% 1.47/0.76 % Propositional clauses after purity: 0
% 1.47/0.76 % Propositional unsat core size : 0
% 1.47/0.76 % Propositional preprocessing time : 0.000
% 1.47/0.76 % Propositional encoding time : 0.000
% 1.47/0.76 % Propositional solver time : 0.000
% 1.47/0.76 % Success case prop preproc time : 0.000
% 1.47/0.76 % Success case prop encoding time : 0.000
% 1.47/0.76 % Success case prop solver time : 0.000
% 1.47/0.76 % Current number of processed clauses : 48
% 1.47/0.76 % Positive orientable unit clauses : 2
% 1.47/0.76 % Positive unorientable unit clauses: 0
% 1.47/0.76 % Negative unit clauses : 6
% 1.47/0.76 % Non-unit-clauses : 40
% 1.47/0.76 % Current number of unprocessed clauses: 3732
% 1.47/0.76 % ...number of literals in the above : 14945
% 1.47/0.76 % Current number of archived formulas : 0
% 1.47/0.76 % Current number of archived clauses : 199
% 1.47/0.76 % Clause-clause subsumption calls (NU) : 15860
% 1.47/0.76 % Rec. Clause-clause subsumption calls : 5142
% 1.47/0.76 % Non-unit clause-clause subsumptions : 240
% 1.47/0.76 % Unit Clause-clause subsumption calls : 950
% 1.47/0.76 % Rewrite failures with RHS unbound : 0
% 1.47/0.76 % BW rewrite match attempts : 4
% 1.47/0.76 % BW rewrite match successes : 1
% 1.47/0.76 % Condensation attempts : 0
% 1.47/0.76 % Condensation successes : 0
% 1.47/0.76 % Termbank termtop insertions : 98035
% 1.47/0.76 % Search garbage collected termcells : 8
% 1.47/0.76
% 1.47/0.76 % -------------------------------------------------
% 1.47/0.76 % User time : 0.184 s
% 1.47/0.76 % System time : 0.010 s
% 1.47/0.76 % Total time : 0.194 s
% 1.47/0.76 % Maximum resident set size: 3636 pages
% 1.47/0.76
% 1.47/0.76 % -------------------------------------------------
% 1.47/0.76 % User time : 1.068 s
% 1.47/0.76 % System time : 0.083 s
% 1.47/0.76 % Total time : 1.151 s
% 1.47/0.76 % Maximum resident set size: 4608 pages
% 1.47/0.76 % E exiting
%------------------------------------------------------------------------------