%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT001-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 : n007.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:03:59 PM UTC 2026
% Result : Unsatisfiable 80.22s 12.45s
% Output : CNFRefutation 80.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 17
% Syntax : Number of clauses : 96 ( 82 unt; 0 nHn; 35 RR)
% Number of literals : 114 ( 94 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 153 ( 28 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(complement_join,axiom,
( ~ complement(X1,X2)
| join(X1,X2) = n1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-2.ax',complement_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption2) ).
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(complement_of_a_meet_b,hypothesis,
complement(r2,meet(a,b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement_of_a_meet_b) ).
cnf(x_meet_1,axiom,
meet(X1,n1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-1.ax',x_meet_1) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).
cnf(modular,axiom,
( meet(X1,X2) != X1
| meet(X2,join(X1,X3)) = join(X1,meet(X3,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-1.ax',modular) ).
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(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',idempotence_of_meet) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).
cnf(complement_meet,axiom,
( ~ complement(X1,X2)
| meet(X1,X2) = n0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-2.ax',complement_meet) ).
cnf(complement_of_a_join_b,hypothesis,
complement(r1,join(a,b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement_of_a_join_b) ).
cnf(x_join_0,axiom,
join(X1,n0) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-1.ax',x_join_0) ).
cnf(meet_join_complement,axiom,
( join(X1,X2) != n1
| meet(X1,X2) != n0
| complement(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-2.ax',meet_join_complement) ).
cnf(x_meet_0,axiom,
meet(X1,n0) = n0,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-1.ax',x_meet_0) ).
cnf(prove_complememt,negated_conjecture,
~ complement(a,join(r1,meet(r2,b))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_complememt) ).
cnf(c_0_17,plain,
( ~ complement(X1,X2)
| join(X1,X2) = n1 ),
inference(fof_simplification,[status(thm)],[complement_join]) ).
cnf(c_0_18,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_19,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_20,plain,
( ~ complement(X1,X2)
| join(X1,X2) = n1 ),
c_0_17 ).
cnf(c_0_21,hypothesis,
complement(r2,meet(a,b)),
complement_of_a_meet_b ).
cnf(c_0_22,axiom,
meet(X1,n1) = X1,
x_meet_1 ).
cnf(c_0_23,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_24,plain,
( meet(X1,X2) != X1
| meet(X2,join(X1,X3)) = join(X1,meet(X3,X2)) ),
inference(fof_simplification,[status(thm)],[modular]) ).
cnf(c_0_25,plain,
join(X1,join(X2,meet(join(X1,X2),X3))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,hypothesis,
join(r2,meet(a,b)) = n1,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
meet(n1,X1) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( meet(X1,X2) != X1
| meet(X2,join(X1,X3)) = join(X1,meet(X3,X2)) ),
c_0_24 ).
cnf(c_0_29,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_30,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_31,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_32,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_33,hypothesis,
join(r2,join(meet(a,b),X1)) = n1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_34,plain,
( meet(X3,X1) != X1
| join(X1,meet(X2,X3)) = meet(X3,join(X1,X2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_23]) ).
cnf(c_0_35,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,hypothesis,
join(r2,join(X1,meet(a,b))) = n1,
inference(spm,[status(thm)],[c_0_33,c_0_32]) ).
cnf(c_0_38,plain,
join(meet(X1,X2),meet(X3,X1)) = meet(X1,join(meet(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_23]),c_0_29]) ).
cnf(c_0_40,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_41,plain,
meet(X1,meet(X2,join(X3,meet(X1,X2)))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_29,c_0_36]) ).
cnf(c_0_42,hypothesis,
join(r2,meet(b,join(a,meet(b,X1)))) = n1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_32]) ).
cnf(c_0_43,plain,
join(X1,meet(X2,join(X1,X3))) = meet(join(X1,X3),join(X1,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_31]) ).
cnf(c_0_44,plain,
meet(X1,meet(X2,join(X3,X1))) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_39,c_0_36]) ).
cnf(c_0_45,plain,
( ~ complement(X1,X2)
| meet(X1,X2) = n0 ),
inference(fof_simplification,[status(thm)],[complement_meet]) ).
cnf(c_0_46,plain,
meet(X1,join(X2,meet(X1,join(X3,meet(X2,X1))))) = meet(X1,join(X3,meet(X2,X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_38]),c_0_32]) ).
cnf(c_0_47,hypothesis,
join(r2,meet(b,join(a,X1))) = n1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_23]) ).
cnf(c_0_48,plain,
( ~ complement(X1,X2)
| meet(X1,X2) = n0 ),
c_0_45 ).
cnf(c_0_49,hypothesis,
complement(r1,join(a,b)),
complement_of_a_join_b ).
cnf(c_0_50,axiom,
join(X1,n0) = X1,
x_join_0 ).
cnf(c_0_51,hypothesis,
meet(b,join(a,meet(b,r2))) = b,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_22]),c_0_23]) ).
cnf(c_0_52,plain,
meet(X1,meet(X2,join(meet(X1,X2),X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_31,c_0_29]) ).
cnf(c_0_53,hypothesis,
meet(r1,join(a,b)) = n0,
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,plain,
join(n0,X1) = X1,
inference(spm,[status(thm)],[c_0_50,c_0_32]) ).
cnf(c_0_55,plain,
meet(X1,join(X2,join(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_36,c_0_19]) ).
cnf(c_0_56,hypothesis,
join(a,meet(b,r2)) = join(a,b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_51]),c_0_19]),c_0_32]),c_0_18]) ).
cnf(c_0_57,plain,
join(X1,meet(X2,join(X3,X1))) = meet(join(X3,X1),join(X1,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_36]) ).
cnf(c_0_58,hypothesis,
meet(r1,meet(join(a,b),X1)) = n0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
cnf(c_0_59,hypothesis,
meet(b,meet(r2,join(X1,join(a,b)))) = meet(b,r2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_29]) ).
cnf(c_0_60,plain,
( join(X1,X2) != n1
| meet(X1,X2) != n0
| complement(X1,X2) ),
inference(fof_simplification,[status(thm)],[meet_join_complement]) ).
cnf(c_0_61,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_29,c_0_31]) ).
cnf(c_0_62,hypothesis,
meet(join(a,b),join(b,r1)) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_53]),c_0_50]) ).
cnf(c_0_63,hypothesis,
meet(join(a,b),meet(X1,join(r1,meet(join(a,b),meet(X1,X2))))) = meet(join(a,b),meet(X1,X2)),
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_38,c_0_58]),c_0_29]),c_0_50]),c_0_29]),c_0_29]),c_0_32]) ).
cnf(c_0_64,hypothesis,
meet(b,meet(r2,join(a,join(b,X1)))) = meet(b,r2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_32]),c_0_19]) ).
cnf(c_0_65,plain,
meet(X1,meet(join(X2,X1),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_29,c_0_36]) ).
cnf(c_0_66,plain,
join(X1,meet(X2,meet(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_40,c_0_29]) ).
cnf(c_0_67,plain,
meet(X1,meet(X2,join(meet(X2,X1),X3))) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_52,c_0_23]) ).
cnf(c_0_68,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_32]),c_0_19]) ).
cnf(c_0_69,plain,
( join(X1,X2) != n1
| meet(X1,X2) != n0
| complement(X1,X2) ),
c_0_60 ).
cnf(c_0_70,hypothesis,
meet(a,join(b,r1)) = meet(a,b),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_71,hypothesis,
meet(b,join(r1,meet(b,r2))) = meet(b,r2),
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_23]),c_0_29]),c_0_44]),c_0_23]),c_0_23]),c_0_29]),c_0_44]),c_0_23]),c_0_39]),c_0_65]) ).
cnf(c_0_72,plain,
join(meet(X1,join(meet(X1,X2),X3)),meet(X4,meet(X1,X2))) = meet(X1,join(meet(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_73,plain,
join(meet(X1,join(meet(X1,X2),X3)),X4) = join(meet(X1,X2),join(meet(X3,X1),X4)),
inference(spm,[status(thm)],[c_0_19,c_0_38]) ).
cnf(c_0_74,plain,
join(X1,join(X2,meet(X3,X1))) = join(X2,X1),
inference(spm,[status(thm)],[c_0_68,c_0_40]) ).
cnf(c_0_75,plain,
( join(X2,X1) != n1
| meet(X1,X2) != n0
| complement(X1,X2) ),
inference(spm,[status(thm)],[c_0_69,c_0_32]) ).
cnf(c_0_76,hypothesis,
join(r1,join(a,b)) = n1,
inference(spm,[status(thm)],[c_0_20,c_0_49]) ).
cnf(c_0_77,hypothesis,
meet(join(b,r1),join(a,meet(join(b,r1),X1))) = join(meet(a,b),meet(join(b,r1),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_70]),c_0_32]),c_0_32]) ).
cnf(c_0_78,hypothesis,
meet(join(b,r1),join(r1,meet(b,r2))) = join(r1,meet(b,r2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_71]),c_0_32]),c_0_23]) ).
cnf(c_0_79,plain,
join(meet(X1,X2),meet(X2,X3)) = meet(X2,join(meet(X2,X3),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73]),c_0_74]) ).
cnf(c_0_80,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_31]),c_0_19]) ).
cnf(c_0_81,hypothesis,
complement(join(a,b),r1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_23]),c_0_53])]) ).
cnf(c_0_82,plain,
meet(X1,meet(X2,X1)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_18]),c_0_29]) ).
cnf(c_0_83,hypothesis,
meet(r2,meet(a,b)) = n0,
inference(spm,[status(thm)],[c_0_48,c_0_21]) ).
cnf(c_0_84,axiom,
meet(X1,n0) = n0,
x_meet_0 ).
cnf(c_0_85,negated_conjecture,
~ complement(a,join(r1,meet(r2,b))),
inference(fof_simplification,[status(thm)],[prove_complememt]) ).
cnf(c_0_86,hypothesis,
meet(join(b,r1),join(a,join(r1,meet(b,r2)))) = join(b,r1),
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_77,c_0_78]),c_0_68]),c_0_79]),c_0_32]),c_0_56]),c_0_36]),c_0_32]) ).
cnf(c_0_87,plain,
join(X1,join(X2,join(X3,X1))) = join(X1,join(X2,X3)),
inference(spm,[status(thm)],[c_0_80,c_0_19]) ).
cnf(c_0_88,hypothesis,
join(a,join(b,r1)) = n1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_81]),c_0_19]) ).
cnf(c_0_89,hypothesis,
meet(a,meet(join(b,r1),X1)) = meet(a,meet(b,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_70]),c_0_29]) ).
cnf(c_0_90,hypothesis,
meet(a,meet(b,r2)) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84]),c_0_29]) ).
cnf(c_0_91,negated_conjecture,
~ complement(a,join(r1,meet(r2,b))),
c_0_85 ).
cnf(c_0_92,hypothesis,
join(a,join(r1,meet(b,r2))) = n1,
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_40,c_0_86]),c_0_19]),c_0_19]),c_0_87]),c_0_32]),c_0_18]),c_0_32]),c_0_88]) ).
cnf(c_0_93,hypothesis,
meet(a,join(r1,meet(b,r2))) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_78]),c_0_71]),c_0_90]) ).
cnf(c_0_94,negated_conjecture,
~ complement(a,join(r1,meet(b,r2))),
inference(spm,[status(thm)],[c_0_91,c_0_23]) ).
cnf(c_0_95,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_92]),c_0_93])]),c_0_94]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT001-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n007.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 23:00:51 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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
% 80.22/12.45 % Version: 3.5.1
% 80.22/12.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 80.22/12.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 80.22/12.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 80.22/12.45 % Starting new_bool_3 with 300s (1) cores
% 80.22/12.45 % Starting new_bool_1 with 300s (1) cores
% 80.22/12.45 % Starting sh5l with 300s (1) cores
% 80.22/12.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3777660 completed with status 0
% 80.22/12.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 80.22/12.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 80.22/12.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 80.22/12.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 80.22/12.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 80.22/12.45 % No SInE strategy applied
% 80.22/12.45 % Search class: FHUSM-FFSF22-SFFFFFNN
% 80.22/12.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 80.22/12.45 % Starting SubtermCWHack with 136s (1) cores
% 80.22/12.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 80.22/12.45 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 80.22/12.45 % Starting new_bool_3 with 136s (1) cores
% 80.22/12.45 % Starting new_bool_1 with 136s (1) cores
% 80.22/12.45 % new_bool_1 with pid 3777671 completed with status 0
% 80.22/12.45 % Result found by new_bool_1
% 80.22/12.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 80.22/12.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 80.22/12.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 80.22/12.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 80.22/12.45 % No SInE strategy applied
% 80.22/12.45 % Search class: FHUSM-FFSF22-SFFFFFNN
% 80.22/12.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 80.22/12.45 % Starting SubtermCWHack with 136s (1) cores
% 80.22/12.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 80.22/12.45 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 80.22/12.45 % Starting new_bool_3 with 136s (1) cores
% 80.22/12.45 % Starting new_bool_1 with 136s (1) cores
% 80.22/12.45 % Preprocessing time : 0.001 s
% 80.22/12.45 % Presaturation interreduction done
% 80.22/12.45
% 80.22/12.45 % Proof found!
% 80.22/12.45 % SZS status Unsatisfiable
% 80.22/12.45 % SZS output start CNFRefutation
% See solution above
% 80.22/12.45 % Parsed axioms : 19
% 80.22/12.45 % Removed by relevancy pruning/SinE : 0
% 80.22/12.45 % Initial clauses : 19
% 80.22/12.45 % Removed in clause preprocessing : 0
% 80.22/12.45 % Initial clauses in saturation : 19
% 80.22/12.45 % Processed clauses : 24742
% 80.22/12.45 % ...of these trivial : 4964
% 80.22/12.45 % ...subsumed : 17449
% 80.22/12.45 % ...remaining for further processing : 2329
% 80.22/12.45 % Other redundant clauses eliminated : 2594
% 80.22/12.45 % Clauses deleted for lack of memory : 0
% 80.22/12.45 % Backward-subsumed : 29
% 80.22/12.45 % Backward-rewritten : 603
% 80.22/12.45 % Generated clauses : 549721
% 80.22/12.45 % ...of the previous two non-redundant : 393863
% 80.22/12.45 % ...aggressively subsumed : 0
% 80.22/12.45 % Contextual simplify-reflections : 0
% 80.22/12.45 % Paramodulations : 547127
% 80.22/12.45 % Factorizations : 0
% 80.22/12.45 % NegExts : 0
% 80.22/12.45 % Equation resolutions : 2594
% 80.22/12.45 % Disequality decompositions : 0
% 80.22/12.45 % Total rewrite steps : 1067503
% 80.22/12.45 % ...of those cached : 885186
% 80.22/12.45 % Propositional unsat checks : 0
% 80.22/12.45 % Propositional check models : 0
% 80.22/12.45 % Propositional check unsatisfiable : 0
% 80.22/12.45 % Propositional clauses : 0
% 80.22/12.45 % Propositional clauses after purity: 0
% 80.22/12.45 % Propositional unsat core size : 0
% 80.22/12.45 % Propositional preprocessing time : 0.000
% 80.22/12.45 % Propositional encoding time : 0.000
% 80.22/12.45 % Propositional solver time : 0.000
% 80.22/12.45 % Success case prop preproc time : 0.000
% 80.22/12.45 % Success case prop encoding time : 0.000
% 80.22/12.45 % Success case prop solver time : 0.000
% 80.22/12.45 % Current number of processed clauses : 1672
% 80.22/12.45 % Positive orientable unit clauses : 639
% 80.22/12.45 % Positive unorientable unit clauses: 16
% 80.22/12.45 % Negative unit clauses : 2
% 80.22/12.45 % Non-unit-clauses : 1015
% 80.22/12.45 % Current number of unprocessed clauses: 367144
% 80.22/12.45 % ...number of literals in the above : 562308
% 80.22/12.45 % Current number of archived formulas : 0
% 80.22/12.45 % Current number of archived clauses : 651
% 80.22/12.45 % Clause-clause subsumption calls (NU) : 190126
% 80.22/12.45 % Rec. Clause-clause subsumption calls : 190072
% 80.22/12.45 % Non-unit clause-clause subsumptions : 14274
% 80.22/12.45 % Unit Clause-clause subsumption calls : 15728
% 80.22/12.45 % Rewrite failures with RHS unbound : 0
% 80.22/12.45 % BW rewrite match attempts : 21903
% 80.22/12.45 % BW rewrite match successes : 2190
% 80.22/12.45 % Condensation attempts : 0
% 80.22/12.45 % Condensation successes : 0
% 80.22/12.45 % Termbank termtop insertions : 10526837
% 80.22/12.45 % Search garbage collected termcells : 12
% 80.22/12.45
% 80.22/12.45 % -------------------------------------------------
% 80.22/12.45 % User time : 10.878 s
% 80.22/12.45 % System time : 0.433 s
% 80.22/12.45 % Total time : 11.311 s
% 80.22/12.45 % Maximum resident set size: 3644 pages
% 80.22/12.45
% 80.22/12.45 % -------------------------------------------------
% 80.22/12.45 % User time : 54.161 s
% 80.22/12.45 % System time : 2.191 s
% 80.22/12.45 % Total time : 56.352 s
% 80.22/12.45 % Maximum resident set size: 4608 pages
% 80.22/12.45 % E exiting
%------------------------------------------------------------------------------