TSTP Solution File: LAT256-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT256-1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:10 EDT 2023
% Result : Unsatisfiable 64.07s 8.66s
% Output : CNFRefutation 64.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 14
% Syntax : Number of clauses : 88 ( 83 unt; 0 nHn; 30 RR)
% Number of literals : 96 ( 95 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 9 ( 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 : 123 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.GBS1IOMUSB/E---3.1_14377.p',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.GBS1IOMUSB/E---3.1_14377.p',idempotence_of_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.GBS1IOMUSB/E---3.1_14377.p',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.GBS1IOMUSB/E---3.1_14377.p',commutativity_of_meet) ).
cnf(prove_distributivity_hypothesis,hypothesis,
meet(b,a) = a,
file('/export/starexec/sandbox2/tmp/tmp.GBS1IOMUSB/E---3.1_14377.p',prove_distributivity_hypothesis) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox2/tmp/tmp.GBS1IOMUSB/E---3.1_14377.p',complement_join) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.GBS1IOMUSB/E---3.1_14377.p',commutativity_of_join) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.GBS1IOMUSB/E---3.1_14377.p',absorption1) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox2/tmp/tmp.GBS1IOMUSB/E---3.1_14377.p',complement_meet) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.GBS1IOMUSB/E---3.1_14377.p',associativity_of_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.GBS1IOMUSB/E---3.1_14377.p',idempotence_of_meet) ).
cnf(equation_H81,axiom,
meet(X1,join(meet(X1,X2),meet(X3,join(X1,meet(X2,join(X1,X3)))))) = meet(X1,join(meet(X1,X2),meet(X1,X3))),
file('/export/starexec/sandbox2/tmp/tmp.GBS1IOMUSB/E---3.1_14377.p',equation_H81) ).
cnf(meet_join_complement,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
file('/export/starexec/sandbox2/tmp/tmp.GBS1IOMUSB/E---3.1_14377.p',meet_join_complement) ).
cnf(prove_distributivity,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
file('/export/starexec/sandbox2/tmp/tmp.GBS1IOMUSB/E---3.1_14377.p',prove_distributivity) ).
cnf(c_0_14,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_15,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_16,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_17,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_18,hypothesis,
meet(b,a) = a,
prove_distributivity_hypothesis ).
cnf(c_0_19,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_21,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_23,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_24,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,hypothesis,
join(a,b) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_26,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_27,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_28,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_29,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_30,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_23]),c_0_14]) ).
cnf(c_0_32,hypothesis,
join(a,join(b,X1)) = join(b,X1),
inference(spm,[status(thm)],[c_0_14,c_0_25]) ).
cnf(c_0_33,axiom,
meet(X1,join(meet(X1,X2),meet(X3,join(X1,meet(X2,join(X1,X3)))))) = meet(X1,join(meet(X1,X2),meet(X1,X3))),
equation_H81 ).
cnf(c_0_34,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_35,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_27]) ).
cnf(c_0_36,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_20]),c_0_30]) ).
cnf(c_0_38,hypothesis,
join(a,join(X1,b)) = join(X1,b),
inference(spm,[status(thm)],[c_0_31,c_0_25]) ).
cnf(c_0_39,hypothesis,
meet(a,join(b,X1)) = a,
inference(spm,[status(thm)],[c_0_26,c_0_32]) ).
cnf(c_0_40,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_19,c_0_23]) ).
cnf(c_0_41,plain,
meet(X1,join(meet(X1,X2),meet(complement(X1),join(X1,X2)))) = 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_33,c_0_20]),c_0_27]),c_0_34]),c_0_35]),c_0_36]) ).
cnf(c_0_42,hypothesis,
join(b,complement(a)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_23]) ).
cnf(c_0_43,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_35]) ).
cnf(c_0_44,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
meet_join_complement ).
cnf(c_0_45,plain,
meet(X1,meet(X2,join(meet(X1,meet(X2,X3)),meet(X4,join(meet(X1,X2),meet(X3,join(meet(X1,X2),X4))))))) = meet(X1,meet(X2,join(meet(X1,meet(X2,X3)),meet(X1,meet(X2,X4))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_33]),c_0_28]),c_0_28]),c_0_28]),c_0_28]) ).
cnf(c_0_46,hypothesis,
meet(a,join(X1,b)) = a,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_47,hypothesis,
meet(a,meet(b,X1)) = meet(a,X1),
inference(spm,[status(thm)],[c_0_28,c_0_22]) ).
cnf(c_0_48,hypothesis,
meet(b,join(complement(b),meet(b,complement(a)))) = meet(b,complement(a)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_34]),c_0_23]) ).
cnf(c_0_49,plain,
meet(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_16,c_0_43]) ).
cnf(c_0_50,plain,
meet(X1,meet(X2,X3)) = meet(X3,meet(X1,X2)),
inference(spm,[status(thm)],[c_0_17,c_0_28]) ).
cnf(c_0_51,plain,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X2,X1) != one ),
inference(spm,[status(thm)],[c_0_44,c_0_23]) ).
cnf(c_0_52,hypothesis,
meet(X1,meet(X2,join(meet(X1,meet(X2,a)),meet(b,join(a,meet(X1,X2)))))) = meet(X1,meet(X2,join(meet(X1,meet(X2,a)),meet(X1,meet(X2,b))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_23]) ).
cnf(c_0_53,hypothesis,
meet(a,join(complement(b),meet(b,complement(a)))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_47]),c_0_27]) ).
cnf(c_0_54,plain,
meet(X1,zero) = zero,
inference(spm,[status(thm)],[c_0_17,c_0_49]) ).
cnf(c_0_55,plain,
meet(X1,meet(X2,meet(X1,X3))) = meet(X2,meet(X1,X3)),
inference(spm,[status(thm)],[c_0_36,c_0_50]) ).
cnf(c_0_56,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_57,plain,
meet(X1,join(meet(X1,X2),meet(complement(X1),join(X2,X1)))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_41,c_0_23]) ).
cnf(c_0_58,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_20]),c_0_17]),c_0_27])]) ).
cnf(c_0_59,plain,
join(X1,join(X2,meet(join(X1,X2),X3))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_60,plain,
join(meet(X1,X2),meet(X1,meet(X2,X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_16,c_0_28]) ).
cnf(c_0_61,hypothesis,
meet(b,meet(join(a,meet(b,complement(a))),join(complement(b),meet(b,complement(a))))) = meet(b,complement(a)),
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(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_52,c_0_48]),c_0_17]),c_0_53]),c_0_54]),c_0_43]),c_0_55]),c_0_17]),c_0_53]),c_0_54]),c_0_17]),c_0_48]),c_0_36]),c_0_43]),c_0_17]),c_0_56]),c_0_36]),c_0_17]),c_0_28]) ).
cnf(c_0_62,plain,
meet(X1,join(meet(X2,X1),meet(complement(X1),join(X1,X2)))) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_41,c_0_17]) ).
cnf(c_0_63,hypothesis,
meet(complement(a),join(a,meet(b,complement(a)))) = meet(b,complement(a)),
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_57,c_0_42]),c_0_17]),c_0_58]),c_0_34]),c_0_17]),c_0_23]) ).
cnf(c_0_64,plain,
join(X1,join(X2,meet(X3,join(X1,X2)))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_59,c_0_17]) ).
cnf(c_0_65,hypothesis,
join(meet(b,complement(a)),meet(b,join(a,meet(b,complement(a))))) = meet(b,join(a,meet(b,complement(a)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_23]) ).
cnf(c_0_66,plain,
join(X1,join(X2,complement(join(X1,X2)))) = one,
inference(spm,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_67,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_28,c_0_26]) ).
cnf(c_0_68,hypothesis,
meet(join(a,meet(b,complement(a))),join(meet(b,complement(a)),complement(join(a,meet(b,complement(a)))))) = meet(b,complement(a)),
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_14]),c_0_23]),c_0_21]),c_0_20]),c_0_34]) ).
cnf(c_0_69,plain,
join(X1,join(meet(X1,X2),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_70,hypothesis,
join(a,meet(b,join(a,meet(b,complement(a))))) = join(a,meet(b,complement(a))),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_71,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_17]),c_0_28]) ).
cnf(c_0_72,plain,
( join(X1,complement(join(X2,X1))) = complement(X2)
| meet(X2,join(X1,complement(join(X2,X1)))) != zero ),
inference(spm,[status(thm)],[c_0_44,c_0_66]) ).
cnf(c_0_73,hypothesis,
meet(a,join(meet(b,complement(a)),complement(join(a,meet(b,complement(a)))))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_47]),c_0_27]) ).
cnf(c_0_74,plain,
join(X1,join(X2,join(meet(X1,X3),X4))) = join(X2,join(X1,X4)),
inference(spm,[status(thm)],[c_0_31,c_0_69]) ).
cnf(c_0_75,hypothesis,
join(a,join(meet(b,join(a,meet(b,complement(a)))),complement(join(a,meet(b,complement(a)))))) = one,
inference(spm,[status(thm)],[c_0_66,c_0_70]) ).
cnf(c_0_76,plain,
meet(X1,meet(X2,join(X3,X1))) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_71,c_0_56]) ).
cnf(c_0_77,hypothesis,
join(meet(b,complement(a)),complement(join(a,meet(b,complement(a))))) = complement(a),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_78,hypothesis,
join(b,complement(join(a,meet(b,complement(a))))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_24]),c_0_32]) ).
cnf(c_0_79,hypothesis,
meet(b,meet(complement(a),complement(join(a,meet(b,complement(a)))))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_68]),c_0_27]),c_0_17]),c_0_28]) ).
cnf(c_0_80,hypothesis,
meet(complement(a),complement(join(a,meet(b,complement(a))))) = complement(join(a,meet(b,complement(a)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_77]),c_0_17]) ).
cnf(c_0_81,hypothesis,
( join(a,meet(b,complement(a))) = b
| meet(b,complement(join(a,meet(b,complement(a))))) != zero ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_78]),c_0_58]),c_0_17]) ).
cnf(c_0_82,hypothesis,
meet(b,complement(join(a,meet(b,complement(a))))) = zero,
inference(rw,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_83,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
prove_distributivity ).
cnf(c_0_84,hypothesis,
join(complement(a),complement(join(a,meet(b,complement(a))))) = complement(a),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_77]),c_0_23]) ).
cnf(c_0_85,hypothesis,
join(a,meet(b,complement(a))) = b,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_82])]) ).
cnf(c_0_86,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_83,c_0_23]) ).
cnf(c_0_87,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : LAT256-1 : TPTP v8.1.2. Released v3.1.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n013.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 10:19:29 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.44 Running first-order theorem proving
% 0.16/0.44 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/tmp/tmp.GBS1IOMUSB/E---3.1_14377.p
% 64.07/8.66 # Version: 3.1pre001
% 64.07/8.66 # Preprocessing class: FSSSSMSSSSSNFFN.
% 64.07/8.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 64.07/8.66 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 64.07/8.66 # Starting new_bool_3 with 300s (1) cores
% 64.07/8.66 # Starting new_bool_1 with 300s (1) cores
% 64.07/8.66 # Starting sh5l with 300s (1) cores
% 64.07/8.66 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 14501 completed with status 0
% 64.07/8.66 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 64.07/8.66 # Preprocessing class: FSSSSMSSSSSNFFN.
% 64.07/8.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 64.07/8.66 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 64.07/8.66 # No SInE strategy applied
% 64.07/8.66 # Search class: FHUPM-FFSF21-DFFFFFNN
% 64.07/8.66 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 64.07/8.66 # Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 64.07/8.66 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 64.07/8.66 # Starting new_bool_3 with 136s (1) cores
% 64.07/8.66 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 64.07/8.66 # Starting G-E--_303_C18_F1_URBAN_S0Y with 136s (1) cores
% 64.07/8.66 # G-E--_303_C18_F1_URBAN_S0Y with pid 14510 completed with status 0
% 64.07/8.66 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 64.07/8.66 # Preprocessing class: FSSSSMSSSSSNFFN.
% 64.07/8.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 64.07/8.66 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 64.07/8.66 # No SInE strategy applied
% 64.07/8.66 # Search class: FHUPM-FFSF21-DFFFFFNN
% 64.07/8.66 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 64.07/8.66 # Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 64.07/8.66 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 64.07/8.66 # Starting new_bool_3 with 136s (1) cores
% 64.07/8.66 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 64.07/8.66 # Starting G-E--_303_C18_F1_URBAN_S0Y with 136s (1) cores
% 64.07/8.66 # Preprocessing time : 0.001 s
% 64.07/8.66
% 64.07/8.66 # Proof found!
% 64.07/8.66 # SZS status Unsatisfiable
% 64.07/8.66 # SZS output start CNFRefutation
% See solution above
% 64.07/8.66 # Parsed axioms : 14
% 64.07/8.66 # Removed by relevancy pruning/SinE : 0
% 64.07/8.66 # Initial clauses : 14
% 64.07/8.66 # Removed in clause preprocessing : 0
% 64.07/8.66 # Initial clauses in saturation : 14
% 64.07/8.66 # Processed clauses : 5443
% 64.07/8.66 # ...of these trivial : 1109
% 64.07/8.66 # ...subsumed : 3617
% 64.07/8.66 # ...remaining for further processing : 717
% 64.07/8.66 # Other redundant clauses eliminated : 0
% 64.07/8.66 # Clauses deleted for lack of memory : 0
% 64.07/8.66 # Backward-subsumed : 62
% 64.07/8.66 # Backward-rewritten : 70
% 64.07/8.66 # Generated clauses : 338586
% 64.07/8.66 # ...of the previous two non-redundant : 249402
% 64.07/8.66 # ...aggressively subsumed : 0
% 64.07/8.66 # Contextual simplify-reflections : 4
% 64.07/8.66 # Paramodulations : 338583
% 64.07/8.66 # Factorizations : 0
% 64.07/8.66 # NegExts : 0
% 64.07/8.66 # Equation resolutions : 3
% 64.07/8.66 # Total rewrite steps : 978584
% 64.07/8.66 # Propositional unsat checks : 0
% 64.07/8.66 # Propositional check models : 0
% 64.07/8.66 # Propositional check unsatisfiable : 0
% 64.07/8.66 # Propositional clauses : 0
% 64.07/8.66 # Propositional clauses after purity: 0
% 64.07/8.66 # Propositional unsat core size : 0
% 64.07/8.66 # Propositional preprocessing time : 0.000
% 64.07/8.66 # Propositional encoding time : 0.000
% 64.07/8.66 # Propositional solver time : 0.000
% 64.07/8.66 # Success case prop preproc time : 0.000
% 64.07/8.66 # Success case prop encoding time : 0.000
% 64.07/8.66 # Success case prop solver time : 0.000
% 64.07/8.66 # Current number of processed clauses : 585
% 64.07/8.66 # Positive orientable unit clauses : 450
% 64.07/8.66 # Positive unorientable unit clauses: 8
% 64.07/8.66 # Negative unit clauses : 38
% 64.07/8.66 # Non-unit-clauses : 89
% 64.07/8.66 # Current number of unprocessed clauses: 243164
% 64.07/8.66 # ...number of literals in the above : 274988
% 64.07/8.66 # Current number of archived formulas : 0
% 64.07/8.66 # Current number of archived clauses : 132
% 64.07/8.66 # Clause-clause subsumption calls (NU) : 3331
% 64.07/8.66 # Rec. Clause-clause subsumption calls : 3146
% 64.07/8.66 # Non-unit clause-clause subsumptions : 330
% 64.07/8.66 # Unit Clause-clause subsumption calls : 489
% 64.07/8.66 # Rewrite failures with RHS unbound : 0
% 64.07/8.66 # BW rewrite match attempts : 16776
% 64.07/8.66 # BW rewrite match successes : 291
% 64.07/8.66 # Condensation attempts : 0
% 64.07/8.66 # Condensation successes : 0
% 64.07/8.66 # Termbank termtop insertions : 10888692
% 64.07/8.66
% 64.07/8.66 # -------------------------------------------------
% 64.07/8.66 # User time : 7.528 s
% 64.07/8.66 # System time : 0.337 s
% 64.07/8.66 # Total time : 7.865 s
% 64.07/8.66 # Maximum resident set size: 1596 pages
% 64.07/8.66
% 64.07/8.66 # -------------------------------------------------
% 64.07/8.66 # User time : 38.296 s
% 64.07/8.66 # System time : 1.275 s
% 64.07/8.66 # Total time : 39.570 s
% 64.07/8.66 # Maximum resident set size: 1680 pages
% 64.07/8.66 % E---3.1 exiting
% 64.07/8.66 % E---3.1 exiting
%------------------------------------------------------------------------------