TSTP Solution File: LAT005-5 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT005-5 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:20 EDT 2023
% Result : Unsatisfiable 8.29s 1.48s
% Output : CNFRefutation 8.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 23
% Syntax : Number of clauses : 97 ( 60 unt; 0 nHn; 84 RR)
% Number of literals : 163 ( 17 equ; 68 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-2 aty)
% Number of variables : 146 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(commutativity_of_meet,axiom,
( meet(X2,X1,X3)
| ~ meet(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.H2dBl0EDNV/E---3.1_20057.p',commutativity_of_meet) ).
cnf(meet_r2_and_a,negated_conjecture,
meet(r2,a,d),
file('/export/starexec/sandbox/tmp/tmp.H2dBl0EDNV/E---3.1_20057.p',meet_r2_and_a) ).
cnf(associativity_of_join2,axiom,
( join(X1,X5,X6)
| ~ join(X1,X2,X3)
| ~ join(X2,X4,X5)
| ~ join(X3,X4,X6) ),
file('/export/starexec/sandbox/tmp/tmp.H2dBl0EDNV/E---3.1_20057.p',associativity_of_join2) ).
cnf(join_a_and_b,negated_conjecture,
join(a,b,c2),
file('/export/starexec/sandbox/tmp/tmp.H2dBl0EDNV/E---3.1_20057.p',join_a_and_b) ).
cnf(absorbtion1,axiom,
( join(X1,X3,X1)
| ~ meet(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.H2dBl0EDNV/E---3.1_20057.p',absorbtion1) ).
cnf(commutativity_of_join,axiom,
( join(X2,X1,X3)
| ~ join(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.H2dBl0EDNV/E---3.1_20057.p',commutativity_of_join) ).
cnf(join_r1_and_d,negated_conjecture,
join(r1,d,b2),
file('/export/starexec/sandbox/tmp/tmp.H2dBl0EDNV/E---3.1_20057.p',join_r1_and_d) ).
cnf(meet_r2_and_b,negated_conjecture,
meet(r2,b,e),
file('/export/starexec/sandbox/tmp/tmp.H2dBl0EDNV/E---3.1_20057.p',meet_r2_and_b) ).
cnf(modularity1,axiom,
( join(X1,X5,X6)
| ~ meet(X1,X2,X1)
| ~ join(X1,X3,X4)
| ~ meet(X3,X2,X5)
| ~ meet(X2,X4,X6) ),
file('/export/starexec/sandbox/tmp/tmp.H2dBl0EDNV/E---3.1_20057.p',modularity1) ).
cnf(meet_c2_and_r1,negated_conjecture,
meet(c2,r1,n0),
file('/export/starexec/sandbox/tmp/tmp.H2dBl0EDNV/E---3.1_20057.p',meet_c2_and_r1) ).
cnf(absorbtion2,axiom,
( meet(X1,X3,X1)
| ~ join(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.H2dBl0EDNV/E---3.1_20057.p',absorbtion2) ).
cnf(join_0_and_x,axiom,
join(n0,X1,X1),
file('/export/starexec/sandbox/tmp/tmp.H2dBl0EDNV/E---3.1_20057.p',join_0_and_x) ).
cnf(join_total_function_2,axiom,
( X3 = X4
| ~ join(X1,X2,X3)
| ~ join(X1,X2,X4) ),
file('/export/starexec/sandbox/tmp/tmp.H2dBl0EDNV/E---3.1_20057.p',join_total_function_2) ).
cnf(associativity_of_meet1,axiom,
( meet(X3,X4,X6)
| ~ meet(X1,X2,X3)
| ~ meet(X2,X4,X5)
| ~ meet(X1,X5,X6) ),
file('/export/starexec/sandbox/tmp/tmp.H2dBl0EDNV/E---3.1_20057.p',associativity_of_meet1) ).
cnf(meet_a_and_b,negated_conjecture,
meet(a,b,c),
file('/export/starexec/sandbox/tmp/tmp.H2dBl0EDNV/E---3.1_20057.p',meet_a_and_b) ).
cnf(meet_c_and_r2,negated_conjecture,
meet(c,r2,n0),
file('/export/starexec/sandbox/tmp/tmp.H2dBl0EDNV/E---3.1_20057.p',meet_c_and_r2) ).
cnf(meet_total_function_2,axiom,
( X3 = X4
| ~ meet(X1,X2,X3)
| ~ meet(X1,X2,X4) ),
file('/export/starexec/sandbox/tmp/tmp.H2dBl0EDNV/E---3.1_20057.p',meet_total_function_2) ).
cnf(join_total_function_1,axiom,
join(X1,X2,join_of(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.H2dBl0EDNV/E---3.1_20057.p',join_total_function_1) ).
cnf(meet_total_function_1,axiom,
meet(X1,X2,meet_of(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.H2dBl0EDNV/E---3.1_20057.p',meet_total_function_1) ).
cnf(associativity_of_meet2,axiom,
( meet(X1,X5,X6)
| ~ meet(X1,X2,X3)
| ~ meet(X2,X4,X5)
| ~ meet(X3,X4,X6) ),
file('/export/starexec/sandbox/tmp/tmp.H2dBl0EDNV/E---3.1_20057.p',associativity_of_meet2) ).
cnf(meet_0_and_x,axiom,
meet(n0,X1,n0),
file('/export/starexec/sandbox/tmp/tmp.H2dBl0EDNV/E---3.1_20057.p',meet_0_and_x) ).
cnf(join_r1_and_e,negated_conjecture,
join(r1,e,a2),
file('/export/starexec/sandbox/tmp/tmp.H2dBl0EDNV/E---3.1_20057.p',join_r1_and_e) ).
cnf(meet_a2_and_b2,negated_conjecture,
~ meet(a2,b2,r1),
file('/export/starexec/sandbox/tmp/tmp.H2dBl0EDNV/E---3.1_20057.p',meet_a2_and_b2) ).
cnf(c_0_23,axiom,
( meet(X2,X1,X3)
| ~ meet(X1,X2,X3) ),
commutativity_of_meet ).
cnf(c_0_24,negated_conjecture,
meet(r2,a,d),
meet_r2_and_a ).
cnf(c_0_25,axiom,
( join(X1,X5,X6)
| ~ join(X1,X2,X3)
| ~ join(X2,X4,X5)
| ~ join(X3,X4,X6) ),
associativity_of_join2 ).
cnf(c_0_26,negated_conjecture,
join(a,b,c2),
join_a_and_b ).
cnf(c_0_27,axiom,
( join(X1,X3,X1)
| ~ meet(X1,X2,X3) ),
absorbtion1 ).
cnf(c_0_28,negated_conjecture,
meet(a,r2,d),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( join(X1,X2,c2)
| ~ join(X3,b,X2)
| ~ join(X1,X3,a) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,axiom,
( join(X2,X1,X3)
| ~ join(X1,X2,X3) ),
commutativity_of_join ).
cnf(c_0_31,negated_conjecture,
join(a,d,a),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
join(r1,d,b2),
join_r1_and_d ).
cnf(c_0_33,negated_conjecture,
( join(X1,c2,c2)
| ~ join(X1,a,a) ),
inference(spm,[status(thm)],[c_0_29,c_0_26]) ).
cnf(c_0_34,negated_conjecture,
join(d,a,a),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
meet(r2,b,e),
meet_r2_and_b ).
cnf(c_0_36,axiom,
( join(X1,X5,X6)
| ~ meet(X1,X2,X1)
| ~ join(X1,X3,X4)
| ~ meet(X3,X2,X5)
| ~ meet(X2,X4,X6) ),
modularity1 ).
cnf(c_0_37,negated_conjecture,
join(d,r1,b2),
inference(spm,[status(thm)],[c_0_30,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
meet(c2,r1,n0),
meet_c2_and_r1 ).
cnf(c_0_39,axiom,
( meet(X1,X3,X1)
| ~ join(X1,X2,X3) ),
absorbtion2 ).
cnf(c_0_40,negated_conjecture,
join(d,c2,c2),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,axiom,
join(n0,X1,X1),
join_0_and_x ).
cnf(c_0_42,negated_conjecture,
meet(b,r2,e),
inference(spm,[status(thm)],[c_0_23,c_0_35]) ).
cnf(c_0_43,negated_conjecture,
( join(d,X1,X2)
| ~ meet(d,X3,d)
| ~ meet(r1,X3,X1)
| ~ meet(X3,b2,X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_44,negated_conjecture,
meet(r1,c2,n0),
inference(spm,[status(thm)],[c_0_23,c_0_38]) ).
cnf(c_0_45,negated_conjecture,
meet(d,c2,d),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,axiom,
( X3 = X4
| ~ join(X1,X2,X3)
| ~ join(X1,X2,X4) ),
join_total_function_2 ).
cnf(c_0_47,plain,
join(X1,n0,X1),
inference(spm,[status(thm)],[c_0_30,c_0_41]) ).
cnf(c_0_48,axiom,
( meet(X3,X4,X6)
| ~ meet(X1,X2,X3)
| ~ meet(X2,X4,X5)
| ~ meet(X1,X5,X6) ),
associativity_of_meet1 ).
cnf(c_0_49,negated_conjecture,
meet(a,b,c),
meet_a_and_b ).
cnf(c_0_50,negated_conjecture,
meet(c,r2,n0),
meet_c_and_r2 ).
cnf(c_0_51,axiom,
( X3 = X4
| ~ meet(X1,X2,X3)
| ~ meet(X1,X2,X4) ),
meet_total_function_2 ).
cnf(c_0_52,negated_conjecture,
join(b,e,b),
inference(spm,[status(thm)],[c_0_27,c_0_42]) ).
cnf(c_0_53,negated_conjecture,
join(b,a,c2),
inference(spm,[status(thm)],[c_0_30,c_0_26]) ).
cnf(c_0_54,axiom,
join(X1,X2,join_of(X1,X2)),
join_total_function_1 ).
cnf(c_0_55,negated_conjecture,
( join(d,n0,X1)
| ~ meet(c2,b2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]) ).
cnf(c_0_56,axiom,
meet(X1,X2,meet_of(X1,X2)),
meet_total_function_1 ).
cnf(c_0_57,plain,
( X1 = X2
| ~ join(X2,n0,X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_58,negated_conjecture,
( meet(X1,b,X2)
| ~ meet(X3,c,X2)
| ~ meet(X3,a,X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_59,negated_conjecture,
meet(r2,c,n0),
inference(spm,[status(thm)],[c_0_23,c_0_50]) ).
cnf(c_0_60,negated_conjecture,
( X1 = d
| ~ meet(r2,a,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_24]) ).
cnf(c_0_61,negated_conjecture,
join(e,b,b),
inference(spm,[status(thm)],[c_0_30,c_0_52]) ).
cnf(c_0_62,axiom,
( meet(X1,X5,X6)
| ~ meet(X1,X2,X3)
| ~ meet(X2,X4,X5)
| ~ meet(X3,X4,X6) ),
associativity_of_meet2 ).
cnf(c_0_63,negated_conjecture,
meet(b,c2,b),
inference(spm,[status(thm)],[c_0_39,c_0_53]) ).
cnf(c_0_64,plain,
( X1 = join_of(X2,X3)
| ~ join(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_54]) ).
cnf(c_0_65,negated_conjecture,
join(d,n0,meet_of(c2,b2)),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_66,plain,
join_of(X1,n0) = X1,
inference(spm,[status(thm)],[c_0_57,c_0_54]) ).
cnf(c_0_67,plain,
meet(X1,X2,meet_of(X2,X1)),
inference(spm,[status(thm)],[c_0_23,c_0_56]) ).
cnf(c_0_68,negated_conjecture,
( meet(X1,b,n0)
| ~ meet(r2,a,X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_69,negated_conjecture,
meet_of(r2,a) = d,
inference(spm,[status(thm)],[c_0_60,c_0_56]) ).
cnf(c_0_70,negated_conjecture,
meet(e,b,e),
inference(spm,[status(thm)],[c_0_39,c_0_61]) ).
cnf(c_0_71,plain,
( meet(X1,X2,meet_of(X3,X4))
| ~ meet(X5,X4,X2)
| ~ meet(X1,X5,X3) ),
inference(spm,[status(thm)],[c_0_62,c_0_56]) ).
cnf(c_0_72,negated_conjecture,
meet(c2,b,b),
inference(spm,[status(thm)],[c_0_23,c_0_63]) ).
cnf(c_0_73,negated_conjecture,
meet_of(c2,b2) = d,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]) ).
cnf(c_0_74,plain,
( X1 = meet_of(X2,X3)
| ~ meet(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_56]) ).
cnf(c_0_75,plain,
( X1 = meet_of(X2,X3)
| ~ meet(X3,X2,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_67]) ).
cnf(c_0_76,negated_conjecture,
meet(d,b,n0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_56]),c_0_69]) ).
cnf(c_0_77,axiom,
meet(n0,X1,n0),
meet_0_and_x ).
cnf(c_0_78,negated_conjecture,
meet(b,e,e),
inference(spm,[status(thm)],[c_0_23,c_0_70]) ).
cnf(c_0_79,negated_conjecture,
( meet(X1,b,meet_of(X2,b))
| ~ meet(X1,c2,X2) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_80,negated_conjecture,
meet(b2,c2,d),
inference(spm,[status(thm)],[c_0_67,c_0_73]) ).
cnf(c_0_81,plain,
meet_of(X1,X2) = meet_of(X2,X1),
inference(spm,[status(thm)],[c_0_74,c_0_67]) ).
cnf(c_0_82,negated_conjecture,
meet_of(b,d) = n0,
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_83,plain,
( X1 = n0
| ~ meet(n0,X2,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_77]) ).
cnf(c_0_84,negated_conjecture,
( meet(X1,e,meet_of(X2,e))
| ~ meet(X1,b,X2) ),
inference(spm,[status(thm)],[c_0_71,c_0_78]) ).
cnf(c_0_85,negated_conjecture,
meet(b2,b,n0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81]),c_0_82]) ).
cnf(c_0_86,plain,
meet_of(n0,X1) = n0,
inference(spm,[status(thm)],[c_0_83,c_0_56]) ).
cnf(c_0_87,negated_conjecture,
join(r1,e,a2),
join_r1_and_e ).
cnf(c_0_88,negated_conjecture,
meet(b2,e,n0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86]) ).
cnf(c_0_89,negated_conjecture,
( join(r1,X1,X2)
| ~ meet(r1,X3,r1)
| ~ meet(e,X3,X1)
| ~ meet(X3,a2,X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_87]) ).
cnf(c_0_90,negated_conjecture,
meet(e,b2,n0),
inference(spm,[status(thm)],[c_0_23,c_0_88]) ).
cnf(c_0_91,negated_conjecture,
meet(r1,b2,r1),
inference(spm,[status(thm)],[c_0_39,c_0_32]) ).
cnf(c_0_92,negated_conjecture,
( join(r1,n0,X1)
| ~ meet(b2,a2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_91])]) ).
cnf(c_0_93,negated_conjecture,
join(r1,n0,meet_of(a2,b2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_56]),c_0_81]) ).
cnf(c_0_94,negated_conjecture,
meet_of(a2,b2) = r1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_93]),c_0_66]) ).
cnf(c_0_95,negated_conjecture,
~ meet(a2,b2,r1),
meet_a2_and_b2 ).
cnf(c_0_96,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_94]),c_0_95]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : LAT005-5 : TPTP v8.1.2. Released v1.1.0.
% 0.09/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n011.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:19:53 EDT 2023
% 0.17/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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.H2dBl0EDNV/E---3.1_20057.p
% 8.29/1.48 # Version: 3.1pre001
% 8.29/1.48 # Preprocessing class: FSMSSMSMSSSNFFN.
% 8.29/1.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.29/1.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 8.29/1.48 # Starting new_bool_3 with 300s (1) cores
% 8.29/1.48 # Starting new_bool_1 with 300s (1) cores
% 8.29/1.48 # Starting sh5l with 300s (1) cores
% 8.29/1.48 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 20135 completed with status 0
% 8.29/1.48 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 8.29/1.48 # Preprocessing class: FSMSSMSMSSSNFFN.
% 8.29/1.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.29/1.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 8.29/1.48 # No SInE strategy applied
% 8.29/1.48 # Search class: FHUSM-FFMM22-SFFFFFNN
% 8.29/1.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 8.29/1.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 8.29/1.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 8.29/1.48 # Starting new_bool_3 with 136s (1) cores
% 8.29/1.48 # Starting new_bool_1 with 136s (1) cores
% 8.29/1.48 # Starting sh5l with 136s (1) cores
% 8.29/1.48 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 20139 completed with status 0
% 8.29/1.48 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 8.29/1.48 # Preprocessing class: FSMSSMSMSSSNFFN.
% 8.29/1.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.29/1.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 8.29/1.48 # No SInE strategy applied
% 8.29/1.48 # Search class: FHUSM-FFMM22-SFFFFFNN
% 8.29/1.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 8.29/1.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 8.29/1.48 # Preprocessing time : 0.001 s
% 8.29/1.48 # Presaturation interreduction done
% 8.29/1.48
% 8.29/1.48 # Proof found!
% 8.29/1.48 # SZS status Unsatisfiable
% 8.29/1.48 # SZS output start CNFRefutation
% See solution above
% 8.29/1.48 # Parsed axioms : 31
% 8.29/1.48 # Removed by relevancy pruning/SinE : 0
% 8.29/1.48 # Initial clauses : 31
% 8.29/1.48 # Removed in clause preprocessing : 0
% 8.29/1.48 # Initial clauses in saturation : 31
% 8.29/1.48 # Processed clauses : 11678
% 8.29/1.48 # ...of these trivial : 1060
% 8.29/1.48 # ...subsumed : 5289
% 8.29/1.48 # ...remaining for further processing : 5329
% 8.29/1.48 # Other redundant clauses eliminated : 0
% 8.29/1.48 # Clauses deleted for lack of memory : 0
% 8.29/1.48 # Backward-subsumed : 68
% 8.29/1.48 # Backward-rewritten : 214
% 8.29/1.48 # Generated clauses : 56589
% 8.29/1.48 # ...of the previous two non-redundant : 34643
% 8.29/1.48 # ...aggressively subsumed : 0
% 8.29/1.48 # Contextual simplify-reflections : 0
% 8.29/1.48 # Paramodulations : 56589
% 8.29/1.48 # Factorizations : 0
% 8.29/1.48 # NegExts : 0
% 8.29/1.48 # Equation resolutions : 0
% 8.29/1.48 # Total rewrite steps : 38387
% 8.29/1.48 # Propositional unsat checks : 1
% 8.29/1.48 # Propositional check models : 1
% 8.29/1.48 # Propositional check unsatisfiable : 0
% 8.29/1.48 # Propositional clauses : 0
% 8.29/1.48 # Propositional clauses after purity: 0
% 8.29/1.48 # Propositional unsat core size : 0
% 8.29/1.48 # Propositional preprocessing time : 0.000
% 8.29/1.48 # Propositional encoding time : 0.029
% 8.29/1.48 # Propositional solver time : 0.030
% 8.29/1.48 # Success case prop preproc time : 0.000
% 8.29/1.48 # Success case prop encoding time : 0.000
% 8.29/1.48 # Success case prop solver time : 0.000
% 8.29/1.48 # Current number of processed clauses : 5016
% 8.29/1.48 # Positive orientable unit clauses : 636
% 8.29/1.48 # Positive unorientable unit clauses: 2
% 8.29/1.48 # Negative unit clauses : 1
% 8.29/1.48 # Non-unit-clauses : 4377
% 8.29/1.48 # Current number of unprocessed clauses: 22665
% 8.29/1.48 # ...number of literals in the above : 48943
% 8.29/1.48 # Current number of archived formulas : 0
% 8.29/1.48 # Current number of archived clauses : 313
% 8.29/1.48 # Clause-clause subsumption calls (NU) : 1352194
% 8.29/1.48 # Rec. Clause-clause subsumption calls : 1143389
% 8.29/1.48 # Non-unit clause-clause subsumptions : 5355
% 8.29/1.48 # Unit Clause-clause subsumption calls : 17750
% 8.29/1.48 # Rewrite failures with RHS unbound : 0
% 8.29/1.48 # BW rewrite match attempts : 783
% 8.29/1.48 # BW rewrite match successes : 568
% 8.29/1.48 # Condensation attempts : 0
% 8.29/1.48 # Condensation successes : 0
% 8.29/1.48 # Termbank termtop insertions : 680101
% 8.29/1.48
% 8.29/1.48 # -------------------------------------------------
% 8.29/1.48 # User time : 0.995 s
% 8.29/1.48 # System time : 0.030 s
% 8.29/1.48 # Total time : 1.025 s
% 8.29/1.48 # Maximum resident set size: 1648 pages
% 8.29/1.48
% 8.29/1.48 # -------------------------------------------------
% 8.29/1.48 # User time : 5.073 s
% 8.29/1.48 # System time : 0.053 s
% 8.29/1.48 # Total time : 5.126 s
% 8.29/1.48 # Maximum resident set size: 1692 pages
% 8.29/1.48 % E---3.1 exiting
% 8.29/1.48 % E---3.1 exiting
%------------------------------------------------------------------------------