TSTP Solution File: LAT199-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LAT199-1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:14:22 EDT 2024
% Result : Unsatisfiable 3.59s 0.92s
% Output : CNFRefutation 3.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 13
% Syntax : Number of clauses : 92 ( 88 unt; 0 nHn; 9 RR)
% Number of literals : 100 ( 99 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 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 : 181 ( 22 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.BddpZLrgHA/E---3.1_26442.p',associativity_of_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.BddpZLrgHA/E---3.1_26442.p',idempotence_of_meet) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.BddpZLrgHA/E---3.1_26442.p',absorption1) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox/tmp/tmp.BddpZLrgHA/E---3.1_26442.p',complement_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.BddpZLrgHA/E---3.1_26442.p',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.BddpZLrgHA/E---3.1_26442.p',commutativity_of_meet) ).
cnf(meet_join_complement,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
file('/export/starexec/sandbox/tmp/tmp.BddpZLrgHA/E---3.1_26442.p',meet_join_complement) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox/tmp/tmp.BddpZLrgHA/E---3.1_26442.p',complement_meet) ).
cnf(equation_H49,axiom,
meet(X1,join(X2,meet(X3,join(X1,X4)))) = meet(X1,join(X2,join(meet(X1,X3),meet(X3,join(X2,X4))))),
file('/export/starexec/sandbox/tmp/tmp.BddpZLrgHA/E---3.1_26442.p',equation_H49) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.BddpZLrgHA/E---3.1_26442.p',commutativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.BddpZLrgHA/E---3.1_26442.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.BddpZLrgHA/E---3.1_26442.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.BddpZLrgHA/E---3.1_26442.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,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_18,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_19,plain,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
inference(fof_simplification,[status(thm)],[meet_join_complement]) ).
cnf(c_0_20,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_22,axiom,
meet(X1,join(X2,meet(X3,join(X1,X4)))) = meet(X1,join(X2,join(meet(X1,X3),meet(X3,join(X2,X4))))),
equation_H49 ).
cnf(c_0_23,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_25,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,plain,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
c_0_19 ).
cnf(c_0_27,plain,
meet(X1,zero) = zero,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_29,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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_16]),c_0_23]),c_0_24]),c_0_25]) ).
cnf(c_0_30,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_31,plain,
( complement(X1) = X2
| meet(X2,X1) != zero
| join(X1,X2) != one ),
inference(spm,[status(thm)],[c_0_26,c_0_18]) ).
cnf(c_0_32,plain,
meet(X1,meet(X2,complement(meet(X1,X2)))) = zero,
inference(spm,[status(thm)],[c_0_21,c_0_13]) ).
cnf(c_0_33,plain,
meet(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_27,c_0_18]) ).
cnf(c_0_34,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_24]) ).
cnf(c_0_35,plain,
meet(complement(X1),join(X1,meet(X2,complement(X1)))) = meet(complement(X1),join(X1,X2)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_21]),c_0_24]),c_0_16])]) ).
cnf(c_0_37,plain,
meet(X1,meet(X2,complement(meet(X2,X1)))) = zero,
inference(spm,[status(thm)],[c_0_32,c_0_18]) ).
cnf(c_0_38,plain,
meet(X1,meet(complement(X1),X2)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_21]),c_0_33]) ).
cnf(c_0_39,plain,
complement(zero) = one,
inference(spm,[status(thm)],[c_0_16,c_0_34]) ).
cnf(c_0_40,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_24]) ).
cnf(c_0_41,plain,
meet(X1,join(complement(X1),meet(X2,X1))) = meet(X1,join(complement(X1),X2)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,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_37,c_0_38]),c_0_39]),c_0_23]),c_0_13]) ).
cnf(c_0_43,plain,
meet(one,X1) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_18]) ).
cnf(c_0_44,plain,
meet(X1,meet(join(X2,X1),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_13,c_0_40]) ).
cnf(c_0_45,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_41,c_0_42]),c_0_28]),c_0_21]),c_0_13]),c_0_24]) ).
cnf(c_0_46,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_47,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_15,c_0_43]) ).
cnf(c_0_48,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_44,c_0_45]),c_0_40]),c_0_24]) ).
cnf(c_0_49,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_16]),c_0_47]) ).
cnf(c_0_50,plain,
meet(X1,join(complement(X1),meet(X1,X2))) = meet(X1,join(complement(X1),X2)),
inference(spm,[status(thm)],[c_0_41,c_0_18]) ).
cnf(c_0_51,plain,
join(complement(X1),complement(join(X2,X1))) = complement(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_48]),c_0_49])]) ).
cnf(c_0_52,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_50,c_0_32]),c_0_28]),c_0_21]) ).
cnf(c_0_53,plain,
meet(complement(X1),complement(join(X2,X1))) = complement(join(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_51]),c_0_18]) ).
cnf(c_0_54,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_26,c_0_52]),c_0_49])]) ).
cnf(c_0_55,plain,
meet(complement(X1),complement(meet(X1,X2))) = complement(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_17]),c_0_18]) ).
cnf(c_0_56,plain,
join(X1,meet(X2,complement(meet(complement(X1),X2)))) = X1,
inference(spm,[status(thm)],[c_0_54,c_0_36]) ).
cnf(c_0_57,plain,
meet(X1,complement(meet(complement(X1),X2))) = X1,
inference(spm,[status(thm)],[c_0_55,c_0_36]) ).
cnf(c_0_58,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_59,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_56,c_0_37]),c_0_39]),c_0_23]) ).
cnf(c_0_60,plain,
meet(X1,complement(meet(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_61,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_62,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_40,c_0_59]),c_0_13]),c_0_18]),c_0_60]) ).
cnf(c_0_63,plain,
join(complement(X1),complement(meet(X1,X2))) = complement(meet(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_17]),c_0_24]) ).
cnf(c_0_64,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_61,c_0_45]),c_0_15]),c_0_24]) ).
cnf(c_0_65,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_50,c_0_62]),c_0_50]),c_0_63]),c_0_62]) ).
cnf(c_0_66,plain,
join(complement(X1),complement(join(X1,X2))) = complement(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_64]),c_0_49])]) ).
cnf(c_0_67,plain,
meet(X1,complement(meet(X1,X2))) = meet(X1,complement(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_62]),c_0_20]) ).
cnf(c_0_68,plain,
meet(complement(X1),join(X1,X2)) = meet(complement(X1),X2),
inference(spm,[status(thm)],[c_0_65,c_0_36]) ).
cnf(c_0_69,plain,
meet(complement(X1),complement(join(X1,X2))) = complement(join(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_66]),c_0_18]) ).
cnf(c_0_70,plain,
complement(join(X1,X2)) = meet(complement(X1),complement(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_67]),c_0_69]) ).
cnf(c_0_71,plain,
complement(meet(complement(X1),complement(X2))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_36,c_0_70]) ).
cnf(c_0_72,plain,
complement(meet(complement(X1),X2)) = join(X1,complement(X2)),
inference(spm,[status(thm)],[c_0_71,c_0_36]) ).
cnf(c_0_73,plain,
complement(meet(X1,X2)) = join(complement(X1),complement(X2)),
inference(spm,[status(thm)],[c_0_72,c_0_36]) ).
cnf(c_0_74,plain,
join(X1,meet(complement(X1),complement(X2))) = join(X1,complement(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_68]),c_0_73]),c_0_36]),c_0_36]),c_0_70]) ).
cnf(c_0_75,plain,
join(X1,meet(complement(X1),X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_74,c_0_36]) ).
cnf(c_0_76,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_65]),c_0_13]) ).
cnf(c_0_77,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_15]),c_0_46]) ).
cnf(c_0_78,plain,
join(X1,meet(join(X1,X2),X3)) = join(X1,meet(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_75]),c_0_36]) ).
cnf(c_0_79,plain,
meet(X1,meet(X2,join(X3,X1))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_44,c_0_18]) ).
cnf(c_0_80,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_46,c_0_77]),c_0_46]),c_0_46]) ).
cnf(c_0_81,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_25,c_0_61]),c_0_24]) ).
cnf(c_0_82,plain,
join(X1,meet(X2,join(X1,X3))) = join(X1,meet(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_58]),c_0_79]) ).
cnf(c_0_83,plain,
meet(X1,join(X2,join(complement(X1),X3))) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_80]),c_0_65]) ).
cnf(c_0_84,plain,
meet(join(X1,X2),join(X1,X3)) = join(X1,meet(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_15]),c_0_82]),c_0_82]) ).
cnf(c_0_85,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_83,c_0_75]),c_0_83]),c_0_36]) ).
cnf(c_0_86,negated_conjecture,
meet(a,join(b,c)) != join(meet(a,b),meet(a,c)),
inference(fof_simplification,[status(thm)],[prove_distributivity]) ).
cnf(c_0_87,plain,
meet(join(X1,X2),join(X2,X3)) = join(X2,meet(X1,X3)),
inference(spm,[status(thm)],[c_0_84,c_0_24]) ).
cnf(c_0_88,plain,
meet(X1,join(meet(X1,X2),X3)) = meet(X1,join(X3,X2)),
inference(spm,[status(thm)],[c_0_85,c_0_24]) ).
cnf(c_0_89,negated_conjecture,
meet(a,join(b,c)) != join(meet(a,b),meet(a,c)),
c_0_86 ).
cnf(c_0_90,plain,
join(meet(X1,X2),meet(X1,X3)) = meet(X1,join(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_17]),c_0_88]) ).
cnf(c_0_91,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_90]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LAT199-1 : TPTP v8.1.2. Released v3.1.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n008.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri May 3 08:21:12 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 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.BddpZLrgHA/E---3.1_26442.p
% 3.59/0.92 # Version: 3.1.0
% 3.59/0.92 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.59/0.92 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.59/0.92 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.59/0.92 # Starting new_bool_3 with 300s (1) cores
% 3.59/0.92 # Starting new_bool_1 with 300s (1) cores
% 3.59/0.92 # Starting sh5l with 300s (1) cores
% 3.59/0.92 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 26520 completed with status 0
% 3.59/0.92 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 3.59/0.92 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.59/0.92 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.59/0.92 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.59/0.92 # No SInE strategy applied
% 3.59/0.92 # Search class: FHUPM-FFSF21-MFFFFFNN
% 3.59/0.92 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.59/0.92 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 3.59/0.92 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.59/0.92 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 3.59/0.92 # Starting new_bool_3 with 136s (1) cores
% 3.59/0.92 # Starting new_bool_1 with 136s (1) cores
% 3.59/0.92 # G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with pid 26524 completed with status 0
% 3.59/0.92 # Result found by G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 3.59/0.92 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.59/0.92 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.59/0.92 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.59/0.92 # No SInE strategy applied
% 3.59/0.92 # Search class: FHUPM-FFSF21-MFFFFFNN
% 3.59/0.92 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.59/0.92 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 3.59/0.92 # Preprocessing time : 0.001 s
% 3.59/0.92 # Presaturation interreduction done
% 3.59/0.92
% 3.59/0.92 # Proof found!
% 3.59/0.92 # SZS status Unsatisfiable
% 3.59/0.92 # SZS output start CNFRefutation
% See solution above
% 3.59/0.92 # Parsed axioms : 13
% 3.59/0.92 # Removed by relevancy pruning/SinE : 0
% 3.59/0.92 # Initial clauses : 13
% 3.59/0.92 # Removed in clause preprocessing : 0
% 3.59/0.92 # Initial clauses in saturation : 13
% 3.59/0.92 # Processed clauses : 2624
% 3.59/0.92 # ...of these trivial : 592
% 3.59/0.92 # ...subsumed : 1677
% 3.59/0.92 # ...remaining for further processing : 355
% 3.59/0.92 # Other redundant clauses eliminated : 0
% 3.59/0.92 # Clauses deleted for lack of memory : 0
% 3.59/0.92 # Backward-subsumed : 0
% 3.59/0.92 # Backward-rewritten : 101
% 3.59/0.92 # Generated clauses : 35091
% 3.59/0.92 # ...of the previous two non-redundant : 21675
% 3.59/0.92 # ...aggressively subsumed : 0
% 3.59/0.92 # Contextual simplify-reflections : 0
% 3.59/0.92 # Paramodulations : 35066
% 3.59/0.92 # Factorizations : 0
% 3.59/0.92 # NegExts : 0
% 3.59/0.92 # Equation resolutions : 25
% 3.59/0.92 # Disequality decompositions : 0
% 3.59/0.92 # Total rewrite steps : 74693
% 3.59/0.92 # ...of those cached : 60970
% 3.59/0.92 # Propositional unsat checks : 0
% 3.59/0.92 # Propositional check models : 0
% 3.59/0.92 # Propositional check unsatisfiable : 0
% 3.59/0.92 # Propositional clauses : 0
% 3.59/0.92 # Propositional clauses after purity: 0
% 3.59/0.92 # Propositional unsat core size : 0
% 3.59/0.92 # Propositional preprocessing time : 0.000
% 3.59/0.92 # Propositional encoding time : 0.000
% 3.59/0.92 # Propositional solver time : 0.000
% 3.59/0.92 # Success case prop preproc time : 0.000
% 3.59/0.92 # Success case prop encoding time : 0.000
% 3.59/0.92 # Success case prop solver time : 0.000
% 3.59/0.92 # Current number of processed clauses : 241
% 3.59/0.92 # Positive orientable unit clauses : 126
% 3.59/0.92 # Positive unorientable unit clauses: 9
% 3.59/0.92 # Negative unit clauses : 0
% 3.59/0.92 # Non-unit-clauses : 106
% 3.59/0.92 # Current number of unprocessed clauses: 18616
% 3.59/0.92 # ...number of literals in the above : 22907
% 3.59/0.92 # Current number of archived formulas : 0
% 3.59/0.92 # Current number of archived clauses : 114
% 3.59/0.92 # Clause-clause subsumption calls (NU) : 9696
% 3.59/0.92 # Rec. Clause-clause subsumption calls : 9547
% 3.59/0.92 # Non-unit clause-clause subsumptions : 1287
% 3.59/0.92 # Unit Clause-clause subsumption calls : 123
% 3.59/0.92 # Rewrite failures with RHS unbound : 0
% 3.59/0.92 # BW rewrite match attempts : 1296
% 3.59/0.92 # BW rewrite match successes : 418
% 3.59/0.92 # Condensation attempts : 0
% 3.59/0.92 # Condensation successes : 0
% 3.59/0.92 # Termbank termtop insertions : 460432
% 3.59/0.92 # Search garbage collected termcells : 8
% 3.59/0.92
% 3.59/0.92 # -------------------------------------------------
% 3.59/0.92 # User time : 0.423 s
% 3.59/0.92 # System time : 0.025 s
% 3.59/0.92 # Total time : 0.448 s
% 3.59/0.92 # Maximum resident set size: 1644 pages
% 3.59/0.92
% 3.59/0.92 # -------------------------------------------------
% 3.59/0.92 # User time : 2.190 s
% 3.59/0.92 # System time : 0.056 s
% 3.59/0.92 # Total time : 2.246 s
% 3.59/0.92 # Maximum resident set size: 1696 pages
% 3.59/0.92 % E---3.1 exiting
% 3.59/0.92 % E exiting
%------------------------------------------------------------------------------