%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT005-5 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:00 PM UTC 2026
% Result : Unsatisfiable 11.31s 2.57s
% Output : CNFRefutation 11.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 23
% Syntax : Number of clauses : 108 ( 61 unt; 0 nHn; 95 RR)
% Number of literals : 195 ( 19 equ; 90 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-2 aty)
% Number of variables : 190 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(commutativity_of_meet,axiom,
( ~ meet(X1,X2,X3)
| meet(X2,X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT002-0.ax',commutativity_of_meet) ).
cnf(associativity_of_join2,axiom,
( ~ join(X3,X4,X6)
| ~ join(X2,X4,X5)
| ~ join(X1,X2,X3)
| join(X1,X5,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT002-0.ax',associativity_of_join2) ).
cnf(absorbtion1,axiom,
( ~ meet(X1,X2,X3)
| join(X1,X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT002-0.ax',absorbtion1) ).
cnf(meet_r2_and_a,negated_conjecture,
meet(r2,a,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meet_r2_and_a) ).
cnf(join_a_and_b,negated_conjecture,
join(a,b,c2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',join_a_and_b) ).
cnf(commutativity_of_join,axiom,
( ~ join(X1,X2,X3)
| join(X2,X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT002-0.ax',commutativity_of_join) ).
cnf(modularity1,axiom,
( ~ meet(X2,X4,X6)
| ~ meet(X3,X2,X5)
| ~ join(X1,X3,X4)
| ~ meet(X1,X2,X1)
| join(X1,X5,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT002-0.ax',modularity1) ).
cnf(join_r1_and_d,negated_conjecture,
join(r1,d,b2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',join_r1_and_d) ).
cnf(absorbtion2,axiom,
( ~ join(X1,X2,X3)
| meet(X1,X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT002-0.ax',absorbtion2) ).
cnf(meet_r2_and_b,negated_conjecture,
meet(r2,b,e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meet_r2_and_b) ).
cnf(meet_c2_and_r1,negated_conjecture,
meet(c2,r1,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meet_c2_and_r1) ).
cnf(join_total_function_2,axiom,
( ~ join(X1,X2,X4)
| ~ join(X1,X2,X3)
| X3 = X4 ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT002-0.ax',join_total_function_2) ).
cnf(join_0_and_x,axiom,
join(n0,X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT002-0.ax',join_0_and_x) ).
cnf(associativity_of_meet1,axiom,
( ~ meet(X1,X5,X6)
| ~ meet(X2,X4,X5)
| ~ meet(X1,X2,X3)
| meet(X3,X4,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT002-0.ax',associativity_of_meet1) ).
cnf(meet_total_function_2,axiom,
( ~ meet(X1,X2,X4)
| ~ meet(X1,X2,X3)
| X3 = X4 ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT002-0.ax',meet_total_function_2) ).
cnf(meet_a_and_b,negated_conjecture,
meet(a,b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meet_a_and_b) ).
cnf(meet_c_and_r2,negated_conjecture,
meet(c,r2,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meet_c_and_r2) ).
cnf(associativity_of_meet2,axiom,
( ~ meet(X3,X4,X6)
| ~ meet(X2,X4,X5)
| ~ meet(X1,X2,X3)
| meet(X1,X5,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT002-0.ax',associativity_of_meet2) ).
cnf(join_total_function_1,axiom,
join(X1,X2,join_of(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT002-0.ax',join_total_function_1) ).
cnf(meet_total_function_1,axiom,
meet(X1,X2,meet_of(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT002-0.ax',meet_total_function_1) ).
cnf(meet_0_and_x,axiom,
meet(n0,X1,n0),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT002-0.ax',meet_0_and_x) ).
cnf(join_r1_and_e,negated_conjecture,
join(r1,e,a2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',join_r1_and_e) ).
cnf(meet_a2_and_b2,negated_conjecture,
~ meet(a2,b2,r1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meet_a2_and_b2) ).
cnf(c_0_23,plain,
( ~ meet(X1,X2,X3)
| meet(X2,X1,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_of_meet]) ).
cnf(c_0_24,plain,
( ~ join(X3,X4,X6)
| ~ join(X2,X4,X5)
| ~ join(X1,X2,X3)
| join(X1,X5,X6) ),
inference(fof_simplification,[status(thm)],[associativity_of_join2]) ).
cnf(c_0_25,plain,
( ~ meet(X1,X2,X3)
| join(X1,X3,X1) ),
inference(fof_simplification,[status(thm)],[absorbtion1]) ).
cnf(c_0_26,plain,
( ~ meet(X1,X2,X3)
| meet(X2,X1,X3) ),
c_0_23 ).
cnf(c_0_27,negated_conjecture,
meet(r2,a,d),
meet_r2_and_a ).
cnf(c_0_28,plain,
( ~ join(X3,X4,X6)
| ~ join(X2,X4,X5)
| ~ join(X1,X2,X3)
| join(X1,X5,X6) ),
c_0_24 ).
cnf(c_0_29,negated_conjecture,
join(a,b,c2),
join_a_and_b ).
cnf(c_0_30,plain,
( ~ join(X1,X2,X3)
| join(X2,X1,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_of_join]) ).
cnf(c_0_31,plain,
( ~ meet(X1,X2,X3)
| join(X1,X3,X1) ),
c_0_25 ).
cnf(c_0_32,negated_conjecture,
meet(a,r2,d),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( ~ join(X1,X3,a)
| ~ join(X3,b,X2)
| join(X1,X2,c2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
( ~ join(X1,X2,X3)
| join(X2,X1,X3) ),
c_0_30 ).
cnf(c_0_35,negated_conjecture,
join(a,d,a),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
( ~ meet(X2,X4,X6)
| ~ meet(X3,X2,X5)
| ~ join(X1,X3,X4)
| ~ meet(X1,X2,X1)
| join(X1,X5,X6) ),
inference(fof_simplification,[status(thm)],[modularity1]) ).
cnf(c_0_37,negated_conjecture,
join(r1,d,b2),
join_r1_and_d ).
cnf(c_0_38,plain,
( ~ join(X1,X2,X3)
| meet(X1,X3,X1) ),
inference(fof_simplification,[status(thm)],[absorbtion2]) ).
cnf(c_0_39,negated_conjecture,
( ~ join(X1,a,a)
| join(X1,c2,c2) ),
inference(spm,[status(thm)],[c_0_33,c_0_29]) ).
cnf(c_0_40,negated_conjecture,
join(d,a,a),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
meet(r2,b,e),
meet_r2_and_b ).
cnf(c_0_42,plain,
( ~ meet(X2,X4,X6)
| ~ meet(X3,X2,X5)
| ~ join(X1,X3,X4)
| ~ meet(X1,X2,X1)
| join(X1,X5,X6) ),
c_0_36 ).
cnf(c_0_43,negated_conjecture,
join(d,r1,b2),
inference(spm,[status(thm)],[c_0_34,c_0_37]) ).
cnf(c_0_44,negated_conjecture,
meet(c2,r1,n0),
meet_c2_and_r1 ).
cnf(c_0_45,plain,
( ~ join(X1,X2,X3)
| meet(X1,X3,X1) ),
c_0_38 ).
cnf(c_0_46,negated_conjecture,
join(d,c2,c2),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_47,plain,
( ~ join(X1,X2,X4)
| ~ join(X1,X2,X3)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[join_total_function_2]) ).
cnf(c_0_48,axiom,
join(n0,X1,X1),
join_0_and_x ).
cnf(c_0_49,plain,
( ~ meet(X1,X5,X6)
| ~ meet(X2,X4,X5)
| ~ meet(X1,X2,X3)
| meet(X3,X4,X6) ),
inference(fof_simplification,[status(thm)],[associativity_of_meet1]) ).
cnf(c_0_50,plain,
( ~ meet(X1,X2,X4)
| ~ meet(X1,X2,X3)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[meet_total_function_2]) ).
cnf(c_0_51,negated_conjecture,
meet(b,r2,e),
inference(spm,[status(thm)],[c_0_26,c_0_41]) ).
cnf(c_0_52,negated_conjecture,
( ~ meet(X3,b2,X2)
| ~ meet(r1,X3,X1)
| ~ meet(d,X3,d)
| join(d,X1,X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_53,negated_conjecture,
meet(r1,c2,n0),
inference(spm,[status(thm)],[c_0_26,c_0_44]) ).
cnf(c_0_54,negated_conjecture,
meet(d,c2,d),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_55,plain,
( ~ join(X1,X2,X4)
| ~ join(X1,X2,X3)
| X3 = X4 ),
c_0_47 ).
cnf(c_0_56,plain,
join(X1,n0,X1),
inference(spm,[status(thm)],[c_0_34,c_0_48]) ).
cnf(c_0_57,plain,
( ~ meet(X1,X5,X6)
| ~ meet(X2,X4,X5)
| ~ meet(X1,X2,X3)
| meet(X3,X4,X6) ),
c_0_49 ).
cnf(c_0_58,negated_conjecture,
meet(a,b,c),
meet_a_and_b ).
cnf(c_0_59,negated_conjecture,
meet(c,r2,n0),
meet_c_and_r2 ).
cnf(c_0_60,plain,
( ~ meet(X1,X2,X4)
| ~ meet(X1,X2,X3)
| X3 = X4 ),
c_0_50 ).
cnf(c_0_61,negated_conjecture,
join(b,e,b),
inference(spm,[status(thm)],[c_0_31,c_0_51]) ).
cnf(c_0_62,plain,
( ~ meet(X3,X4,X6)
| ~ meet(X2,X4,X5)
| ~ meet(X1,X2,X3)
| meet(X1,X5,X6) ),
inference(fof_simplification,[status(thm)],[associativity_of_meet2]) ).
cnf(c_0_63,negated_conjecture,
join(b,a,c2),
inference(spm,[status(thm)],[c_0_34,c_0_29]) ).
cnf(c_0_64,axiom,
join(X1,X2,join_of(X1,X2)),
join_total_function_1 ).
cnf(c_0_65,negated_conjecture,
( ~ meet(c2,b2,X1)
| join(d,n0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]) ).
cnf(c_0_66,axiom,
meet(X1,X2,meet_of(X1,X2)),
meet_total_function_1 ).
cnf(c_0_67,plain,
( ~ join(X2,n0,X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_68,negated_conjecture,
( ~ meet(X3,a,X1)
| ~ meet(X3,c,X2)
| meet(X1,b,X2) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_69,negated_conjecture,
meet(r2,c,n0),
inference(spm,[status(thm)],[c_0_26,c_0_59]) ).
cnf(c_0_70,negated_conjecture,
( ~ meet(r2,a,X1)
| X1 = d ),
inference(spm,[status(thm)],[c_0_60,c_0_27]) ).
cnf(c_0_71,negated_conjecture,
join(e,b,b),
inference(spm,[status(thm)],[c_0_34,c_0_61]) ).
cnf(c_0_72,plain,
( ~ meet(X3,X4,X6)
| ~ meet(X2,X4,X5)
| ~ meet(X1,X2,X3)
| meet(X1,X5,X6) ),
c_0_62 ).
cnf(c_0_73,negated_conjecture,
meet(b,c2,b),
inference(spm,[status(thm)],[c_0_45,c_0_63]) ).
cnf(c_0_74,plain,
( ~ join(X2,X3,X1)
| X1 = join_of(X2,X3) ),
inference(spm,[status(thm)],[c_0_55,c_0_64]) ).
cnf(c_0_75,negated_conjecture,
join(d,n0,meet_of(c2,b2)),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_76,plain,
join_of(X1,n0) = X1,
inference(spm,[status(thm)],[c_0_67,c_0_64]) ).
cnf(c_0_77,plain,
meet(X1,X2,meet_of(X2,X1)),
inference(spm,[status(thm)],[c_0_26,c_0_66]) ).
cnf(c_0_78,negated_conjecture,
( ~ meet(r2,a,X1)
| meet(X1,b,n0) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_79,negated_conjecture,
meet_of(r2,a) = d,
inference(spm,[status(thm)],[c_0_70,c_0_66]) ).
cnf(c_0_80,negated_conjecture,
meet(e,b,e),
inference(spm,[status(thm)],[c_0_45,c_0_71]) ).
cnf(c_0_81,plain,
( ~ meet(X1,X5,X3)
| ~ meet(X5,X4,X2)
| meet(X1,X2,meet_of(X3,X4)) ),
inference(spm,[status(thm)],[c_0_72,c_0_66]) ).
cnf(c_0_82,negated_conjecture,
meet(c2,b,b),
inference(spm,[status(thm)],[c_0_26,c_0_73]) ).
cnf(c_0_83,negated_conjecture,
meet_of(c2,b2) = d,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]) ).
cnf(c_0_84,plain,
( ~ meet(X2,X3,X1)
| X1 = meet_of(X2,X3) ),
inference(spm,[status(thm)],[c_0_60,c_0_66]) ).
cnf(c_0_85,plain,
( ~ meet(X3,X2,X1)
| X1 = meet_of(X2,X3) ),
inference(spm,[status(thm)],[c_0_60,c_0_77]) ).
cnf(c_0_86,negated_conjecture,
meet(d,b,n0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_66]),c_0_79]) ).
cnf(c_0_87,axiom,
meet(n0,X1,n0),
meet_0_and_x ).
cnf(c_0_88,negated_conjecture,
meet(b,e,e),
inference(spm,[status(thm)],[c_0_26,c_0_80]) ).
cnf(c_0_89,negated_conjecture,
( ~ meet(X1,c2,X2)
| meet(X1,b,meet_of(X2,b)) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_90,negated_conjecture,
meet(b2,c2,d),
inference(spm,[status(thm)],[c_0_77,c_0_83]) ).
cnf(c_0_91,plain,
meet_of(X1,X2) = meet_of(X2,X1),
inference(spm,[status(thm)],[c_0_84,c_0_77]) ).
cnf(c_0_92,negated_conjecture,
meet_of(b,d) = n0,
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_93,plain,
( ~ meet(n0,X2,X1)
| X1 = n0 ),
inference(spm,[status(thm)],[c_0_60,c_0_87]) ).
cnf(c_0_94,negated_conjecture,
( ~ meet(X1,b,X2)
| meet(X1,e,meet_of(X2,e)) ),
inference(spm,[status(thm)],[c_0_81,c_0_88]) ).
cnf(c_0_95,negated_conjecture,
meet(b2,b,n0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_91]),c_0_92]) ).
cnf(c_0_96,plain,
meet_of(n0,X1) = n0,
inference(spm,[status(thm)],[c_0_93,c_0_66]) ).
cnf(c_0_97,negated_conjecture,
join(r1,e,a2),
join_r1_and_e ).
cnf(c_0_98,negated_conjecture,
meet(b2,e,n0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_96]) ).
cnf(c_0_99,negated_conjecture,
( ~ meet(X3,a2,X2)
| ~ meet(e,X3,X1)
| ~ meet(r1,X3,r1)
| join(r1,X1,X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_97]) ).
cnf(c_0_100,negated_conjecture,
meet(e,b2,n0),
inference(spm,[status(thm)],[c_0_26,c_0_98]) ).
cnf(c_0_101,negated_conjecture,
meet(r1,b2,r1),
inference(spm,[status(thm)],[c_0_45,c_0_37]) ).
cnf(c_0_102,negated_conjecture,
( ~ meet(b2,a2,X1)
| join(r1,n0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_101])]) ).
cnf(c_0_103,negated_conjecture,
join(r1,n0,meet_of(a2,b2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_66]),c_0_91]) ).
cnf(c_0_104,negated_conjecture,
~ meet(a2,b2,r1),
inference(fof_simplification,[status(thm)],[meet_a2_and_b2]) ).
cnf(c_0_105,negated_conjecture,
meet_of(a2,b2) = r1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_103]),c_0_76]) ).
cnf(c_0_106,negated_conjecture,
~ meet(a2,b2,r1),
c_0_104 ).
cnf(c_0_107,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_105]),c_0_106]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LAT005-5 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.45 % Computer : n009.cluster.edu
% 0.21/0.45 % Model : x86_64 x86_64
% 0.21/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.45 % Memory : 8046.5625MB
% 0.21/0.45 % OS : Linux 6.8.0-71-generic
% 0.21/0.45 % CPULimit : 300
% 0.21/0.45 % WCLimit : 300
% 0.21/0.45 % DateTime : Sun Sep 20 23:04:59 UTC 2026
% 0.21/0.46 % CPUTime :
% 0.21/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.51 Running first-order theorem proving
% 0.25/0.52 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
% 11.31/2.57 % Version: 3.5.1
% 11.31/2.57 % Preprocessing class: FSMSSMSMSSSNFFN.
% 11.31/2.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.31/2.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 11.31/2.57 % Starting new_bool_3 with 300s (1) cores
% 11.31/2.57 % Starting new_bool_1 with 300s (1) cores
% 11.31/2.57 % Starting sh5l with 300s (1) cores
% 11.31/2.57 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 246832 completed with status 0
% 11.31/2.57 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 11.31/2.57 % Preprocessing class: FSMSSMSMSSSNFFN.
% 11.31/2.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.31/2.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 11.31/2.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.31/2.57 % No SInE strategy applied
% 11.31/2.57 % Search class: FHUSM-FFMM22-SFFFFFNN
% 11.31/2.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 11.31/2.57 % Starting SubtermCWHack with 136s (1) cores
% 11.31/2.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 11.31/2.57 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 11.31/2.57 % Starting new_bool_3 with 136s (1) cores
% 11.31/2.57 % Starting new_bool_1 with 136s (1) cores
% 11.31/2.57 % new_bool_3 with pid 246839 completed with status 0
% 11.31/2.57 % Result found by new_bool_3
% 11.31/2.57 % Preprocessing class: FSMSSMSMSSSNFFN.
% 11.31/2.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.31/2.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 11.31/2.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.31/2.57 % No SInE strategy applied
% 11.31/2.57 % Search class: FHUSM-FFMM22-SFFFFFNN
% 11.31/2.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 11.31/2.57 % Starting SubtermCWHack with 136s (1) cores
% 11.31/2.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 11.31/2.57 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 11.31/2.57 % Starting new_bool_3 with 136s (1) cores
% 11.31/2.57 % Preprocessing time : 0.002 s
% 11.31/2.57 % Presaturation interreduction done
% 11.31/2.57
% 11.31/2.57 % Proof found!
% 11.31/2.57 % SZS status Unsatisfiable
% 11.31/2.57 % SZS output start CNFRefutation
% See solution above
% 11.31/2.57 % Parsed axioms : 31
% 11.31/2.57 % Removed by relevancy pruning/SinE : 0
% 11.31/2.57 % Initial clauses : 31
% 11.31/2.57 % Removed in clause preprocessing : 0
% 11.31/2.57 % Initial clauses in saturation : 31
% 11.31/2.57 % Processed clauses : 11678
% 11.31/2.57 % ...of these trivial : 1060
% 11.31/2.57 % ...subsumed : 5289
% 11.31/2.57 % ...remaining for further processing : 5329
% 11.31/2.57 % Other redundant clauses eliminated : 0
% 11.31/2.57 % Clauses deleted for lack of memory : 0
% 11.31/2.57 % Backward-subsumed : 68
% 11.31/2.57 % Backward-rewritten : 214
% 11.31/2.57 % Generated clauses : 56589
% 11.31/2.57 % ...of the previous two non-redundant : 34643
% 11.31/2.57 % ...aggressively subsumed : 0
% 11.31/2.57 % Contextual simplify-reflections : 0
% 11.31/2.57 % Paramodulations : 56589
% 11.31/2.57 % Factorizations : 0
% 11.31/2.57 % NegExts : 0
% 11.31/2.57 % Equation resolutions : 0
% 11.31/2.57 % Disequality decompositions : 0
% 11.31/2.57 % Total rewrite steps : 38387
% 11.31/2.57 % ...of those cached : 36350
% 11.31/2.57 % Propositional unsat checks : 1
% 11.31/2.57 % Propositional check models : 1
% 11.31/2.57 % Propositional check unsatisfiable : 0
% 11.31/2.57 % Propositional clauses : 0
% 11.31/2.57 % Propositional clauses after purity: 0
% 11.31/2.57 % Propositional unsat core size : 0
% 11.31/2.57 % Propositional preprocessing time : 0.000
% 11.31/2.57 % Propositional encoding time : 0.052
% 11.31/2.57 % Propositional solver time : 0.064
% 11.31/2.57 % Success case prop preproc time : 0.000
% 11.31/2.57 % Success case prop encoding time : 0.000
% 11.31/2.57 % Success case prop solver time : 0.000
% 11.31/2.57 % Current number of processed clauses : 5016
% 11.31/2.57 % Positive orientable unit clauses : 636
% 11.31/2.57 % Positive unorientable unit clauses: 2
% 11.31/2.57 % Negative unit clauses : 1
% 11.31/2.57 % Non-unit-clauses : 4377
% 11.31/2.57 % Current number of unprocessed clauses: 22665
% 11.31/2.57 % ...number of literals in the above : 48943
% 11.31/2.57 % Current number of archived formulas : 0
% 11.31/2.57 % Current number of archived clauses : 313
% 11.31/2.57 % Clause-clause subsumption calls (NU) : 1190680
% 11.31/2.57 % Rec. Clause-clause subsumption calls : 1016986
% 11.31/2.57 % Non-unit clause-clause subsumptions : 5355
% 11.31/2.57 % Unit Clause-clause subsumption calls : 22760
% 11.31/2.57 % Rewrite failures with RHS unbound : 0
% 11.31/2.57 % BW rewrite match attempts : 783
% 11.31/2.57 % BW rewrite match successes : 568
% 11.31/2.57 % Condensation attempts : 0
% 11.31/2.57 % Condensation successes : 0
% 11.31/2.57 % Termbank termtop insertions : 680331
% 11.31/2.57 % Search garbage collected termcells : 53
% 11.31/2.57
% 11.31/2.57 % -------------------------------------------------
% 11.31/2.57 % User time : 1.879 s
% 11.31/2.57 % System time : 0.058 s
% 11.31/2.57 % Total time : 1.937 s
% 11.31/2.57 % Maximum resident set size: 3652 pages
% 11.31/2.57
% 11.31/2.57 % -------------------------------------------------
% 11.31/2.57 % User time : 7.753 s
% 11.31/2.57 % System time : 0.225 s
% 11.31/2.57 % Total time : 7.978 s
% 11.31/2.57 % Maximum resident set size: 4864 pages
% 11.31/2.57 % E exiting
%------------------------------------------------------------------------------