TSTP Solution File: LAT005-6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LAT005-6 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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 : Mon May 20 23:23:05 EDT 2024
% Result : Unsatisfiable 6.64s 1.23s
% Output : CNFRefutation 6.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 21
% Syntax : Number of clauses : 99 ( 58 unt; 0 nHn; 87 RR)
% Number of literals : 176 ( 15 equ; 80 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 : 169 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(commutativity_of_join,axiom,
( join(X2,X1,X3)
| ~ join(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT002-0.ax',commutativity_of_join) ).
cnf(commutativity_of_meet,axiom,
( meet(X2,X1,X3)
| ~ meet(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT002-0.ax',commutativity_of_meet) ).
cnf(associativity_of_join2,axiom,
( join(X1,X5,X6)
| ~ join(X1,X2,X3)
| ~ join(X2,X4,X5)
| ~ join(X3,X4,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT002-0.ax',associativity_of_join2) ).
cnf(join_a_and_b,negated_conjecture,
join(a,b,c2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',join_a_and_b) ).
cnf(absorbtion1,axiom,
( join(X1,X3,X1)
| ~ meet(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT002-0.ax',absorbtion1) ).
cnf(meet_r2_and_b,negated_conjecture,
meet(r2,b,e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meet_r2_and_b) ).
cnf(modularity3,axiom,
( join(X2,X5,X6)
| ~ meet(X1,X2,X2)
| ~ join(X3,X2,X4)
| ~ meet(X1,X3,X5)
| ~ meet(X1,X4,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',modularity3) ).
cnf(absorbtion2,axiom,
( meet(X1,X3,X1)
| ~ join(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT002-0.ax',absorbtion2) ).
cnf(meet_r2_and_a,negated_conjecture,
meet(r2,a,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meet_r2_and_a) ).
cnf(join_r1_and_e,negated_conjecture,
join(r1,e,a2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',join_r1_and_e) ).
cnf(join_total_function_2,axiom,
( X3 = X4
| ~ join(X1,X2,X3)
| ~ join(X1,X2,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT002-0.ax',join_total_function_2) ).
cnf(associativity_of_meet2,axiom,
( meet(X1,X5,X6)
| ~ meet(X1,X2,X3)
| ~ meet(X2,X4,X5)
| ~ meet(X3,X4,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT002-0.ax',associativity_of_meet2) ).
cnf(meet_total_function_1,axiom,
meet(X1,X2,meet_of(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT002-0.ax',meet_total_function_1) ).
cnf(join_0_and_x,axiom,
join(n0,X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT002-0.ax',join_0_and_x) ).
cnf(join_total_function_1,axiom,
join(X1,X2,join_of(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT002-0.ax',join_total_function_1) ).
cnf(meet_c_and_r2,negated_conjecture,
meet(c,r2,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meet_c_and_r2) ).
cnf(meet_c2_and_r1,negated_conjecture,
meet(c2,r1,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meet_c2_and_r1) ).
cnf(meet_total_function_2,axiom,
( X3 = X4
| ~ meet(X1,X2,X3)
| ~ meet(X1,X2,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT002-0.ax',meet_total_function_2) ).
cnf(meet_a_and_b,negated_conjecture,
meet(a,b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meet_a_and_b) ).
cnf(join_r1_and_d,negated_conjecture,
join(r1,d,b2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',join_r1_and_d) ).
cnf(meet_a2_and_b2,negated_conjecture,
~ meet(a2,b2,r1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meet_a2_and_b2) ).
cnf(c_0_21,plain,
( join(X2,X1,X3)
| ~ join(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_of_join]) ).
cnf(c_0_22,plain,
( meet(X2,X1,X3)
| ~ meet(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_of_meet]) ).
cnf(c_0_23,plain,
( join(X1,X5,X6)
| ~ join(X1,X2,X3)
| ~ join(X2,X4,X5)
| ~ join(X3,X4,X6) ),
inference(fof_simplification,[status(thm)],[associativity_of_join2]) ).
cnf(c_0_24,plain,
( join(X2,X1,X3)
| ~ join(X1,X2,X3) ),
c_0_21 ).
cnf(c_0_25,negated_conjecture,
join(a,b,c2),
join_a_and_b ).
cnf(c_0_26,plain,
( join(X1,X3,X1)
| ~ meet(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[absorbtion1]) ).
cnf(c_0_27,plain,
( meet(X2,X1,X3)
| ~ meet(X1,X2,X3) ),
c_0_22 ).
cnf(c_0_28,negated_conjecture,
meet(r2,b,e),
meet_r2_and_b ).
cnf(c_0_29,plain,
( join(X1,X5,X6)
| ~ join(X1,X2,X3)
| ~ join(X2,X4,X5)
| ~ join(X3,X4,X6) ),
c_0_23 ).
cnf(c_0_30,negated_conjecture,
join(b,a,c2),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( join(X1,X3,X1)
| ~ meet(X1,X2,X3) ),
c_0_26 ).
cnf(c_0_32,negated_conjecture,
meet(b,r2,e),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( join(X1,X2,c2)
| ~ join(X3,a,X2)
| ~ join(X1,X3,b) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
join(b,e,b),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
( join(X2,X5,X6)
| ~ meet(X1,X2,X2)
| ~ join(X3,X2,X4)
| ~ meet(X1,X3,X5)
| ~ meet(X1,X4,X6) ),
inference(fof_simplification,[status(thm)],[modularity3]) ).
cnf(c_0_36,plain,
( meet(X1,X3,X1)
| ~ join(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[absorbtion2]) ).
cnf(c_0_37,negated_conjecture,
( join(X1,c2,c2)
| ~ join(X1,b,b) ),
inference(spm,[status(thm)],[c_0_33,c_0_30]) ).
cnf(c_0_38,negated_conjecture,
join(e,b,b),
inference(spm,[status(thm)],[c_0_24,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
meet(r2,a,d),
meet_r2_and_a ).
cnf(c_0_40,plain,
( join(X2,X5,X6)
| ~ meet(X1,X2,X2)
| ~ join(X3,X2,X4)
| ~ meet(X1,X3,X5)
| ~ meet(X1,X4,X6) ),
c_0_35 ).
cnf(c_0_41,negated_conjecture,
join(r1,e,a2),
join_r1_and_e ).
cnf(c_0_42,plain,
( meet(X1,X3,X1)
| ~ join(X1,X2,X3) ),
c_0_36 ).
cnf(c_0_43,negated_conjecture,
join(e,c2,c2),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
( X3 = X4
| ~ join(X1,X2,X3)
| ~ join(X1,X2,X4) ),
inference(fof_simplification,[status(thm)],[join_total_function_2]) ).
cnf(c_0_45,plain,
( meet(X1,X5,X6)
| ~ meet(X1,X2,X3)
| ~ meet(X2,X4,X5)
| ~ meet(X3,X4,X6) ),
inference(fof_simplification,[status(thm)],[associativity_of_meet2]) ).
cnf(c_0_46,negated_conjecture,
meet(a,r2,d),
inference(spm,[status(thm)],[c_0_27,c_0_39]) ).
cnf(c_0_47,negated_conjecture,
( join(e,X1,X2)
| ~ meet(X3,e,e)
| ~ meet(X3,a2,X2)
| ~ meet(X3,r1,X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_48,axiom,
meet(X1,X2,meet_of(X1,X2)),
meet_total_function_1 ).
cnf(c_0_49,negated_conjecture,
meet(e,c2,e),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,plain,
( X3 = X4
| ~ join(X1,X2,X3)
| ~ join(X1,X2,X4) ),
c_0_44 ).
cnf(c_0_51,axiom,
join(n0,X1,X1),
join_0_and_x ).
cnf(c_0_52,axiom,
join(X1,X2,join_of(X1,X2)),
join_total_function_1 ).
cnf(c_0_53,plain,
( meet(X1,X5,X6)
| ~ meet(X1,X2,X3)
| ~ meet(X2,X4,X5)
| ~ meet(X3,X4,X6) ),
c_0_45 ).
cnf(c_0_54,negated_conjecture,
meet(c,r2,n0),
meet_c_and_r2 ).
cnf(c_0_55,negated_conjecture,
join(a,d,a),
inference(spm,[status(thm)],[c_0_31,c_0_46]) ).
cnf(c_0_56,negated_conjecture,
( join(e,X1,meet_of(X2,a2))
| ~ meet(X2,e,e)
| ~ meet(X2,r1,X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_57,negated_conjecture,
meet(c2,r1,n0),
meet_c2_and_r1 ).
cnf(c_0_58,negated_conjecture,
meet(c2,e,e),
inference(spm,[status(thm)],[c_0_27,c_0_49]) ).
cnf(c_0_59,plain,
( X1 = X2
| ~ join(n0,X2,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_60,plain,
join(X1,X2,join_of(X2,X1)),
inference(spm,[status(thm)],[c_0_24,c_0_52]) ).
cnf(c_0_61,plain,
( X3 = X4
| ~ meet(X1,X2,X3)
| ~ meet(X1,X2,X4) ),
inference(fof_simplification,[status(thm)],[meet_total_function_2]) ).
cnf(c_0_62,negated_conjecture,
( meet(X1,X2,n0)
| ~ meet(X3,r2,X2)
| ~ meet(X1,X3,c) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_63,negated_conjecture,
join(d,a,a),
inference(spm,[status(thm)],[c_0_24,c_0_55]) ).
cnf(c_0_64,negated_conjecture,
meet(a,c2,a),
inference(spm,[status(thm)],[c_0_42,c_0_25]) ).
cnf(c_0_65,plain,
( X1 = join_of(X2,X3)
| ~ join(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_52]) ).
cnf(c_0_66,negated_conjecture,
join(e,n0,meet_of(c2,a2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]) ).
cnf(c_0_67,plain,
join_of(X1,n0) = X1,
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_68,plain,
( X3 = X4
| ~ meet(X1,X2,X3)
| ~ meet(X1,X2,X4) ),
c_0_61 ).
cnf(c_0_69,negated_conjecture,
( meet(X1,e,n0)
| ~ meet(X1,b,c) ),
inference(spm,[status(thm)],[c_0_62,c_0_32]) ).
cnf(c_0_70,negated_conjecture,
meet(a,b,c),
meet_a_and_b ).
cnf(c_0_71,negated_conjecture,
join(r1,d,b2),
join_r1_and_d ).
cnf(c_0_72,negated_conjecture,
meet(d,a,d),
inference(spm,[status(thm)],[c_0_42,c_0_63]) ).
cnf(c_0_73,plain,
( meet(X1,X2,meet_of(X3,X4))
| ~ meet(X5,X4,X2)
| ~ meet(X1,X5,X3) ),
inference(spm,[status(thm)],[c_0_53,c_0_48]) ).
cnf(c_0_74,negated_conjecture,
meet(c2,a,a),
inference(spm,[status(thm)],[c_0_27,c_0_64]) ).
cnf(c_0_75,plain,
meet(X1,X2,meet_of(X2,X1)),
inference(spm,[status(thm)],[c_0_27,c_0_48]) ).
cnf(c_0_76,negated_conjecture,
meet_of(c2,a2) = e,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]) ).
cnf(c_0_77,plain,
( X1 = meet_of(X2,X3)
| ~ meet(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_68,c_0_48]) ).
cnf(c_0_78,negated_conjecture,
meet(a,e,n0),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_79,negated_conjecture,
join(d,r1,b2),
inference(spm,[status(thm)],[c_0_24,c_0_71]) ).
cnf(c_0_80,negated_conjecture,
meet(a,d,d),
inference(spm,[status(thm)],[c_0_27,c_0_72]) ).
cnf(c_0_81,negated_conjecture,
( meet(X1,a,meet_of(X2,a))
| ~ meet(X1,c2,X2) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_82,negated_conjecture,
meet(a2,c2,e),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_83,plain,
meet_of(X1,X2) = meet_of(X2,X1),
inference(spm,[status(thm)],[c_0_77,c_0_75]) ).
cnf(c_0_84,negated_conjecture,
meet_of(a,e) = n0,
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_85,plain,
join(X1,meet_of(X1,X2),X1),
inference(spm,[status(thm)],[c_0_31,c_0_48]) ).
cnf(c_0_86,negated_conjecture,
( join(r1,X1,X2)
| ~ meet(X3,r1,r1)
| ~ meet(X3,b2,X2)
| ~ meet(X3,d,X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_79]) ).
cnf(c_0_87,negated_conjecture,
( meet(X1,d,meet_of(X2,d))
| ~ meet(X1,a,X2) ),
inference(spm,[status(thm)],[c_0_73,c_0_80]) ).
cnf(c_0_88,negated_conjecture,
meet(a2,a,n0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83]),c_0_84]) ).
cnf(c_0_89,plain,
meet_of(n0,X1) = n0,
inference(spm,[status(thm)],[c_0_59,c_0_85]) ).
cnf(c_0_90,negated_conjecture,
meet(r1,a2,r1),
inference(spm,[status(thm)],[c_0_42,c_0_41]) ).
cnf(c_0_91,negated_conjecture,
( join(r1,X1,meet_of(b2,X2))
| ~ meet(X2,r1,r1)
| ~ meet(X2,d,X1) ),
inference(spm,[status(thm)],[c_0_86,c_0_75]) ).
cnf(c_0_92,negated_conjecture,
meet(a2,d,n0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89]) ).
cnf(c_0_93,negated_conjecture,
meet(a2,r1,r1),
inference(spm,[status(thm)],[c_0_27,c_0_90]) ).
cnf(c_0_94,negated_conjecture,
join(r1,n0,meet_of(a2,b2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_83]),c_0_93])]) ).
cnf(c_0_95,negated_conjecture,
~ meet(a2,b2,r1),
inference(fof_simplification,[status(thm)],[meet_a2_and_b2]) ).
cnf(c_0_96,negated_conjecture,
meet_of(a2,b2) = r1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_94]),c_0_67]) ).
cnf(c_0_97,negated_conjecture,
~ meet(a2,b2,r1),
c_0_95 ).
cnf(c_0_98,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_96]),c_0_97]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : LAT005-6 : TPTP v8.2.0. Released v1.1.0.
% 0.10/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n009.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.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sun May 19 20:38:07 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 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/benchmark/theBenchmark.p
% 6.64/1.23 # Version: 3.1.0
% 6.64/1.23 # Preprocessing class: FSMSSMSMSSSNFFN.
% 6.64/1.23 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.64/1.23 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 6.64/1.23 # Starting new_bool_3 with 300s (1) cores
% 6.64/1.23 # Starting new_bool_1 with 300s (1) cores
% 6.64/1.23 # Starting sh5l with 300s (1) cores
% 6.64/1.23 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 9314 completed with status 0
% 6.64/1.23 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 6.64/1.23 # Preprocessing class: FSMSSMSMSSSNFFN.
% 6.64/1.23 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.64/1.23 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 6.64/1.23 # No SInE strategy applied
% 6.64/1.23 # Search class: FHUSM-FFMM22-SFFFFFNN
% 6.64/1.23 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 6.64/1.23 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 6.64/1.23 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 6.64/1.23 # Starting new_bool_3 with 136s (1) cores
% 6.64/1.23 # Starting new_bool_1 with 136s (1) cores
% 6.64/1.23 # Starting sh5l with 136s (1) cores
% 6.64/1.23 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 9318 completed with status 0
% 6.64/1.23 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 6.64/1.23 # Preprocessing class: FSMSSMSMSSSNFFN.
% 6.64/1.23 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.64/1.23 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 6.64/1.23 # No SInE strategy applied
% 6.64/1.23 # Search class: FHUSM-FFMM22-SFFFFFNN
% 6.64/1.23 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 6.64/1.23 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 6.64/1.23 # Preprocessing time : 0.001 s
% 6.64/1.23 # Presaturation interreduction done
% 6.64/1.23
% 6.64/1.23 # Proof found!
% 6.64/1.23 # SZS status Unsatisfiable
% 6.64/1.23 # SZS output start CNFRefutation
% See solution above
% 6.64/1.23 # Parsed axioms : 37
% 6.64/1.23 # Removed by relevancy pruning/SinE : 0
% 6.64/1.23 # Initial clauses : 37
% 6.64/1.23 # Removed in clause preprocessing : 0
% 6.64/1.23 # Initial clauses in saturation : 37
% 6.64/1.23 # Processed clauses : 10077
% 6.64/1.23 # ...of these trivial : 1048
% 6.64/1.23 # ...subsumed : 4756
% 6.64/1.23 # ...remaining for further processing : 4273
% 6.64/1.23 # Other redundant clauses eliminated : 0
% 6.64/1.23 # Clauses deleted for lack of memory : 0
% 6.64/1.23 # Backward-subsumed : 20
% 6.64/1.23 # Backward-rewritten : 221
% 6.64/1.23 # Generated clauses : 59349
% 6.64/1.23 # ...of the previous two non-redundant : 37551
% 6.64/1.23 # ...aggressively subsumed : 0
% 6.64/1.23 # Contextual simplify-reflections : 0
% 6.64/1.23 # Paramodulations : 59349
% 6.64/1.23 # Factorizations : 0
% 6.64/1.23 # NegExts : 0
% 6.64/1.23 # Equation resolutions : 0
% 6.64/1.23 # Disequality decompositions : 0
% 6.64/1.23 # Total rewrite steps : 35529
% 6.64/1.23 # ...of those cached : 33441
% 6.64/1.23 # Propositional unsat checks : 0
% 6.64/1.23 # Propositional check models : 0
% 6.64/1.23 # Propositional check unsatisfiable : 0
% 6.64/1.23 # Propositional clauses : 0
% 6.64/1.23 # Propositional clauses after purity: 0
% 6.64/1.23 # Propositional unsat core size : 0
% 6.64/1.23 # Propositional preprocessing time : 0.000
% 6.64/1.23 # Propositional encoding time : 0.000
% 6.64/1.23 # Propositional solver time : 0.000
% 6.64/1.23 # Success case prop preproc time : 0.000
% 6.64/1.23 # Success case prop encoding time : 0.000
% 6.64/1.23 # Success case prop solver time : 0.000
% 6.64/1.23 # Current number of processed clauses : 3995
% 6.64/1.23 # Positive orientable unit clauses : 641
% 6.64/1.23 # Positive unorientable unit clauses: 2
% 6.64/1.23 # Negative unit clauses : 1
% 6.64/1.23 # Non-unit-clauses : 3351
% 6.64/1.23 # Current number of unprocessed clauses: 27220
% 6.64/1.23 # ...number of literals in the above : 62999
% 6.64/1.23 # Current number of archived formulas : 0
% 6.64/1.23 # Current number of archived clauses : 278
% 6.64/1.23 # Clause-clause subsumption calls (NU) : 928939
% 6.64/1.23 # Rec. Clause-clause subsumption calls : 740668
% 6.64/1.23 # Non-unit clause-clause subsumptions : 4774
% 6.64/1.23 # Unit Clause-clause subsumption calls : 19286
% 6.64/1.23 # Rewrite failures with RHS unbound : 0
% 6.64/1.23 # BW rewrite match attempts : 851
% 6.64/1.23 # BW rewrite match successes : 630
% 6.64/1.23 # Condensation attempts : 0
% 6.64/1.23 # Condensation successes : 0
% 6.64/1.23 # Termbank termtop insertions : 635469
% 6.64/1.23 # Search garbage collected termcells : 69
% 6.64/1.23
% 6.64/1.23 # -------------------------------------------------
% 6.64/1.23 # User time : 0.788 s
% 6.64/1.23 # System time : 0.027 s
% 6.64/1.23 # Total time : 0.815 s
% 6.64/1.23 # Maximum resident set size: 1672 pages
% 6.64/1.23
% 6.64/1.23 # -------------------------------------------------
% 6.64/1.23 # User time : 4.022 s
% 6.64/1.23 # System time : 0.050 s
% 6.64/1.23 # Total time : 4.072 s
% 6.64/1.23 # Maximum resident set size: 1724 pages
% 6.64/1.23 % E---3.1 exiting
% 6.64/1.23 % E exiting
%------------------------------------------------------------------------------