%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT247-1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:04:32 PM UTC 2026
% Result : Unsatisfiable 273.40s 41.22s
% Output : CNFRefutation 273.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 14
% Syntax : Number of clauses : 100 ( 95 unt; 0 nHn; 24 RR)
% Number of literals : 109 ( 108 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 142 ( 24 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_distributivity_hypothesis,hypothesis,
meet(b,a) = a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_distributivity_hypothesis) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption1) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-4.ax',complement_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption2) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',idempotence_of_meet) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',idempotence_of_join) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-4.ax',complement_meet) ).
cnf(equation_H61,axiom,
meet(join(X1,X2),join(X1,X3)) = join(X1,meet(join(X1,X2),join(meet(X1,X2),X3))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equation_H61) ).
cnf(meet_join_complement,axiom,
( join(X1,X2) != one
| meet(X1,X2) != zero
| complement(X1) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-4.ax',meet_join_complement) ).
cnf(prove_distributivity,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_distributivity) ).
cnf(c_0_14,hypothesis,
meet(b,a) = a,
prove_distributivity_hypothesis ).
cnf(c_0_15,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_16,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_17,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_19,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_20,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_21,hypothesis,
meet(a,meet(b,X1)) = meet(a,X1),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_24,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_25,hypothesis,
meet(a,meet(X1,b)) = meet(a,X1),
inference(spm,[status(thm)],[c_0_21,c_0_15]) ).
cnf(c_0_26,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_27,plain,
meet(one,X1) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_15]) ).
cnf(c_0_28,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_29,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_30,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_31,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_16,c_0_23]) ).
cnf(c_0_32,hypothesis,
join(meet(X1,b),meet(a,X1)) = meet(X1,b),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_33,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_26]) ).
cnf(c_0_34,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_18,c_0_27]) ).
cnf(c_0_35,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,hypothesis,
meet(a,complement(b)) = meet(a,zero),
inference(spm,[status(thm)],[c_0_21,c_0_30]) ).
cnf(c_0_37,plain,
meet(X1,zero) = zero,
inference(spm,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_38,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_30]) ).
cnf(c_0_39,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_16,c_0_18]) ).
cnf(c_0_40,plain,
join(X1,join(X2,meet(X3,join(X1,X2)))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_24,c_0_28]) ).
cnf(c_0_41,hypothesis,
join(a,meet(b,join(X1,a))) = meet(b,join(X1,a)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_15]),c_0_26]),c_0_15]) ).
cnf(c_0_42,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_18]),c_0_28]) ).
cnf(c_0_43,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_19]),c_0_34]) ).
cnf(c_0_44,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_35,c_0_19]) ).
cnf(c_0_45,hypothesis,
join(meet(b,X1),meet(a,X1)) = meet(b,X1),
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_46,axiom,
meet(join(X1,X2),join(X1,X3)) = join(X1,meet(join(X1,X2),join(meet(X1,X2),X3))),
equation_H61 ).
cnf(c_0_47,hypothesis,
meet(a,complement(b)) = zero,
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_48,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_38,c_0_26]) ).
cnf(c_0_49,plain,
meet(X1,complement(join(X1,X2))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_30]),c_0_37]) ).
cnf(c_0_50,hypothesis,
join(X1,meet(b,join(X1,a))) = join(X1,a),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_51,plain,
( join(X1,X2) != one
| meet(X1,X2) != zero
| complement(X1) = X2 ),
inference(fof_simplification,[status(thm)],[meet_join_complement]) ).
cnf(c_0_52,plain,
join(complement(X1),join(X2,X1)) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_28]) ).
cnf(c_0_53,hypothesis,
join(meet(b,X1),meet(X1,a)) = meet(b,X1),
inference(spm,[status(thm)],[c_0_45,c_0_15]) ).
cnf(c_0_54,plain,
meet(X1,meet(join(X2,X1),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_16,c_0_33]) ).
cnf(c_0_55,hypothesis,
meet(join(a,complement(b)),join(a,X1)) = join(a,meet(join(a,complement(b)),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_56,plain,
meet(X1,complement(meet(join(X1,X2),join(X1,X3)))) = zero,
inference(spm,[status(thm)],[c_0_49,c_0_46]) ).
cnf(c_0_57,hypothesis,
join(X1,meet(b,join(a,X1))) = join(a,X1),
inference(spm,[status(thm)],[c_0_50,c_0_26]) ).
cnf(c_0_58,plain,
join(X1,join(X2,meet(join(X1,X2),X3))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_28]) ).
cnf(c_0_59,plain,
join(X1,meet(join(X2,X1),join(meet(X1,X2),X3))) = meet(join(X2,X1),join(X1,X3)),
inference(spm,[status(thm)],[c_0_46,c_0_26]) ).
cnf(c_0_60,plain,
( join(X1,X2) != one
| meet(X1,X2) != zero
| complement(X1) = X2 ),
c_0_51 ).
cnf(c_0_61,hypothesis,
join(meet(b,X1),complement(meet(X1,a))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_26]) ).
cnf(c_0_62,hypothesis,
meet(complement(b),join(a,meet(join(a,complement(b)),X1))) = meet(complement(b),join(a,X1)),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_63,hypothesis,
meet(X1,complement(meet(join(X1,X2),join(a,X1)))) = zero,
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_64,hypothesis,
meet(join(a,X1),join(a,complement(b))) = join(a,meet(join(a,complement(b)),X1)),
inference(spm,[status(thm)],[c_0_15,c_0_55]) ).
cnf(c_0_65,plain,
join(X1,meet(join(X1,X2),join(X2,X3))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_66,plain,
( join(X1,X2) != one
| meet(X2,X1) != zero
| complement(X1) = X2 ),
inference(spm,[status(thm)],[c_0_60,c_0_15]) ).
cnf(c_0_67,hypothesis,
join(meet(b,X1),join(meet(b,meet(X1,complement(meet(X1,a)))),X2)) = join(meet(b,X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_61]),c_0_16]),c_0_27]),c_0_27]) ).
cnf(c_0_68,hypothesis,
meet(complement(b),join(a,complement(join(a,complement(b))))) = zero,
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_38]),c_0_15]),c_0_36]),c_0_37]),c_0_28]),c_0_35]),c_0_64]),c_0_65]) ).
cnf(c_0_69,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_30]),c_0_26]),c_0_19])]) ).
cnf(c_0_70,plain,
join(X1,join(X2,complement(join(X2,X1)))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_42]),c_0_26]),c_0_28]) ).
cnf(c_0_71,hypothesis,
join(meet(b,X1),complement(meet(b,meet(X1,complement(meet(X1,a)))))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_19]),c_0_44]) ).
cnf(c_0_72,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_31,c_0_15]) ).
cnf(c_0_73,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X3,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_74,hypothesis,
join(a,complement(join(a,complement(b)))) = b,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_68]),c_0_69]),c_0_70])]) ).
cnf(c_0_75,hypothesis,
join(meet(b,X1),complement(meet(b,meet(X1,complement(meet(a,X1)))))) = one,
inference(spm,[status(thm)],[c_0_71,c_0_15]) ).
cnf(c_0_76,plain,
meet(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_15,c_0_37]) ).
cnf(c_0_77,plain,
meet(X1,meet(X2,join(X1,X3))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_39]),c_0_16]),c_0_72]),c_0_73]) ).
cnf(c_0_78,hypothesis,
meet(b,join(a,X1)) = join(a,meet(b,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_74]),c_0_49]),c_0_48]) ).
cnf(c_0_79,hypothesis,
join(b,a) = b,
inference(spm,[status(thm)],[c_0_24,c_0_17]) ).
cnf(c_0_80,hypothesis,
join(meet(X1,b),complement(meet(b,meet(X1,complement(meet(a,X1)))))) = one,
inference(spm,[status(thm)],[c_0_75,c_0_15]) ).
cnf(c_0_81,plain,
meet(X1,meet(complement(X1),X2)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_30]),c_0_76]) ).
cnf(c_0_82,plain,
complement(zero) = one,
inference(spm,[status(thm)],[c_0_19,c_0_48]) ).
cnf(c_0_83,plain,
meet(X1,meet(X2,X3)) = meet(X3,meet(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_77]),c_0_16]),c_0_73]),c_0_39]) ).
cnf(c_0_84,hypothesis,
meet(join(a,meet(b,X1)),X2) = meet(b,meet(join(a,X1),X2)),
inference(spm,[status(thm)],[c_0_16,c_0_78]) ).
cnf(c_0_85,hypothesis,
join(a,b) = b,
inference(rw,[status(thm)],[c_0_79,c_0_26]) ).
cnf(c_0_86,plain,
meet(X1,meet(X2,complement(meet(X1,X2)))) = zero,
inference(spm,[status(thm)],[c_0_30,c_0_16]) ).
cnf(c_0_87,hypothesis,
join(meet(b,meet(X1,complement(a))),complement(meet(b,meet(complement(a),X1)))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_16]),c_0_82]),c_0_22]),c_0_83]) ).
cnf(c_0_88,hypothesis,
meet(b,meet(join(a,complement(b)),X1)) = meet(a,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_63]),c_0_38]),c_0_85]),c_0_15]),c_0_18]) ).
cnf(c_0_89,hypothesis,
join(b,join(a,X1)) = join(b,X1),
inference(spm,[status(thm)],[c_0_28,c_0_79]) ).
cnf(c_0_90,hypothesis,
join(a,meet(complement(a),join(a,complement(b)))) = join(a,complement(b)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_19]),c_0_22]),c_0_15]) ).
cnf(c_0_91,plain,
join(X1,join(X2,complement(X1))) = one,
inference(spm,[status(thm)],[c_0_43,c_0_26]) ).
cnf(c_0_92,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
inference(fof_simplification,[status(thm)],[prove_distributivity]) ).
cnf(c_0_93,plain,
( join(X2,meet(X1,complement(meet(X2,X1)))) != one
| meet(X1,complement(meet(X2,X1))) = complement(X2) ),
inference(spm,[status(thm)],[c_0_60,c_0_86]) ).
cnf(c_0_94,hypothesis,
complement(meet(b,meet(complement(a),join(a,complement(b))))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_30]),c_0_48]) ).
cnf(c_0_95,hypothesis,
join(b,meet(complement(a),join(a,complement(b)))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_91]) ).
cnf(c_0_96,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
c_0_92 ).
cnf(c_0_97,hypothesis,
meet(complement(a),join(a,complement(b))) = complement(b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_22]),c_0_22]),c_0_95])]) ).
cnf(c_0_98,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_96,c_0_26]) ).
cnf(c_0_99,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_97]),c_0_98]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LAT247-1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.41 % Computer : n011.cluster.edu
% 0.14/5.41 % Model : x86_64 x86_64
% 0.14/5.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/5.41 % Memory : 8046.5625MB
% 0.14/5.41 % OS : Linux 6.8.0-71-generic
% 0.14/5.41 % CPULimit : 300
% 0.14/5.41 % WCLimit : 300
% 0.14/5.41 % DateTime : Sun Sep 20 23:22:46 UTC 2026
% 0.14/5.41 % CPUTime :
% 0.14/5.41 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.46 Running first-order theorem proving
% 0.14/5.46 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
% 273.40/41.22 % Version: 3.5.1
% 273.40/41.22 % Preprocessing class: FSSSSMSSSSSNFFN.
% 273.40/41.22 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 273.40/41.22 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 273.40/41.22 % Starting new_bool_3 with 300s (1) cores
% 273.40/41.22 % Starting new_bool_1 with 300s (1) cores
% 273.40/41.22 % Starting sh5l with 300s (1) cores
% 273.40/41.22 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 407891 completed with status 0
% 273.40/41.22 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 273.40/41.22 % Preprocessing class: FSSSSMSSSSSNFFN.
% 273.40/41.22 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 273.40/41.22 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 273.40/41.22 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 273.40/41.22 % No SInE strategy applied
% 273.40/41.22 % Search class: FHUPM-FFSF21-MFFFFFNN
% 273.40/41.22 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 273.40/41.22 % Starting SubtermCWHack with 136s (1) cores
% 273.40/41.22 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 273.40/41.22 % Starting G-E--_303_C18_F1_URBAN_S0Y with 136s (1) cores
% 273.40/41.22 % Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 273.40/41.22 % Starting new_bool_3 with 136s (1) cores
% 273.40/41.22 % G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with pid 407898 completed with status 0
% 273.40/41.22 % Result found by G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S
% 273.40/41.22 % Preprocessing class: FSSSSMSSSSSNFFN.
% 273.40/41.22 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 273.40/41.22 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 273.40/41.22 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 273.40/41.22 % No SInE strategy applied
% 273.40/41.22 % Search class: FHUPM-FFSF21-MFFFFFNN
% 273.40/41.22 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 273.40/41.22 % Starting SubtermCWHack with 136s (1) cores
% 273.40/41.22 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 273.40/41.22 % Starting G-E--_303_C18_F1_URBAN_S0Y with 136s (1) cores
% 273.40/41.22 % Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 273.40/41.22 % Preprocessing time : 0.001 s
% 273.40/41.22 % Presaturation interreduction done
% 273.40/41.22
% 273.40/41.22 % Proof found!
% 273.40/41.22 % SZS status Unsatisfiable
% 273.40/41.22 % SZS output start CNFRefutation
% See solution above
% 273.40/41.22 % Parsed axioms : 14
% 273.40/41.22 % Removed by relevancy pruning/SinE : 0
% 273.40/41.22 % Initial clauses : 14
% 273.40/41.22 % Removed in clause preprocessing : 0
% 273.40/41.22 % Initial clauses in saturation : 14
% 273.40/41.22 % Processed clauses : 34166
% 273.40/41.22 % ...of these trivial : 17958
% 273.40/41.22 % ...subsumed : 14357
% 273.40/41.22 % ...remaining for further processing : 1851
% 273.40/41.22 % Other redundant clauses eliminated : 0
% 273.40/41.22 % Clauses deleted for lack of memory : 0
% 273.40/41.22 % Backward-subsumed : 19
% 273.40/41.22 % Backward-rewritten : 346
% 273.40/41.22 % Generated clauses : 1270079
% 273.40/41.22 % ...of the previous two non-redundant : 578274
% 273.40/41.22 % ...aggressively subsumed : 0
% 273.40/41.22 % Contextual simplify-reflections : 0
% 273.40/41.22 % Paramodulations : 1270061
% 273.40/41.22 % Factorizations : 0
% 273.40/41.22 % NegExts : 0
% 273.40/41.22 % Equation resolutions : 18
% 273.40/41.22 % Disequality decompositions : 0
% 273.40/41.22 % Total rewrite steps : 3766056
% 273.40/41.22 % ...of those cached : 3372770
% 273.40/41.22 % Propositional unsat checks : 0
% 273.40/41.22 % Propositional check models : 0
% 273.40/41.22 % Propositional check unsatisfiable : 0
% 273.40/41.22 % Propositional clauses : 0
% 273.40/41.22 % Propositional clauses after purity: 0
% 273.40/41.22 % Propositional unsat core size : 0
% 273.40/41.22 % Propositional preprocessing time : 0.000
% 273.40/41.22 % Propositional encoding time : 0.000
% 273.40/41.22 % Propositional solver time : 0.000
% 273.40/41.22 % Success case prop preproc time : 0.000
% 273.40/41.22 % Success case prop encoding time : 0.000
% 273.40/41.22 % Success case prop solver time : 0.000
% 273.40/41.22 % Current number of processed clauses : 1472
% 273.40/41.22 % Positive orientable unit clauses : 1320
% 273.40/41.22 % Positive unorientable unit clauses: 10
% 273.40/41.22 % Negative unit clauses : 1
% 273.40/41.22 % Non-unit-clauses : 141
% 273.40/41.22 % Current number of unprocessed clauses: 542588
% 273.40/41.22 % ...number of literals in the above : 576047
% 273.40/41.22 % Current number of archived formulas : 0
% 273.40/41.22 % Current number of archived clauses : 379
% 273.40/41.22 % Clause-clause subsumption calls (NU) : 19482
% 273.40/41.22 % Rec. Clause-clause subsumption calls : 19482
% 273.40/41.22 % Non-unit clause-clause subsumptions : 7079
% 273.40/41.22 % Unit Clause-clause subsumption calls : 814
% 273.40/41.22 % Rewrite failures with RHS unbound : 0
% 273.40/41.22 % BW rewrite match attempts : 26050
% 273.40/41.22 % BW rewrite match successes : 2600
% 273.40/41.22 % Condensation attempts : 0
% 273.40/41.22 % Condensation successes : 0
% 273.40/41.22 % Termbank termtop insertions : 24820714
% 273.40/41.22 % Search garbage collected termcells : 8
% 273.40/41.22
% 273.40/41.22 % -------------------------------------------------
% 273.40/41.22 % User time : 31.459 s
% 273.40/41.22 % System time : 0.920 s
% 273.40/41.22 % Total time : 32.379 s
% 273.40/41.22 % Maximum resident set size: 3640 pages
% 273.40/41.22
% 273.40/41.22 % -------------------------------------------------
% 273.40/41.22 % User time : 168.431 s
% 273.40/41.22 % System time : 5.321 s
% 273.40/41.22 % Total time : 173.752 s
% 273.40/41.22 % Maximum resident set size: 4608 pages
% 273.40/41.22 % E exiting
%------------------------------------------------------------------------------