TSTP Solution File: LAT066-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LAT066-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:09:23 EDT 2023
% Result : Unsatisfiable 0.16s 0.73s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 13
% Syntax : Number of clauses : 90 ( 87 unt; 0 nHn; 7 RR)
% Number of literals : 96 ( 95 equ; 8 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 : 178 ( 24 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.XZc9abuApz/E---3.1_5395.p',associativity_of_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.XZc9abuApz/E---3.1_5395.p',idempotence_of_meet) ).
cnf(bottom,axiom,
meet(X1,complement(X1)) = n0,
file('/export/starexec/sandbox/tmp/tmp.XZc9abuApz/E---3.1_5395.p',bottom) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.XZc9abuApz/E---3.1_5395.p',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.XZc9abuApz/E---3.1_5395.p',commutativity_of_meet) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.XZc9abuApz/E---3.1_5395.p',commutativity_of_join) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.XZc9abuApz/E---3.1_5395.p',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.XZc9abuApz/E---3.1_5395.p',idempotence_of_join) ).
cnf(top,axiom,
join(X1,complement(X1)) = n1,
file('/export/starexec/sandbox/tmp/tmp.XZc9abuApz/E---3.1_5395.p',top) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.XZc9abuApz/E---3.1_5395.p',absorption1) ).
cnf(g61,axiom,
meet(X1,join(X2,join(X3,meet(X4,join(X1,meet(X2,X3)))))) = meet(X1,join(X2,join(X3,meet(X1,X4)))),
file('/export/starexec/sandbox/tmp/tmp.XZc9abuApz/E---3.1_5395.p',g61) ).
cnf(complements_are_unique,axiom,
( complement(X1) = X2
| join(X1,X2) != n1
| meet(X1,X2) != n0 ),
file('/export/starexec/sandbox/tmp/tmp.XZc9abuApz/E---3.1_5395.p',complements_are_unique) ).
cnf(prove_distributivity,negated_conjecture,
meet(a,join(b,c)) != join(meet(a,b),meet(a,c)),
file('/export/starexec/sandbox/tmp/tmp.XZc9abuApz/E---3.1_5395.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,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,axiom,
meet(X1,complement(X1)) = n0,
bottom ).
cnf(c_0_17,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_18,plain,
meet(X1,n0) = n0,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_20,plain,
join(X1,n0) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_21,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_22,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_23,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_24,plain,
meet(X1,meet(X2,complement(meet(X1,X2)))) = n0,
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_25,plain,
meet(n0,X1) = n0,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,axiom,
join(X1,complement(X1)) = n1,
top ).
cnf(c_0_27,plain,
join(n0,X1) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_29,axiom,
meet(X1,join(X2,join(X3,meet(X4,join(X1,meet(X2,X3)))))) = meet(X1,join(X2,join(X3,meet(X1,X4)))),
g61 ).
cnf(c_0_30,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,plain,
meet(X1,meet(X2,complement(meet(X2,X1)))) = n0,
inference(spm,[status(thm)],[c_0_24,c_0_19]) ).
cnf(c_0_32,plain,
meet(X1,meet(complement(X1),X2)) = n0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_16]),c_0_25]) ).
cnf(c_0_33,plain,
complement(n0) = n1,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,plain,
meet(X1,n1) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_26]) ).
cnf(c_0_35,plain,
meet(X1,join(X2,meet(X3,join(X1,X2)))) = meet(X1,join(X2,meet(X1,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_14]),c_0_30]),c_0_30]) ).
cnf(c_0_36,plain,
meet(complement(X1),meet(X2,X1)) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34]),c_0_13]) ).
cnf(c_0_37,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_21]) ).
cnf(c_0_38,plain,
meet(n1,X1) = X1,
inference(spm,[status(thm)],[c_0_34,c_0_19]) ).
cnf(c_0_39,plain,
meet(X1,join(complement(X1),meet(X1,X2))) = meet(X1,join(complement(X1),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_26]),c_0_34]) ).
cnf(c_0_40,plain,
meet(X1,complement(join(X2,X1))) = n0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_19]) ).
cnf(c_0_41,plain,
join(n1,X1) = n1,
inference(spm,[status(thm)],[c_0_28,c_0_38]) ).
cnf(c_0_42,axiom,
( complement(X1) = X2
| join(X1,X2) != n1
| meet(X1,X2) != n0 ),
complements_are_unique ).
cnf(c_0_43,plain,
meet(X1,join(complement(X1),complement(join(X2,X1)))) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_20]),c_0_16]) ).
cnf(c_0_44,plain,
join(X1,join(complement(X1),X2)) = n1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_26]),c_0_41]) ).
cnf(c_0_45,plain,
join(complement(X1),complement(join(X2,X1))) = complement(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_46,plain,
meet(X1,join(complement(X1),meet(X2,complement(meet(X1,X2))))) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_24]),c_0_20]),c_0_16]) ).
cnf(c_0_47,plain,
( complement(X1) = X2
| meet(X2,X1) != n0
| join(X1,X2) != n1 ),
inference(spm,[status(thm)],[c_0_42,c_0_19]) ).
cnf(c_0_48,plain,
meet(complement(X1),complement(join(X2,X1))) = complement(join(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_45]),c_0_19]) ).
cnf(c_0_49,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_42,c_0_46]),c_0_44])]) ).
cnf(c_0_50,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_16]),c_0_21]),c_0_26])]) ).
cnf(c_0_51,plain,
meet(complement(X1),complement(meet(X1,X2))) = complement(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_17]),c_0_19]) ).
cnf(c_0_52,plain,
meet(X1,complement(join(X1,X2))) = n0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_28]),c_0_19]) ).
cnf(c_0_53,plain,
join(X1,meet(X2,complement(meet(complement(X1),X2)))) = X1,
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,plain,
meet(X1,complement(meet(complement(X1),X2))) = X1,
inference(spm,[status(thm)],[c_0_51,c_0_50]) ).
cnf(c_0_55,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_56,plain,
meet(X1,join(complement(X1),complement(join(X1,X2)))) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_52]),c_0_20]),c_0_16]) ).
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_53,c_0_31]),c_0_33]),c_0_34]) ).
cnf(c_0_58,plain,
meet(X1,complement(meet(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,plain,
join(complement(X1),complement(join(X1,X2))) = complement(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_56]),c_0_44])]) ).
cnf(c_0_60,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_37,c_0_57]),c_0_13]),c_0_19]),c_0_58]) ).
cnf(c_0_61,plain,
join(complement(X1),complement(meet(X1,X2))) = complement(meet(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_17]),c_0_21]) ).
cnf(c_0_62,plain,
join(X1,complement(join(complement(X1),X2))) = X1,
inference(spm,[status(thm)],[c_0_59,c_0_50]) ).
cnf(c_0_63,plain,
meet(X1,complement(meet(X1,X2))) = meet(X1,complement(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_60]),c_0_15]) ).
cnf(c_0_64,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_39,c_0_60]),c_0_39]),c_0_61]),c_0_60]) ).
cnf(c_0_65,plain,
meet(X1,complement(join(complement(X1),X2))) = complement(join(complement(X1),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_62]),c_0_19]) ).
cnf(c_0_66,plain,
complement(join(complement(X1),X2)) = meet(X1,complement(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_63]),c_0_65]) ).
cnf(c_0_67,plain,
complement(join(X1,X2)) = meet(complement(X1),complement(X2)),
inference(spm,[status(thm)],[c_0_66,c_0_50]) ).
cnf(c_0_68,plain,
complement(meet(X1,complement(X2))) = join(complement(X1),X2),
inference(spm,[status(thm)],[c_0_50,c_0_66]) ).
cnf(c_0_69,plain,
meet(X1,join(complement(X2),meet(X1,X2))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_49]),c_0_50]),c_0_50]),c_0_68]) ).
cnf(c_0_70,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_71,plain,
meet(X1,join(complement(X2),meet(X2,X1))) = X1,
inference(spm,[status(thm)],[c_0_69,c_0_19]) ).
cnf(c_0_72,plain,
join(complement(X1),meet(X1,X2)) = join(complement(X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_22]),c_0_21]),c_0_70]) ).
cnf(c_0_73,plain,
meet(complement(X1),join(X1,X2)) = meet(complement(X1),X2),
inference(spm,[status(thm)],[c_0_64,c_0_50]) ).
cnf(c_0_74,plain,
join(X1,meet(complement(X1),X2)) = join(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_50]),c_0_50]),c_0_30]) ).
cnf(c_0_75,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_64]),c_0_13]) ).
cnf(c_0_76,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_74,c_0_75]),c_0_74]),c_0_50]) ).
cnf(c_0_77,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_28]),c_0_22]) ).
cnf(c_0_78,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_13,c_0_28]) ).
cnf(c_0_79,plain,
join(X1,meet(join(X2,X1),X3)) = join(X1,meet(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_76]) ).
cnf(c_0_80,plain,
meet(X1,meet(X2,join(X1,X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_78,c_0_19]) ).
cnf(c_0_81,plain,
meet(X1,join(X2,join(X3,meet(X4,join(X1,X2))))) = meet(X1,join(X2,join(X3,meet(X1,X4)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_28]),c_0_22]),c_0_22]),c_0_30]),c_0_30]) ).
cnf(c_0_82,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_70,c_0_78]),c_0_21]) ).
cnf(c_0_83,plain,
join(X1,meet(X2,join(X3,X1))) = join(X1,meet(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_55]),c_0_80]) ).
cnf(c_0_84,plain,
meet(X1,join(X2,meet(X1,X3))) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_64]),c_0_26]),c_0_34]),c_0_64]) ).
cnf(c_0_85,plain,
meet(join(X1,X2),join(X3,X1)) = join(X1,meet(X3,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_37]),c_0_76]),c_0_83]) ).
cnf(c_0_86,plain,
meet(X1,join(meet(X1,X2),X3)) = meet(X1,join(X3,X2)),
inference(spm,[status(thm)],[c_0_84,c_0_21]) ).
cnf(c_0_87,negated_conjecture,
meet(a,join(b,c)) != join(meet(a,b),meet(a,c)),
prove_distributivity ).
cnf(c_0_88,plain,
join(meet(X1,X2),meet(X1,X3)) = meet(X1,join(X3,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_17]),c_0_19]),c_0_86]) ).
cnf(c_0_89,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_88]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : LAT066-1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n025.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % 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 10:34:51 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running first-order model finding
% 0.16/0.42 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.XZc9abuApz/E---3.1_5395.p
% 0.16/0.73 # Version: 3.1pre001
% 0.16/0.73 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.73 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.73 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.73 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.73 # Starting sh5l with 300s (1) cores
% 0.16/0.73 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 5476 completed with status 0
% 0.16/0.73 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.16/0.73 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.73 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.73 # No SInE strategy applied
% 0.16/0.73 # Search class: FHUPM-FFSF21-DFFFFFNN
% 0.16/0.73 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.73 # Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 0.16/0.73 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.16/0.73 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.73 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.73 # Starting G-E--_303_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.16/0.73 # E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with pid 5482 completed with status 0
% 0.16/0.73 # Result found by E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 0.16/0.73 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.73 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.73 # No SInE strategy applied
% 0.16/0.73 # Search class: FHUPM-FFSF21-DFFFFFNN
% 0.16/0.73 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.73 # Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 0.16/0.73 # Preprocessing time : 0.001 s
% 0.16/0.73 # Presaturation interreduction done
% 0.16/0.73
% 0.16/0.73 # Proof found!
% 0.16/0.73 # SZS status Unsatisfiable
% 0.16/0.73 # SZS output start CNFRefutation
% See solution above
% 0.16/0.73 # Parsed axioms : 13
% 0.16/0.73 # Removed by relevancy pruning/SinE : 0
% 0.16/0.73 # Initial clauses : 13
% 0.16/0.73 # Removed in clause preprocessing : 0
% 0.16/0.73 # Initial clauses in saturation : 13
% 0.16/0.73 # Processed clauses : 2387
% 0.16/0.73 # ...of these trivial : 518
% 0.16/0.73 # ...subsumed : 1535
% 0.16/0.73 # ...remaining for further processing : 334
% 0.16/0.73 # Other redundant clauses eliminated : 0
% 0.16/0.73 # Clauses deleted for lack of memory : 0
% 0.16/0.73 # Backward-subsumed : 0
% 0.16/0.73 # Backward-rewritten : 83
% 0.16/0.73 # Generated clauses : 27859
% 0.16/0.73 # ...of the previous two non-redundant : 15821
% 0.16/0.73 # ...aggressively subsumed : 0
% 0.16/0.73 # Contextual simplify-reflections : 0
% 0.16/0.73 # Paramodulations : 27834
% 0.16/0.73 # Factorizations : 0
% 0.16/0.73 # NegExts : 0
% 0.16/0.73 # Equation resolutions : 25
% 0.16/0.73 # Total rewrite steps : 64165
% 0.16/0.73 # Propositional unsat checks : 0
% 0.16/0.73 # Propositional check models : 0
% 0.16/0.73 # Propositional check unsatisfiable : 0
% 0.16/0.73 # Propositional clauses : 0
% 0.16/0.73 # Propositional clauses after purity: 0
% 0.16/0.73 # Propositional unsat core size : 0
% 0.16/0.73 # Propositional preprocessing time : 0.000
% 0.16/0.73 # Propositional encoding time : 0.000
% 0.16/0.73 # Propositional solver time : 0.000
% 0.16/0.73 # Success case prop preproc time : 0.000
% 0.16/0.73 # Success case prop encoding time : 0.000
% 0.16/0.73 # Success case prop solver time : 0.000
% 0.16/0.73 # Current number of processed clauses : 238
% 0.16/0.73 # Positive orientable unit clauses : 126
% 0.16/0.73 # Positive unorientable unit clauses: 6
% 0.16/0.73 # Negative unit clauses : 0
% 0.16/0.73 # Non-unit-clauses : 106
% 0.16/0.73 # Current number of unprocessed clauses: 13054
% 0.16/0.73 # ...number of literals in the above : 16378
% 0.16/0.73 # Current number of archived formulas : 0
% 0.16/0.73 # Current number of archived clauses : 96
% 0.16/0.73 # Clause-clause subsumption calls (NU) : 8628
% 0.16/0.73 # Rec. Clause-clause subsumption calls : 8492
% 0.16/0.73 # Non-unit clause-clause subsumptions : 1229
% 0.16/0.73 # Unit Clause-clause subsumption calls : 80
% 0.16/0.73 # Rewrite failures with RHS unbound : 0
% 0.16/0.73 # BW rewrite match attempts : 1001
% 0.16/0.73 # BW rewrite match successes : 394
% 0.16/0.73 # Condensation attempts : 0
% 0.16/0.73 # Condensation successes : 0
% 0.16/0.73 # Termbank termtop insertions : 352350
% 0.16/0.73
% 0.16/0.73 # -------------------------------------------------
% 0.16/0.73 # User time : 0.289 s
% 0.16/0.73 # System time : 0.009 s
% 0.16/0.73 # Total time : 0.298 s
% 0.16/0.73 # Maximum resident set size: 1592 pages
% 0.16/0.73
% 0.16/0.73 # -------------------------------------------------
% 0.16/0.73 # User time : 1.453 s
% 0.16/0.73 # System time : 0.048 s
% 0.16/0.73 # Total time : 1.502 s
% 0.16/0.73 # Maximum resident set size: 1676 pages
% 0.16/0.73 % E---3.1 exiting
%------------------------------------------------------------------------------