TSTP Solution File: LAT247-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LAT247-1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:10:12 EDT 2023
% Result : Unsatisfiable 154.72s 20.02s
% Output : CNFRefutation 154.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 14
% Syntax : Number of clauses : 99 ( 95 unt; 0 nHn; 22 RR)
% Number of literals : 106 ( 105 equ; 10 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 ( 25 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_distributivity_hypothesis,hypothesis,
meet(b,a) = a,
file('/export/starexec/sandbox2/tmp/tmp.vSrqaXhiPP/E---3.1_18974.p',prove_distributivity_hypothesis) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.vSrqaXhiPP/E---3.1_18974.p',commutativity_of_meet) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.vSrqaXhiPP/E---3.1_18974.p',associativity_of_meet) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.vSrqaXhiPP/E---3.1_18974.p',absorption2) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.vSrqaXhiPP/E---3.1_18974.p',absorption1) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox2/tmp/tmp.vSrqaXhiPP/E---3.1_18974.p',complement_join) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.vSrqaXhiPP/E---3.1_18974.p',idempotence_of_meet) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.vSrqaXhiPP/E---3.1_18974.p',commutativity_of_join) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox2/tmp/tmp.vSrqaXhiPP/E---3.1_18974.p',complement_meet) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.vSrqaXhiPP/E---3.1_18974.p',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.vSrqaXhiPP/E---3.1_18974.p',idempotence_of_join) ).
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/tmp/tmp.vSrqaXhiPP/E---3.1_18974.p',equation_H61) ).
cnf(meet_join_complement,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
file('/export/starexec/sandbox2/tmp/tmp.vSrqaXhiPP/E---3.1_18974.p',meet_join_complement) ).
cnf(prove_distributivity,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
file('/export/starexec/sandbox2/tmp/tmp.vSrqaXhiPP/E---3.1_18974.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,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_19,hypothesis,
meet(a,meet(b,X1)) = meet(a,X1),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_21,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_22,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_23,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_24,hypothesis,
meet(a,meet(X1,b)) = meet(a,X1),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_25,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_26,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_28,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_29,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_30,hypothesis,
join(meet(X1,b),meet(a,X1)) = meet(X1,b),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_25]) ).
cnf(c_0_32,plain,
meet(one,X1) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_15]) ).
cnf(c_0_33,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_34,hypothesis,
meet(a,complement(b)) = meet(a,zero),
inference(spm,[status(thm)],[c_0_19,c_0_27]) ).
cnf(c_0_35,plain,
meet(X1,zero) = zero,
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_36,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_27]) ).
cnf(c_0_37,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_16,c_0_20]) ).
cnf(c_0_38,plain,
join(X1,join(X2,meet(X3,join(X1,X2)))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_29]) ).
cnf(c_0_39,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_30,c_0_31]),c_0_15]),c_0_25]),c_0_15]) ).
cnf(c_0_40,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_20,c_0_32]) ).
cnf(c_0_41,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_29,c_0_33]) ).
cnf(c_0_42,axiom,
meet(join(X1,X2),join(X1,X3)) = join(X1,meet(join(X1,X2),join(meet(X1,X2),X3))),
equation_H61 ).
cnf(c_0_43,hypothesis,
meet(a,complement(b)) = zero,
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_44,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_36,c_0_25]) ).
cnf(c_0_45,plain,
meet(X1,complement(join(X1,X2))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_27]),c_0_35]) ).
cnf(c_0_46,hypothesis,
join(X1,meet(b,join(X1,a))) = join(X1,a),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_47,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_20]),c_0_29]) ).
cnf(c_0_48,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_21]),c_0_40]) ).
cnf(c_0_49,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_41,c_0_21]) ).
cnf(c_0_50,hypothesis,
join(meet(b,X1),meet(a,X1)) = meet(b,X1),
inference(spm,[status(thm)],[c_0_23,c_0_19]) ).
cnf(c_0_51,plain,
meet(X1,meet(join(X2,X1),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_16,c_0_31]) ).
cnf(c_0_52,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_42,c_0_43]),c_0_44]) ).
cnf(c_0_53,plain,
meet(X1,complement(meet(join(X1,X2),join(X1,X3)))) = zero,
inference(spm,[status(thm)],[c_0_45,c_0_42]) ).
cnf(c_0_54,hypothesis,
join(X1,meet(b,join(a,X1))) = join(a,X1),
inference(spm,[status(thm)],[c_0_46,c_0_25]) ).
cnf(c_0_55,plain,
join(X1,join(X2,meet(join(X1,X2),X3))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_29]) ).
cnf(c_0_56,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_42,c_0_25]) ).
cnf(c_0_57,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
meet_join_complement ).
cnf(c_0_58,plain,
join(complement(X1),join(X2,X1)) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_29]) ).
cnf(c_0_59,hypothesis,
join(meet(b,X1),meet(X1,a)) = meet(b,X1),
inference(spm,[status(thm)],[c_0_50,c_0_15]) ).
cnf(c_0_60,plain,
join(meet(X1,X2),meet(X1,meet(X2,X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_61,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_28,c_0_15]) ).
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_51,c_0_52]) ).
cnf(c_0_63,hypothesis,
meet(X1,complement(meet(join(X1,X2),join(a,X1)))) = zero,
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
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_52]) ).
cnf(c_0_65,plain,
join(X1,meet(join(X1,X2),join(X2,X3))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_66,plain,
( complement(X1) = X2
| meet(X2,X1) != zero
| join(X1,X2) != one ),
inference(spm,[status(thm)],[c_0_57,c_0_15]) ).
cnf(c_0_67,hypothesis,
join(meet(b,X1),complement(meet(X1,a))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_25]) ).
cnf(c_0_68,plain,
join(meet(X1,X2),meet(X2,X1)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_22]),c_0_16]),c_0_61]),c_0_16]),c_0_61]) ).
cnf(c_0_69,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_36]),c_0_15]),c_0_34]),c_0_35]),c_0_29]),c_0_41]),c_0_64]),c_0_65]) ).
cnf(c_0_70,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_27]),c_0_25]),c_0_21])]) ).
cnf(c_0_71,plain,
join(X1,join(X2,complement(join(X2,X1)))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_47]),c_0_25]),c_0_29]) ).
cnf(c_0_72,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_42,c_0_67]),c_0_16]),c_0_32]),c_0_32]) ).
cnf(c_0_73,plain,
join(meet(X1,X2),complement(meet(X2,X1))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_68]),c_0_25]) ).
cnf(c_0_74,plain,
meet(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_15,c_0_35]) ).
cnf(c_0_75,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_57,c_0_69]),c_0_70]),c_0_71])]) ).
cnf(c_0_76,hypothesis,
join(meet(b,X1),complement(meet(X1,meet(b,complement(meet(X1,a)))))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_49]),c_0_16]),c_0_15]) ).
cnf(c_0_77,plain,
meet(X1,meet(complement(X1),X2)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_27]),c_0_74]) ).
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_42,c_0_75]),c_0_45]),c_0_44]) ).
cnf(c_0_79,hypothesis,
join(b,a) = b,
inference(spm,[status(thm)],[c_0_23,c_0_17]) ).
cnf(c_0_80,hypothesis,
join(meet(b,X1),complement(meet(X1,meet(b,complement(meet(a,X1)))))) = one,
inference(spm,[status(thm)],[c_0_76,c_0_15]) ).
cnf(c_0_81,plain,
meet(X1,meet(X2,complement(X1))) = zero,
inference(spm,[status(thm)],[c_0_77,c_0_61]) ).
cnf(c_0_82,plain,
complement(zero) = one,
inference(spm,[status(thm)],[c_0_21,c_0_44]) ).
cnf(c_0_83,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_84,hypothesis,
join(a,b) = b,
inference(rw,[status(thm)],[c_0_79,c_0_25]) ).
cnf(c_0_85,plain,
meet(X1,meet(X2,complement(meet(X1,X2)))) = zero,
inference(spm,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_86,hypothesis,
join(meet(b,meet(X1,complement(a))),complement(meet(X1,meet(b,complement(a))))) = 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_82]),c_0_26]),c_0_16]),c_0_15]) ).
cnf(c_0_87,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_83,c_0_63]),c_0_36]),c_0_84]),c_0_15]),c_0_20]) ).
cnf(c_0_88,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_15]),c_0_16]) ).
cnf(c_0_89,hypothesis,
join(b,join(a,X1)) = join(b,X1),
inference(spm,[status(thm)],[c_0_29,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_52,c_0_21]),c_0_26]),c_0_15]) ).
cnf(c_0_91,plain,
join(X1,join(X2,complement(X1))) = one,
inference(spm,[status(thm)],[c_0_48,c_0_25]) ).
cnf(c_0_92,plain,
( meet(X1,complement(meet(X2,X1))) = complement(X2)
| join(X2,meet(X1,complement(meet(X2,X1)))) != one ),
inference(spm,[status(thm)],[c_0_57,c_0_85]) ).
cnf(c_0_93,hypothesis,
complement(meet(b,meet(complement(a),join(a,complement(b))))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_27]),c_0_88]),c_0_15]),c_0_44]) ).
cnf(c_0_94,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_95,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
prove_distributivity ).
cnf(c_0_96,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_92,c_0_93]),c_0_26]),c_0_26]),c_0_94])]) ).
cnf(c_0_97,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_95,c_0_25]) ).
cnf(c_0_98,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_96]),c_0_97]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LAT247-1 : TPTP v8.1.2. Released v3.1.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n016.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 11:08:51 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.17/0.42 Running first-order model finding
% 0.17/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.vSrqaXhiPP/E---3.1_18974.p
% 154.72/20.02 # Version: 3.1pre001
% 154.72/20.02 # Preprocessing class: FSSSSMSSSSSNFFN.
% 154.72/20.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 154.72/20.02 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 154.72/20.02 # Starting new_bool_3 with 300s (1) cores
% 154.72/20.02 # Starting new_bool_1 with 300s (1) cores
% 154.72/20.02 # Starting sh5l with 300s (1) cores
% 154.72/20.02 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 19051 completed with status 0
% 154.72/20.02 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 154.72/20.02 # Preprocessing class: FSSSSMSSSSSNFFN.
% 154.72/20.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 154.72/20.02 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 154.72/20.02 # No SInE strategy applied
% 154.72/20.02 # Search class: FHUPM-FFSF21-MFFFFFNN
% 154.72/20.02 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 154.72/20.02 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 154.72/20.02 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 154.72/20.02 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 154.72/20.02 # Starting new_bool_3 with 136s (1) cores
% 154.72/20.02 # Starting new_bool_1 with 136s (1) cores
% 154.72/20.02 # G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with pid 19059 completed with status 0
% 154.72/20.02 # Result found by G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S
% 154.72/20.02 # Preprocessing class: FSSSSMSSSSSNFFN.
% 154.72/20.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 154.72/20.02 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 154.72/20.02 # No SInE strategy applied
% 154.72/20.02 # Search class: FHUPM-FFSF21-MFFFFFNN
% 154.72/20.02 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 154.72/20.02 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 154.72/20.02 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 154.72/20.02 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 154.72/20.02 # Preprocessing time : 0.001 s
% 154.72/20.02 # Presaturation interreduction done
% 154.72/20.02
% 154.72/20.02 # Proof found!
% 154.72/20.02 # SZS status Unsatisfiable
% 154.72/20.02 # SZS output start CNFRefutation
% See solution above
% 154.72/20.02 # Parsed axioms : 14
% 154.72/20.02 # Removed by relevancy pruning/SinE : 0
% 154.72/20.02 # Initial clauses : 14
% 154.72/20.02 # Removed in clause preprocessing : 0
% 154.72/20.02 # Initial clauses in saturation : 14
% 154.72/20.02 # Processed clauses : 34470
% 154.72/20.02 # ...of these trivial : 18107
% 154.72/20.02 # ...subsumed : 14518
% 154.72/20.02 # ...remaining for further processing : 1845
% 154.72/20.02 # Other redundant clauses eliminated : 0
% 154.72/20.02 # Clauses deleted for lack of memory : 0
% 154.72/20.02 # Backward-subsumed : 20
% 154.72/20.02 # Backward-rewritten : 345
% 154.72/20.02 # Generated clauses : 1274127
% 154.72/20.02 # ...of the previous two non-redundant : 577034
% 154.72/20.02 # ...aggressively subsumed : 0
% 154.72/20.02 # Contextual simplify-reflections : 0
% 154.72/20.02 # Paramodulations : 1274109
% 154.72/20.02 # Factorizations : 0
% 154.72/20.02 # NegExts : 0
% 154.72/20.02 # Equation resolutions : 18
% 154.72/20.02 # Total rewrite steps : 3768108
% 154.72/20.02 # Propositional unsat checks : 0
% 154.72/20.02 # Propositional check models : 0
% 154.72/20.02 # Propositional check unsatisfiable : 0
% 154.72/20.02 # Propositional clauses : 0
% 154.72/20.02 # Propositional clauses after purity: 0
% 154.72/20.02 # Propositional unsat core size : 0
% 154.72/20.02 # Propositional preprocessing time : 0.000
% 154.72/20.02 # Propositional encoding time : 0.000
% 154.72/20.02 # Propositional solver time : 0.000
% 154.72/20.02 # Success case prop preproc time : 0.000
% 154.72/20.02 # Success case prop encoding time : 0.000
% 154.72/20.02 # Success case prop solver time : 0.000
% 154.72/20.02 # Current number of processed clauses : 1466
% 154.72/20.02 # Positive orientable unit clauses : 1315
% 154.72/20.02 # Positive unorientable unit clauses: 10
% 154.72/20.02 # Negative unit clauses : 1
% 154.72/20.02 # Non-unit-clauses : 140
% 154.72/20.02 # Current number of unprocessed clauses: 541062
% 154.72/20.02 # ...number of literals in the above : 574725
% 154.72/20.02 # Current number of archived formulas : 0
% 154.72/20.02 # Current number of archived clauses : 379
% 154.72/20.02 # Clause-clause subsumption calls (NU) : 19511
% 154.72/20.02 # Rec. Clause-clause subsumption calls : 19511
% 154.72/20.02 # Non-unit clause-clause subsumptions : 7068
% 154.72/20.02 # Unit Clause-clause subsumption calls : 817
% 154.72/20.02 # Rewrite failures with RHS unbound : 0
% 154.72/20.02 # BW rewrite match attempts : 26157
% 154.72/20.02 # BW rewrite match successes : 2611
% 154.72/20.02 # Condensation attempts : 0
% 154.72/20.02 # Condensation successes : 0
% 154.72/20.02 # Termbank termtop insertions : 24924160
% 154.72/20.02
% 154.72/20.02 # -------------------------------------------------
% 154.72/20.02 # User time : 18.600 s
% 154.72/20.02 # System time : 0.634 s
% 154.72/20.02 # Total time : 19.235 s
% 154.72/20.02 # Maximum resident set size: 1592 pages
% 154.72/20.02
% 154.72/20.02 # -------------------------------------------------
% 154.72/20.02 # User time : 94.394 s
% 154.72/20.02 # System time : 1.893 s
% 154.72/20.02 # Total time : 96.287 s
% 154.72/20.02 # Maximum resident set size: 1676 pages
% 154.72/20.02 % E---3.1 exiting
%------------------------------------------------------------------------------