TSTP Solution File: GRP124-9.004 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP124-9.004 : TPTP v8.2.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 20:45:45 EDT 2024
% Result : Unsatisfiable 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 16
% Syntax : Number of clauses : 88 ( 34 unt; 29 nHn; 84 RR)
% Number of literals : 202 ( 0 equ; 76 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 75 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product1_total_function1,axiom,
( product1(X1,X2,e_1)
| product1(X1,X2,e_2)
| product1(X1,X2,e_3)
| product1(X1,X2,e_4)
| ~ group_element(X1)
| ~ group_element(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product1_total_function1) ).
cnf(product1_right_cancellation,axiom,
( equalish(X2,X4)
| ~ product1(X1,X2,X3)
| ~ product1(X1,X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product1_right_cancellation) ).
cnf(element_4,axiom,
group_element(e_4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_4) ).
cnf(product1_left_cancellation,axiom,
( equalish(X1,X4)
| ~ product1(X1,X2,X3)
| ~ product1(X4,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product1_left_cancellation) ).
cnf(product1_idempotence,axiom,
product1(X1,X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product1_idempotence) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_1) ).
cnf(e_4_is_not_e_1,axiom,
~ equalish(e_4,e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_4_is_not_e_1) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_3) ).
cnf(e_1_is_not_e_4,axiom,
~ equalish(e_1,e_4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_1_is_not_e_4) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_3_is_not_e_1) ).
cnf(product2_total_function2,axiom,
( equalish(X3,X4)
| ~ product2(X1,X2,X3)
| ~ product2(X1,X2,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product2_total_function2) ).
cnf(qg2a,negated_conjecture,
( product2(X4,X2,X1)
| ~ product1(X1,X2,X3)
| ~ product1(X3,X1,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qg2a) ).
cnf(product2_idempotence,axiom,
product2(X1,X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product2_idempotence) ).
cnf(e_4_is_not_e_3,axiom,
~ equalish(e_4,e_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_4_is_not_e_3) ).
cnf(e_3_is_not_e_4,axiom,
~ equalish(e_3,e_4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_3_is_not_e_4) ).
cnf(e_1_is_not_e_3,axiom,
~ equalish(e_1,e_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_1_is_not_e_3) ).
cnf(c_0_16,plain,
( product1(X1,X2,e_1)
| product1(X1,X2,e_2)
| product1(X1,X2,e_3)
| product1(X1,X2,e_4)
| ~ group_element(X1)
| ~ group_element(X2) ),
inference(fof_simplification,[status(thm)],[product1_total_function1]) ).
cnf(c_0_17,plain,
( equalish(X2,X4)
| ~ product1(X1,X2,X3)
| ~ product1(X1,X4,X3) ),
inference(fof_simplification,[status(thm)],[product1_right_cancellation]) ).
cnf(c_0_18,plain,
( product1(X1,X2,e_1)
| product1(X1,X2,e_2)
| product1(X1,X2,e_3)
| product1(X1,X2,e_4)
| ~ group_element(X1)
| ~ group_element(X2) ),
c_0_16 ).
cnf(c_0_19,axiom,
group_element(e_4),
element_4 ).
cnf(c_0_20,plain,
( equalish(X1,X4)
| ~ product1(X1,X2,X3)
| ~ product1(X4,X2,X3) ),
inference(fof_simplification,[status(thm)],[product1_left_cancellation]) ).
cnf(c_0_21,plain,
( equalish(X2,X4)
| ~ product1(X1,X2,X3)
| ~ product1(X1,X4,X3) ),
c_0_17 ).
cnf(c_0_22,axiom,
product1(X1,X1,X1),
product1_idempotence ).
cnf(c_0_23,plain,
( product1(X1,e_4,e_4)
| product1(X1,e_4,e_3)
| product1(X1,e_4,e_2)
| product1(X1,e_4,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_25,plain,
~ equalish(e_4,e_1),
inference(fof_simplification,[status(thm)],[e_4_is_not_e_1]) ).
cnf(c_0_26,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_27,plain,
( equalish(X1,X4)
| ~ product1(X1,X2,X3)
| ~ product1(X4,X2,X3) ),
c_0_20 ).
cnf(c_0_28,plain,
( equalish(X1,X2)
| ~ product1(X2,X1,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
( product1(e_1,e_4,e_1)
| product1(e_1,e_4,e_2)
| product1(e_1,e_4,e_3)
| product1(e_1,e_4,e_4) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
~ equalish(e_4,e_1),
c_0_25 ).
cnf(c_0_31,plain,
~ equalish(e_1,e_4),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_4]) ).
cnf(c_0_32,plain,
( product1(X1,e_3,e_4)
| product1(X1,e_3,e_3)
| product1(X1,e_3,e_2)
| product1(X1,e_3,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_26]) ).
cnf(c_0_33,plain,
~ equalish(e_3,e_1),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_1]) ).
cnf(c_0_34,plain,
( equalish(X3,X4)
| ~ product2(X1,X2,X3)
| ~ product2(X1,X2,X4) ),
inference(fof_simplification,[status(thm)],[product2_total_function2]) ).
cnf(c_0_35,negated_conjecture,
( product2(X4,X2,X1)
| ~ product1(X1,X2,X3)
| ~ product1(X3,X1,X4) ),
inference(fof_simplification,[status(thm)],[qg2a]) ).
cnf(c_0_36,plain,
( equalish(X1,X2)
| ~ product1(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_22]) ).
cnf(c_0_37,plain,
( product1(e_1,e_4,e_4)
| product1(e_1,e_4,e_3)
| product1(e_1,e_4,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_38,plain,
~ equalish(e_1,e_4),
c_0_31 ).
cnf(c_0_39,plain,
( product1(e_1,e_3,e_1)
| product1(e_1,e_3,e_2)
| product1(e_1,e_3,e_3)
| product1(e_1,e_3,e_4) ),
inference(spm,[status(thm)],[c_0_32,c_0_24]) ).
cnf(c_0_40,plain,
~ equalish(e_3,e_1),
c_0_33 ).
cnf(c_0_41,plain,
( product1(X1,e_1,e_4)
| product1(X1,e_1,e_3)
| product1(X1,e_1,e_2)
| product1(X1,e_1,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_24]) ).
cnf(c_0_42,plain,
( equalish(X3,X4)
| ~ product2(X1,X2,X3)
| ~ product2(X1,X2,X4) ),
c_0_34 ).
cnf(c_0_43,axiom,
product2(X1,X1,X1),
product2_idempotence ).
cnf(c_0_44,negated_conjecture,
( product2(X4,X2,X1)
| ~ product1(X1,X2,X3)
| ~ product1(X3,X1,X4) ),
c_0_35 ).
cnf(c_0_45,plain,
( product1(e_1,e_4,e_2)
| product1(e_1,e_4,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_46,plain,
~ equalish(e_4,e_3),
inference(fof_simplification,[status(thm)],[e_4_is_not_e_3]) ).
cnf(c_0_47,plain,
( product1(e_1,e_3,e_4)
| product1(e_1,e_3,e_3)
| product1(e_1,e_3,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_39]),c_0_40]) ).
cnf(c_0_48,plain,
~ equalish(e_3,e_4),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_4]) ).
cnf(c_0_49,plain,
( product1(e_4,e_1,e_1)
| product1(e_4,e_1,e_2)
| product1(e_4,e_1,e_3)
| product1(e_4,e_1,e_4) ),
inference(spm,[status(thm)],[c_0_41,c_0_19]) ).
cnf(c_0_50,plain,
( equalish(X1,X2)
| ~ product2(X2,X2,X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_51,negated_conjecture,
( product2(e_3,X1,e_4)
| product1(e_1,e_4,e_2)
| ~ product1(e_4,X1,e_1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_52,plain,
~ equalish(e_4,e_3),
c_0_46 ).
cnf(c_0_53,negated_conjecture,
( product2(e_4,X1,e_3)
| product1(e_1,e_3,e_2)
| product1(e_1,e_3,e_3)
| ~ product1(e_3,X1,e_1) ),
inference(spm,[status(thm)],[c_0_44,c_0_47]) ).
cnf(c_0_54,plain,
~ equalish(e_3,e_4),
c_0_48 ).
cnf(c_0_55,plain,
~ equalish(e_1,e_3),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_3]) ).
cnf(c_0_56,plain,
( product1(e_4,e_1,e_4)
| product1(e_4,e_1,e_3)
| product1(e_4,e_1,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_49]),c_0_30]) ).
cnf(c_0_57,negated_conjecture,
( product1(e_1,e_4,e_2)
| ~ product1(e_4,e_3,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_58,negated_conjecture,
( product1(e_1,e_3,e_3)
| product1(e_1,e_3,e_2)
| ~ product1(e_3,e_4,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_53]),c_0_54]) ).
cnf(c_0_59,plain,
~ equalish(e_1,e_3),
c_0_55 ).
cnf(c_0_60,plain,
( product1(e_4,e_1,e_2)
| product1(e_4,e_1,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_56]),c_0_38]) ).
cnf(c_0_61,negated_conjecture,
( equalish(X1,e_4)
| ~ product1(e_4,e_3,e_1)
| ~ product1(e_1,X1,e_2) ),
inference(spm,[status(thm)],[c_0_21,c_0_57]) ).
cnf(c_0_62,negated_conjecture,
( product1(e_1,e_3,e_2)
| ~ product1(e_3,e_4,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_58]),c_0_59]) ).
cnf(c_0_63,negated_conjecture,
( product2(e_3,X1,e_1)
| product1(e_4,e_1,e_2)
| ~ product1(e_1,X1,e_4) ),
inference(spm,[status(thm)],[c_0_44,c_0_60]) ).
cnf(c_0_64,negated_conjecture,
( ~ product1(e_4,e_3,e_1)
| ~ product1(e_3,e_4,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_54]) ).
cnf(c_0_65,plain,
( product1(e_4,e_3,e_1)
| product1(e_4,e_3,e_2)
| product1(e_4,e_3,e_3)
| product1(e_4,e_3,e_4) ),
inference(spm,[status(thm)],[c_0_32,c_0_19]) ).
cnf(c_0_66,negated_conjecture,
( product1(e_4,e_1,e_2)
| ~ product1(e_1,e_3,e_4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_63]),c_0_59]) ).
cnf(c_0_67,negated_conjecture,
( product1(e_4,e_3,e_4)
| product1(e_4,e_3,e_3)
| product1(e_4,e_3,e_2)
| ~ product1(e_3,e_4,e_1) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_68,negated_conjecture,
( product1(e_1,e_3,e_2)
| product1(e_1,e_3,e_3)
| product1(e_4,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_66,c_0_47]) ).
cnf(c_0_69,negated_conjecture,
( product1(e_4,e_3,e_2)
| product1(e_4,e_3,e_3)
| ~ product1(e_3,e_4,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_67]),c_0_54]) ).
cnf(c_0_70,negated_conjecture,
( product1(e_4,e_1,e_2)
| product1(e_1,e_3,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_68]),c_0_59]) ).
cnf(c_0_71,negated_conjecture,
( product1(e_4,e_3,e_2)
| ~ product1(e_3,e_4,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_69]),c_0_52]) ).
cnf(c_0_72,negated_conjecture,
( product1(e_4,e_1,e_2)
| equalish(X1,e_1)
| ~ product1(X1,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_27,c_0_70]) ).
cnf(c_0_73,negated_conjecture,
( equalish(X1,e_3)
| ~ product1(e_3,e_4,e_1)
| ~ product1(e_4,X1,e_2) ),
inference(spm,[status(thm)],[c_0_21,c_0_71]) ).
cnf(c_0_74,negated_conjecture,
( product1(e_4,e_1,e_2)
| ~ product1(e_3,e_4,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_71]),c_0_30]) ).
cnf(c_0_75,plain,
( product1(e_3,e_4,e_1)
| product1(e_3,e_4,e_2)
| product1(e_3,e_4,e_3)
| product1(e_3,e_4,e_4) ),
inference(spm,[status(thm)],[c_0_23,c_0_26]) ).
cnf(c_0_76,negated_conjecture,
~ product1(e_3,e_4,e_1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_59]) ).
cnf(c_0_77,plain,
( product1(e_3,e_4,e_4)
| product1(e_3,e_4,e_3)
| product1(e_3,e_4,e_2) ),
inference(sr,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_78,plain,
( product1(e_3,e_4,e_2)
| product1(e_3,e_4,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_77]),c_0_54]) ).
cnf(c_0_79,plain,
product1(e_3,e_4,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_78]),c_0_52]) ).
cnf(c_0_80,plain,
( equalish(X1,e_3)
| ~ product1(X1,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_27,c_0_79]) ).
cnf(c_0_81,negated_conjecture,
~ product1(e_4,e_3,e_1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_57]),c_0_59]) ).
cnf(c_0_82,plain,
( product1(e_4,e_3,e_4)
| product1(e_4,e_3,e_3)
| product1(e_4,e_3,e_2) ),
inference(sr,[status(thm)],[c_0_65,c_0_81]) ).
cnf(c_0_83,plain,
( product1(e_4,e_3,e_2)
| product1(e_4,e_3,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_82]),c_0_54]) ).
cnf(c_0_84,plain,
product1(e_4,e_3,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_83]),c_0_52]) ).
cnf(c_0_85,plain,
( equalish(X1,e_3)
| ~ product1(e_4,X1,e_2) ),
inference(spm,[status(thm)],[c_0_21,c_0_84]) ).
cnf(c_0_86,negated_conjecture,
product1(e_4,e_1,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_84]),c_0_30]) ).
cnf(c_0_87,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GRP124-9.004 : TPTP v8.2.0. Bugfixed v1.2.1.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sun May 19 04:33:38 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 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
% 0.19/0.49 # Version: 3.1.0
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # new_bool_3 with pid 15548 completed with status 0
% 0.19/0.49 # Result found by new_bool_3
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FGUNS-FFSS00-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.49 # SAT001_MinMin_p005000_rr_RG with pid 15552 completed with status 0
% 0.19/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FGUNS-FFSS00-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Unsatisfiable
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 29
% 0.19/0.49 # Removed by relevancy pruning/SinE : 2
% 0.19/0.49 # Initial clauses : 27
% 0.19/0.49 # Removed in clause preprocessing : 0
% 0.19/0.49 # Initial clauses in saturation : 27
% 0.19/0.49 # Processed clauses : 335
% 0.19/0.49 # ...of these trivial : 0
% 0.19/0.49 # ...subsumed : 70
% 0.19/0.49 # ...remaining for further processing : 265
% 0.19/0.49 # Other redundant clauses eliminated : 0
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 106
% 0.19/0.49 # Backward-rewritten : 16
% 0.19/0.49 # Generated clauses : 722
% 0.19/0.49 # ...of the previous two non-redundant : 597
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 0
% 0.19/0.49 # Paramodulations : 719
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 0
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 137
% 0.19/0.49 # ...of those cached : 120
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 113
% 0.19/0.49 # Positive orientable unit clauses : 10
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 18
% 0.19/0.49 # Non-unit-clauses : 85
% 0.19/0.49 # Current number of unprocessed clauses: 257
% 0.19/0.49 # ...number of literals in the above : 1109
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 152
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 3913
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 2210
% 0.19/0.49 # Non-unit clause-clause subsumptions : 104
% 0.19/0.49 # Unit Clause-clause subsumption calls : 359
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 24
% 0.19/0.49 # BW rewrite match successes : 3
% 0.19/0.49 # Condensation attempts : 0
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 11013
% 0.19/0.49 # Search garbage collected termcells : 90
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.027 s
% 0.19/0.49 # System time : 0.000 s
% 0.19/0.49 # Total time : 0.027 s
% 0.19/0.49 # Maximum resident set size: 1760 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.028 s
% 0.19/0.49 # System time : 0.002 s
% 0.19/0.49 # Total time : 0.030 s
% 0.19/0.49 # Maximum resident set size: 1752 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.49 % E exiting
%------------------------------------------------------------------------------