TSTP Solution File: LAT200-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT200-1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:08:00 EDT 2023
% Result : Unsatisfiable 2.71s 0.81s
% Output : CNFRefutation 2.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 13
% Syntax : Number of clauses : 100 ( 94 unt; 0 nHn; 10 RR)
% Number of literals : 109 ( 108 equ; 11 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 : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 202 ( 27 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.xt7k6xOfSL/E---3.1_9628.p',associativity_of_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.xt7k6xOfSL/E---3.1_9628.p',idempotence_of_meet) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.xt7k6xOfSL/E---3.1_9628.p',absorption1) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox/tmp/tmp.xt7k6xOfSL/E---3.1_9628.p',complement_join) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.xt7k6xOfSL/E---3.1_9628.p',commutativity_of_join) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox/tmp/tmp.xt7k6xOfSL/E---3.1_9628.p',complement_meet) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.xt7k6xOfSL/E---3.1_9628.p',absorption2) ).
cnf(equation_H50,axiom,
meet(X1,join(X2,meet(X3,join(X1,X4)))) = meet(X1,join(X2,meet(X3,join(X1,meet(X3,join(X2,X4)))))),
file('/export/starexec/sandbox/tmp/tmp.xt7k6xOfSL/E---3.1_9628.p',equation_H50) ).
cnf(meet_join_complement,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
file('/export/starexec/sandbox/tmp/tmp.xt7k6xOfSL/E---3.1_9628.p',meet_join_complement) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.xt7k6xOfSL/E---3.1_9628.p',commutativity_of_meet) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.xt7k6xOfSL/E---3.1_9628.p',idempotence_of_join) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.xt7k6xOfSL/E---3.1_9628.p',associativity_of_join) ).
cnf(prove_distributivity,negated_conjecture,
meet(a,join(b,c)) != join(meet(a,b),meet(a,c)),
file('/export/starexec/sandbox/tmp/tmp.xt7k6xOfSL/E---3.1_9628.p',prove_distributivity) ).
cnf(c_0_13,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_14,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_15,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_16,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_17,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_18,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_20,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_21,axiom,
meet(X1,join(X2,meet(X3,join(X1,X4)))) = meet(X1,join(X2,meet(X3,join(X1,meet(X3,join(X2,X4)))))),
equation_H50 ).
cnf(c_0_22,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_24,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
meet_join_complement ).
cnf(c_0_25,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_26,plain,
meet(X1,zero) = zero,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_28,plain,
meet(X1,join(X2,meet(X3,join(X1,complement(X2))))) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_16]),c_0_22]),c_0_23]) ).
cnf(c_0_29,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_30,plain,
( complement(X1) = X2
| meet(X2,X1) != zero
| join(X1,X2) != one ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
meet(X1,meet(X2,complement(meet(X1,X2)))) = zero,
inference(spm,[status(thm)],[c_0_19,c_0_13]) ).
cnf(c_0_32,plain,
meet(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_33,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_17]) ).
cnf(c_0_34,plain,
meet(complement(X1),join(X1,meet(X2,complement(X1)))) = meet(complement(X1),join(X1,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_19]),c_0_17]),c_0_16])]) ).
cnf(c_0_36,plain,
meet(X1,meet(X2,complement(meet(X2,X1)))) = zero,
inference(spm,[status(thm)],[c_0_31,c_0_25]) ).
cnf(c_0_37,plain,
meet(X1,meet(complement(X1),X2)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_19]),c_0_32]) ).
cnf(c_0_38,plain,
complement(zero) = one,
inference(spm,[status(thm)],[c_0_16,c_0_33]) ).
cnf(c_0_39,plain,
meet(X1,join(complement(X1),meet(X2,X1))) = meet(X1,join(complement(X1),X2)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
meet(complement(X1),meet(X2,X1)) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_22]),c_0_13]) ).
cnf(c_0_41,plain,
meet(one,X1) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_25]) ).
cnf(c_0_42,plain,
meet(X1,meet(join(X2,X1),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_13,c_0_23]) ).
cnf(c_0_43,plain,
meet(X1,meet(X2,join(complement(X2),complement(meet(X1,X2))))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_27]),c_0_19]),c_0_13]),c_0_17]) ).
cnf(c_0_44,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_45,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_15,c_0_41]) ).
cnf(c_0_46,plain,
meet(X1,join(complement(X1),complement(join(X2,X1)))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_23]),c_0_17]) ).
cnf(c_0_47,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_16]),c_0_45]) ).
cnf(c_0_48,plain,
meet(X1,join(complement(X1),meet(X1,X2))) = meet(X1,join(complement(X1),X2)),
inference(spm,[status(thm)],[c_0_39,c_0_25]) ).
cnf(c_0_49,plain,
join(complement(X1),complement(join(X2,X1))) = complement(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_46]),c_0_47])]) ).
cnf(c_0_50,plain,
meet(X1,join(complement(X1),meet(X2,complement(meet(X1,X2))))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_31]),c_0_27]),c_0_19]) ).
cnf(c_0_51,plain,
meet(complement(X1),complement(join(X2,X1))) = complement(join(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_49]),c_0_25]) ).
cnf(c_0_52,plain,
join(complement(X1),meet(X2,complement(meet(X1,X2)))) = complement(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_50]),c_0_47])]) ).
cnf(c_0_53,plain,
meet(complement(X1),complement(meet(X1,X2))) = complement(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_20]),c_0_25]) ).
cnf(c_0_54,plain,
join(X1,meet(X2,complement(meet(complement(X1),X2)))) = X1,
inference(spm,[status(thm)],[c_0_52,c_0_35]) ).
cnf(c_0_55,plain,
meet(X1,complement(meet(complement(X1),X2))) = X1,
inference(spm,[status(thm)],[c_0_53,c_0_35]) ).
cnf(c_0_56,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_57,plain,
join(X1,meet(X2,complement(meet(X2,complement(X1))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_36]),c_0_38]),c_0_22]) ).
cnf(c_0_58,plain,
meet(X1,complement(meet(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_59,plain,
meet(X1,complement(meet(X1,complement(X2)))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_57]),c_0_13]),c_0_25]),c_0_58]) ).
cnf(c_0_60,plain,
join(complement(X1),complement(meet(X1,X2))) = complement(meet(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_20]),c_0_17]) ).
cnf(c_0_61,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_25]) ).
cnf(c_0_62,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_63,plain,
meet(X1,join(complement(X1),X2)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_59]),c_0_48]),c_0_60]),c_0_59]) ).
cnf(c_0_64,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_15]),c_0_44]) ).
cnf(c_0_65,plain,
meet(X1,join(complement(X1),complement(join(X1,X2)))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_43]),c_0_15]),c_0_17]) ).
cnf(c_0_66,plain,
meet(X1,join(X2,complement(X1))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_63]) ).
cnf(c_0_67,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_45,c_0_17]) ).
cnf(c_0_68,plain,
join(complement(X1),complement(join(X1,X2))) = complement(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_65]),c_0_47])]) ).
cnf(c_0_69,plain,
meet(complement(X1),join(X2,X1)) = meet(complement(X1),X2),
inference(spm,[status(thm)],[c_0_66,c_0_35]) ).
cnf(c_0_70,plain,
join(complement(X1),join(X2,X1)) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_47]),c_0_67]),c_0_44]) ).
cnf(c_0_71,plain,
join(X1,complement(join(complement(X1),X2))) = X1,
inference(spm,[status(thm)],[c_0_68,c_0_35]) ).
cnf(c_0_72,plain,
( join(X1,X2) = X2
| meet(complement(X2),X1) != zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_69]),c_0_35]),c_0_70])]) ).
cnf(c_0_73,plain,
meet(X1,complement(meet(X1,X2))) = meet(X1,complement(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_59]),c_0_18]) ).
cnf(c_0_74,plain,
meet(X1,complement(join(complement(X1),X2))) = complement(join(complement(X1),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_71]),c_0_25]) ).
cnf(c_0_75,plain,
( join(X1,X2) = X2
| meet(X1,complement(X2)) != zero ),
inference(spm,[status(thm)],[c_0_72,c_0_25]) ).
cnf(c_0_76,plain,
complement(join(complement(X1),X2)) = meet(X1,complement(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_63]),c_0_73]),c_0_74]) ).
cnf(c_0_77,plain,
join(X1,join(meet(X1,X2),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_44,c_0_20]) ).
cnf(c_0_78,plain,
( join(X1,complement(X2)) = complement(X2)
| meet(X1,X2) != zero ),
inference(spm,[status(thm)],[c_0_75,c_0_35]) ).
cnf(c_0_79,plain,
complement(meet(X1,complement(X2))) = join(complement(X1),X2),
inference(spm,[status(thm)],[c_0_35,c_0_76]) ).
cnf(c_0_80,plain,
join(X1,join(X2,meet(X1,X3))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_64]),c_0_77]) ).
cnf(c_0_81,plain,
join(complement(X1),meet(X2,X1)) = join(X2,complement(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_31]),c_0_79]),c_0_80]),c_0_79]) ).
cnf(c_0_82,plain,
join(X1,meet(X2,complement(X1))) = join(X2,X1),
inference(spm,[status(thm)],[c_0_81,c_0_35]) ).
cnf(c_0_83,plain,
join(X1,meet(complement(X1),X2)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_82,c_0_25]) ).
cnf(c_0_84,plain,
meet(X1,meet(join(complement(X1),X2),X3)) = meet(X1,meet(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_63]),c_0_13]) ).
cnf(c_0_85,plain,
join(X1,meet(join(X1,X2),X3)) = join(meet(X2,X3),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_83]),c_0_35]),c_0_17]) ).
cnf(c_0_86,plain,
meet(X1,meet(X2,join(X3,X1))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_42,c_0_25]) ).
cnf(c_0_87,plain,
join(X1,join(X2,join(X1,X3))) = join(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_64]),c_0_44]),c_0_44]) ).
cnf(c_0_88,plain,
join(X1,join(X2,join(X3,X1))) = join(X1,join(X2,X3)),
inference(spm,[status(thm)],[c_0_64,c_0_44]) ).
cnf(c_0_89,plain,
join(meet(X1,X2),meet(join(X1,X3),X2)) = meet(join(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_17]) ).
cnf(c_0_90,plain,
join(X1,meet(X2,join(X1,X3))) = join(meet(X3,X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_56]),c_0_86]) ).
cnf(c_0_91,plain,
meet(X1,join(X2,join(complement(X1),X3))) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_87]),c_0_63]) ).
cnf(c_0_92,plain,
meet(X1,join(X2,join(X3,complement(X1)))) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_88]),c_0_63]) ).
cnf(c_0_93,plain,
meet(join(X1,X2),join(X1,X3)) = join(meet(X2,X3),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_15]),c_0_90]),c_0_17]),c_0_90]) ).
cnf(c_0_94,plain,
meet(X1,join(X2,meet(X1,X3))) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_83]),c_0_92]),c_0_35]) ).
cnf(c_0_95,plain,
meet(join(X1,X2),join(X2,X3)) = join(meet(X1,X3),X2),
inference(spm,[status(thm)],[c_0_93,c_0_17]) ).
cnf(c_0_96,plain,
meet(X1,join(meet(X1,X2),X3)) = meet(X1,join(X3,X2)),
inference(spm,[status(thm)],[c_0_94,c_0_17]) ).
cnf(c_0_97,negated_conjecture,
meet(a,join(b,c)) != join(meet(a,b),meet(a,c)),
prove_distributivity ).
cnf(c_0_98,plain,
join(meet(X1,X2),meet(X1,X3)) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_20]),c_0_96]) ).
cnf(c_0_99,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_98])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : LAT200-1 : TPTP v8.1.2. Released v3.1.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n006.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 09:51:25 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.42 Running first-order theorem proving
% 0.17/0.42 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.xt7k6xOfSL/E---3.1_9628.p
% 2.71/0.81 # Version: 3.1pre001
% 2.71/0.81 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.71/0.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.71/0.81 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.71/0.81 # Starting new_bool_3 with 300s (1) cores
% 2.71/0.81 # Starting new_bool_1 with 300s (1) cores
% 2.71/0.81 # Starting sh5l with 300s (1) cores
% 2.71/0.81 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 9707 completed with status 0
% 2.71/0.81 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 2.71/0.81 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.71/0.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.71/0.81 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.71/0.81 # No SInE strategy applied
% 2.71/0.81 # Search class: FHUPM-FFSF21-DFFFFFNN
% 2.71/0.81 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.71/0.81 # Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 2.71/0.81 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 2.71/0.81 # Starting new_bool_3 with 136s (1) cores
% 2.71/0.81 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 2.71/0.81 # Starting G-E--_303_C18_F1_URBAN_S0Y with 136s (1) cores
% 2.71/0.81 # E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with pid 9711 completed with status 0
% 2.71/0.81 # Result found by E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 2.71/0.81 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.71/0.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.71/0.81 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.71/0.81 # No SInE strategy applied
% 2.71/0.81 # Search class: FHUPM-FFSF21-DFFFFFNN
% 2.71/0.81 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.71/0.81 # Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 2.71/0.81 # Preprocessing time : 0.001 s
% 2.71/0.81 # Presaturation interreduction done
% 2.71/0.81
% 2.71/0.81 # Proof found!
% 2.71/0.81 # SZS status Unsatisfiable
% 2.71/0.81 # SZS output start CNFRefutation
% See solution above
% 2.71/0.81 # Parsed axioms : 13
% 2.71/0.81 # Removed by relevancy pruning/SinE : 0
% 2.71/0.81 # Initial clauses : 13
% 2.71/0.81 # Removed in clause preprocessing : 0
% 2.71/0.81 # Initial clauses in saturation : 13
% 2.71/0.81 # Processed clauses : 2621
% 2.71/0.81 # ...of these trivial : 648
% 2.71/0.81 # ...subsumed : 1630
% 2.71/0.81 # ...remaining for further processing : 343
% 2.71/0.81 # Other redundant clauses eliminated : 0
% 2.71/0.81 # Clauses deleted for lack of memory : 0
% 2.71/0.81 # Backward-subsumed : 0
% 2.71/0.81 # Backward-rewritten : 99
% 2.71/0.81 # Generated clauses : 31135
% 2.71/0.81 # ...of the previous two non-redundant : 18948
% 2.71/0.81 # ...aggressively subsumed : 0
% 2.71/0.81 # Contextual simplify-reflections : 0
% 2.71/0.81 # Paramodulations : 31109
% 2.71/0.81 # Factorizations : 0
% 2.71/0.81 # NegExts : 0
% 2.71/0.81 # Equation resolutions : 26
% 2.71/0.81 # Total rewrite steps : 63334
% 2.71/0.81 # Propositional unsat checks : 0
% 2.71/0.81 # Propositional check models : 0
% 2.71/0.81 # Propositional check unsatisfiable : 0
% 2.71/0.81 # Propositional clauses : 0
% 2.71/0.81 # Propositional clauses after purity: 0
% 2.71/0.81 # Propositional unsat core size : 0
% 2.71/0.81 # Propositional preprocessing time : 0.000
% 2.71/0.81 # Propositional encoding time : 0.000
% 2.71/0.81 # Propositional solver time : 0.000
% 2.71/0.81 # Success case prop preproc time : 0.000
% 2.71/0.81 # Success case prop encoding time : 0.000
% 2.71/0.81 # Success case prop solver time : 0.000
% 2.71/0.81 # Current number of processed clauses : 231
% 2.71/0.81 # Positive orientable unit clauses : 129
% 2.71/0.81 # Positive unorientable unit clauses: 7
% 2.71/0.81 # Negative unit clauses : 0
% 2.71/0.81 # Non-unit-clauses : 95
% 2.71/0.81 # Current number of unprocessed clauses: 15789
% 2.71/0.81 # ...number of literals in the above : 18908
% 2.71/0.81 # Current number of archived formulas : 0
% 2.71/0.81 # Current number of archived clauses : 112
% 2.71/0.81 # Clause-clause subsumption calls (NU) : 5803
% 2.71/0.81 # Rec. Clause-clause subsumption calls : 5771
% 2.71/0.81 # Non-unit clause-clause subsumptions : 1081
% 2.71/0.81 # Unit Clause-clause subsumption calls : 114
% 2.71/0.81 # Rewrite failures with RHS unbound : 0
% 2.71/0.81 # BW rewrite match attempts : 1229
% 2.71/0.81 # BW rewrite match successes : 389
% 2.71/0.81 # Condensation attempts : 0
% 2.71/0.81 # Condensation successes : 0
% 2.71/0.81 # Termbank termtop insertions : 372289
% 2.71/0.81
% 2.71/0.81 # -------------------------------------------------
% 2.71/0.81 # User time : 0.351 s
% 2.71/0.81 # System time : 0.015 s
% 2.71/0.81 # Total time : 0.366 s
% 2.71/0.81 # Maximum resident set size: 1596 pages
% 2.71/0.81
% 2.71/0.81 # -------------------------------------------------
% 2.71/0.81 # User time : 1.780 s
% 2.71/0.81 # System time : 0.068 s
% 2.71/0.81 # Total time : 1.847 s
% 2.71/0.81 # Maximum resident set size: 1680 pages
% 2.71/0.81 % E---3.1 exiting
% 2.71/0.81 % E---3.1 exiting
%------------------------------------------------------------------------------