TSTP Solution File: LAT010-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT010-1 : TPTP v8.1.2. Released v2.2.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:07:21 EDT 2023
% Result : Unsatisfiable 6.25s 1.27s
% Output : CNFRefutation 6.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of clauses : 67 ( 67 unt; 0 nHn; 8 RR)
% Number of literals : 67 ( 66 equ; 7 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 162 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.n2kALeEeI4/E---3.1_1774.p',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.n2kALeEeI4/E---3.1_1774.p',commutativity_of_meet) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.n2kALeEeI4/E---3.1_1774.p',absorption1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.n2kALeEeI4/E---3.1_1774.p',commutativity_of_join) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.n2kALeEeI4/E---3.1_1774.p',associativity_of_meet) ).
cnf(nr_3,hypothesis,
meet(join(X1,meet(X2,X3)),join(X3,meet(X1,X2))) = join(meet(X3,join(X1,meet(X2,X3))),meet(X1,join(X2,X3))),
file('/export/starexec/sandbox/tmp/tmp.n2kALeEeI4/E---3.1_1774.p',nr_3) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.n2kALeEeI4/E---3.1_1774.p',associativity_of_join) ).
cnf(n5_1,hypothesis,
meet(X1,join(X2,meet(X3,join(X1,X4)))) = join(meet(X1,join(X2,meet(X1,X3))),meet(X1,join(meet(X1,X2),meet(X3,X4)))),
file('/export/starexec/sandbox/tmp/tmp.n2kALeEeI4/E---3.1_1774.p',n5_1) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.n2kALeEeI4/E---3.1_1774.p',idempotence_of_meet) ).
cnf(prove_this,negated_conjecture,
meet(a,meet(join(b,c),join(b,d))) != meet(meet(a,meet(join(b,c),join(b,d))),join(meet(a,join(b,meet(c,d))),join(meet(a,c),meet(a,d)))),
file('/export/starexec/sandbox/tmp/tmp.n2kALeEeI4/E---3.1_1774.p',prove_this) ).
cnf(c_0_10,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_11,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_12,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_13,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_14,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_16,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,hypothesis,
meet(join(X1,meet(X2,X3)),join(X3,meet(X1,X2))) = join(meet(X3,join(X1,meet(X2,X3))),meet(X1,join(X2,X3))),
nr_3 ).
cnf(c_0_18,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_19,plain,
join(X1,meet(X2,meet(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,hypothesis,
meet(X1,join(X2,meet(X3,join(X1,X4)))) = join(meet(X1,join(X2,meet(X1,X3))),meet(X1,join(meet(X1,X2),meet(X3,X4)))),
n5_1 ).
cnf(c_0_21,plain,
meet(X1,meet(X2,X3)) = meet(X3,meet(X1,X2)),
inference(spm,[status(thm)],[c_0_11,c_0_15]) ).
cnf(c_0_22,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_11]),c_0_15]) ).
cnf(c_0_23,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_10]),c_0_11]) ).
cnf(c_0_24,hypothesis,
join(meet(X1,join(X2,X3)),meet(X3,join(X1,meet(X2,X3)))) = meet(join(X1,meet(X2,X3)),join(X3,meet(X1,X2))),
inference(rw,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_25,plain,
meet(X1,join(X2,join(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_18]) ).
cnf(c_0_26,plain,
join(X1,meet(X2,meet(X1,X3))) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_11]) ).
cnf(c_0_27,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_28,hypothesis,
meet(X1,meet(join(X2,meet(X3,join(X1,X4))),join(meet(X1,X2),meet(X3,X4)))) = meet(X1,join(meet(X1,X2),meet(X3,X4))),
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_16,c_0_20]),c_0_15]),c_0_21]),c_0_11]),c_0_22]),c_0_23]) ).
cnf(c_0_29,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_12]),c_0_13]) ).
cnf(c_0_30,hypothesis,
meet(X1,meet(join(X2,X3),meet(join(X1,meet(X2,X3)),join(X3,meet(X1,X2))))) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_24]),c_0_15]) ).
cnf(c_0_31,plain,
meet(X1,join(X2,join(X1,X3))) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_32,plain,
join(X1,join(X2,meet(X1,X3))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_18]) ).
cnf(c_0_33,hypothesis,
meet(X1,join(X2,meet(X1,X3))) = meet(X1,join(X3,X2)),
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_28,c_0_24]),c_0_29]),c_0_18]),c_0_10]),c_0_30]),c_0_27]) ).
cnf(c_0_34,hypothesis,
join(X1,meet(join(X1,X2),join(X1,meet(X3,join(X1,X2))))) = meet(join(X1,X2),join(X1,meet(X3,join(X1,X2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_31]),c_0_18]),c_0_32]),c_0_11]) ).
cnf(c_0_35,hypothesis,
meet(X1,join(X2,meet(X3,X1))) = meet(X1,join(X3,X2)),
inference(spm,[status(thm)],[c_0_33,c_0_11]) ).
cnf(c_0_36,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_37,hypothesis,
meet(X1,join(meet(X1,X2),X3)) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_23]),c_0_33]) ).
cnf(c_0_38,plain,
join(X1,join(X2,meet(X3,join(X1,X2)))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_39,hypothesis,
join(X1,meet(join(X1,X2),join(X3,X1))) = meet(join(X1,X2),join(X3,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_35]) ).
cnf(c_0_40,hypothesis,
join(meet(X1,X2),meet(X2,join(X3,meet(X1,X2)))) = meet(X2,join(meet(X1,X2),meet(X2,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_19]),c_0_15]),c_0_36]),c_0_13]) ).
cnf(c_0_41,hypothesis,
meet(X1,join(meet(X2,X1),X3)) = meet(X1,join(X2,X3)),
inference(spm,[status(thm)],[c_0_37,c_0_11]) ).
cnf(c_0_42,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_14,c_0_27]),c_0_13]) ).
cnf(c_0_43,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_14]),c_0_11]) ).
cnf(c_0_44,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_16]),c_0_13]) ).
cnf(c_0_45,hypothesis,
join(X1,meet(join(X2,X3),join(X1,X2))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,hypothesis,
join(meet(X1,X2),meet(X2,join(X1,X3))) = meet(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_33]),c_0_35]),c_0_35]) ).
cnf(c_0_47,negated_conjecture,
meet(a,meet(join(b,c),join(b,d))) != meet(meet(a,meet(join(b,c),join(b,d))),join(meet(a,join(b,meet(c,d))),join(meet(a,c),meet(a,d)))),
prove_this ).
cnf(c_0_48,hypothesis,
meet(join(X1,X2),X3) = meet(X3,join(X2,X1)),
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_43]),c_0_35]),c_0_18]),c_0_44]) ).
cnf(c_0_49,hypothesis,
meet(join(X1,X2),join(X3,X1)) = join(X1,meet(X3,join(X1,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_41]),c_0_46]),c_0_13]) ).
cnf(c_0_50,negated_conjecture,
meet(meet(a,meet(join(b,c),join(b,d))),join(join(meet(a,c),meet(a,d)),meet(a,join(b,meet(c,d))))) != meet(a,meet(join(b,c),join(b,d))),
inference(rw,[status(thm)],[c_0_47,c_0_13]) ).
cnf(c_0_51,hypothesis,
meet(join(X1,X2),join(X1,X3)) = join(X1,meet(X2,join(X1,X3))),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,hypothesis,
join(meet(X1,join(X2,X3)),meet(X2,join(X1,meet(X3,X2)))) = meet(join(X1,meet(X3,X2)),join(X2,meet(X1,X3))),
inference(spm,[status(thm)],[c_0_24,c_0_13]) ).
cnf(c_0_53,negated_conjecture,
meet(a,meet(join(b,c),meet(join(b,d),join(join(meet(a,c),meet(a,d)),meet(a,join(b,meet(c,d))))))) != meet(a,meet(join(b,c),join(b,d))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_15]),c_0_15]) ).
cnf(c_0_54,hypothesis,
join(X1,meet(X2,join(X1,X3))) = join(X1,meet(X3,join(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_13]),c_0_51]) ).
cnf(c_0_55,hypothesis,
meet(join(X1,meet(X2,X3)),join(X3,meet(X1,X2))) = join(meet(X1,join(X3,X2)),meet(X3,join(X2,X1))),
inference(rw,[status(thm)],[c_0_52,c_0_35]) ).
cnf(c_0_56,plain,
join(X1,join(X2,meet(X3,X1))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_12]),c_0_18]) ).
cnf(c_0_57,plain,
meet(X1,meet(X2,join(X3,X1))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_10]),c_0_15]) ).
cnf(c_0_58,negated_conjecture,
meet(a,meet(join(b,c),meet(join(b,d),join(meet(a,c),join(meet(a,d),meet(a,join(b,meet(c,d)))))))) != meet(a,meet(join(b,c),join(b,d))),
inference(spm,[status(thm)],[c_0_53,c_0_18]) ).
cnf(c_0_59,hypothesis,
join(X1,meet(X2,join(X1,X3))) = join(X1,meet(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]),c_0_15]),c_0_57]),c_0_32]) ).
cnf(c_0_60,negated_conjecture,
meet(a,meet(join(b,c),meet(join(b,d),join(meet(a,c),join(meet(a,d),meet(a,join(b,meet(c,d)))))))) != meet(a,join(b,meet(c,join(b,d)))),
inference(rw,[status(thm)],[c_0_58,c_0_51]) ).
cnf(c_0_61,hypothesis,
meet(join(X1,X2),join(X3,X1)) = join(X1,meet(X3,X2)),
inference(rw,[status(thm)],[c_0_49,c_0_59]) ).
cnf(c_0_62,negated_conjecture,
meet(a,meet(join(b,c),meet(join(b,d),join(meet(a,c),join(meet(a,d),meet(a,join(b,meet(c,d)))))))) != meet(a,join(b,meet(c,d))),
inference(rw,[status(thm)],[c_0_60,c_0_59]) ).
cnf(c_0_63,hypothesis,
join(meet(X1,X2),meet(X1,X3)) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_10]),c_0_11]),c_0_37]) ).
cnf(c_0_64,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_13]),c_0_18]) ).
cnf(c_0_65,hypothesis,
meet(join(X1,X2),join(X1,X3)) = join(X1,meet(X2,X3)),
inference(rw,[status(thm)],[c_0_51,c_0_59]) ).
cnf(c_0_66,negated_conjecture,
$false,
inference(cn,[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_62,c_0_63]),c_0_56]),c_0_63]),c_0_13]),c_0_64]),c_0_22]),c_0_65]),c_0_16]),c_0_22]),c_0_51]),c_0_59]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LAT010-1 : TPTP v8.1.2. Released v2.2.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n013.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 10:36:14 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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.n2kALeEeI4/E---3.1_1774.p
% 6.25/1.27 # Version: 3.1pre001
% 6.25/1.27 # Preprocessing class: FSMSSMSSSSSNFFN.
% 6.25/1.27 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.25/1.27 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.25/1.27 # Starting new_bool_3 with 300s (1) cores
% 6.25/1.27 # Starting new_bool_1 with 300s (1) cores
% 6.25/1.27 # Starting sh5l with 300s (1) cores
% 6.25/1.27 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1868 completed with status 0
% 6.25/1.27 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 6.25/1.27 # Preprocessing class: FSMSSMSSSSSNFFN.
% 6.25/1.27 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.25/1.27 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.25/1.27 # No SInE strategy applied
% 6.25/1.27 # Search class: FUUPM-FFSF22-MFFFFFNN
% 6.25/1.27 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 6.25/1.27 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 6.25/1.27 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 6.25/1.27 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 6.25/1.27 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 6.25/1.27 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 6.25/1.27 # G-E--_300_C01_F1_SE_CS_SP_S0Y with pid 1883 completed with status 0
% 6.25/1.27 # Result found by G-E--_300_C01_F1_SE_CS_SP_S0Y
% 6.25/1.27 # Preprocessing class: FSMSSMSSSSSNFFN.
% 6.25/1.27 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.25/1.27 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.25/1.27 # No SInE strategy applied
% 6.25/1.27 # Search class: FUUPM-FFSF22-MFFFFFNN
% 6.25/1.27 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 6.25/1.27 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 6.25/1.27 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 6.25/1.27 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 6.25/1.27 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 6.25/1.27 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 6.25/1.27 # Preprocessing time : 0.001 s
% 6.25/1.27
% 6.25/1.27 # Proof found!
% 6.25/1.27 # SZS status Unsatisfiable
% 6.25/1.27 # SZS output start CNFRefutation
% See solution above
% 6.25/1.27 # Parsed axioms : 12
% 6.25/1.27 # Removed by relevancy pruning/SinE : 0
% 6.25/1.27 # Initial clauses : 12
% 6.25/1.27 # Removed in clause preprocessing : 0
% 6.25/1.27 # Initial clauses in saturation : 12
% 6.25/1.27 # Processed clauses : 1752
% 6.25/1.27 # ...of these trivial : 587
% 6.25/1.27 # ...subsumed : 971
% 6.25/1.27 # ...remaining for further processing : 193
% 6.25/1.27 # Other redundant clauses eliminated : 0
% 6.25/1.27 # Clauses deleted for lack of memory : 0
% 6.25/1.27 # Backward-subsumed : 0
% 6.25/1.27 # Backward-rewritten : 75
% 6.25/1.27 # Generated clauses : 41877
% 6.25/1.27 # ...of the previous two non-redundant : 30169
% 6.25/1.27 # ...aggressively subsumed : 0
% 6.25/1.27 # Contextual simplify-reflections : 0
% 6.25/1.27 # Paramodulations : 41877
% 6.25/1.27 # Factorizations : 0
% 6.25/1.27 # NegExts : 0
% 6.25/1.27 # Equation resolutions : 0
% 6.25/1.27 # Total rewrite steps : 92854
% 6.25/1.27 # Propositional unsat checks : 0
% 6.25/1.27 # Propositional check models : 0
% 6.25/1.27 # Propositional check unsatisfiable : 0
% 6.25/1.27 # Propositional clauses : 0
% 6.25/1.27 # Propositional clauses after purity: 0
% 6.25/1.27 # Propositional unsat core size : 0
% 6.25/1.27 # Propositional preprocessing time : 0.000
% 6.25/1.27 # Propositional encoding time : 0.000
% 6.25/1.27 # Propositional solver time : 0.000
% 6.25/1.27 # Success case prop preproc time : 0.000
% 6.25/1.27 # Success case prop encoding time : 0.000
% 6.25/1.27 # Success case prop solver time : 0.000
% 6.25/1.27 # Current number of processed clauses : 118
% 6.25/1.27 # Positive orientable unit clauses : 108
% 6.25/1.27 # Positive unorientable unit clauses: 9
% 6.25/1.27 # Negative unit clauses : 1
% 6.25/1.27 # Non-unit-clauses : 0
% 6.25/1.27 # Current number of unprocessed clauses: 28353
% 6.25/1.27 # ...number of literals in the above : 28353
% 6.25/1.27 # Current number of archived formulas : 0
% 6.25/1.27 # Current number of archived clauses : 75
% 6.25/1.27 # Clause-clause subsumption calls (NU) : 0
% 6.25/1.27 # Rec. Clause-clause subsumption calls : 0
% 6.25/1.27 # Non-unit clause-clause subsumptions : 0
% 6.25/1.27 # Unit Clause-clause subsumption calls : 121
% 6.25/1.27 # Rewrite failures with RHS unbound : 0
% 6.25/1.27 # BW rewrite match attempts : 1902
% 6.25/1.27 # BW rewrite match successes : 375
% 6.25/1.27 # Condensation attempts : 0
% 6.25/1.27 # Condensation successes : 0
% 6.25/1.27 # Termbank termtop insertions : 701504
% 6.25/1.27
% 6.25/1.27 # -------------------------------------------------
% 6.25/1.27 # User time : 0.614 s
% 6.25/1.27 # System time : 0.026 s
% 6.25/1.27 # Total time : 0.640 s
% 6.25/1.27 # Maximum resident set size: 1516 pages
% 6.25/1.27
% 6.25/1.27 # -------------------------------------------------
% 6.25/1.27 # User time : 3.605 s
% 6.25/1.27 # System time : 0.157 s
% 6.25/1.27 # Total time : 3.762 s
% 6.25/1.27 # Maximum resident set size: 1680 pages
% 6.25/1.27 % E---3.1 exiting
% 6.25/1.27 % E---3.1 exiting
%------------------------------------------------------------------------------