TSTP Solution File: GRP124-9.004 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP124-9.004 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 17:45:32 EDT 2023
% Result : Unsatisfiable 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 16
% Syntax : Number of clauses : 77 ( 28 unt; 28 nHn; 73 RR)
% Number of literals : 178 ( 0 equ; 60 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 : 57 ( 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/sandbox/tmp/tmp.JUUquOgsXm/E---3.1_22729.p',product1_total_function1) ).
cnf(element_4,axiom,
group_element(e_4),
file('/export/starexec/sandbox/tmp/tmp.JUUquOgsXm/E---3.1_22729.p',element_4) ).
cnf(product1_right_cancellation,axiom,
( equalish(X2,X4)
| ~ product1(X1,X2,X3)
| ~ product1(X1,X4,X3) ),
file('/export/starexec/sandbox/tmp/tmp.JUUquOgsXm/E---3.1_22729.p',product1_right_cancellation) ).
cnf(product1_idempotence,axiom,
product1(X1,X1,X1),
file('/export/starexec/sandbox/tmp/tmp.JUUquOgsXm/E---3.1_22729.p',product1_idempotence) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox/tmp/tmp.JUUquOgsXm/E---3.1_22729.p',element_1) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox/tmp/tmp.JUUquOgsXm/E---3.1_22729.p',element_3) ).
cnf(product1_left_cancellation,axiom,
( equalish(X1,X4)
| ~ product1(X1,X2,X3)
| ~ product1(X4,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.JUUquOgsXm/E---3.1_22729.p',product1_left_cancellation) ).
cnf(e_4_is_not_e_1,axiom,
~ equalish(e_4,e_1),
file('/export/starexec/sandbox/tmp/tmp.JUUquOgsXm/E---3.1_22729.p',e_4_is_not_e_1) ).
cnf(e_1_is_not_e_4,axiom,
~ equalish(e_1,e_4),
file('/export/starexec/sandbox/tmp/tmp.JUUquOgsXm/E---3.1_22729.p',e_1_is_not_e_4) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
file('/export/starexec/sandbox/tmp/tmp.JUUquOgsXm/E---3.1_22729.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/sandbox/tmp/tmp.JUUquOgsXm/E---3.1_22729.p',product2_total_function2) ).
cnf(product2_idempotence,axiom,
product2(X1,X1,X1),
file('/export/starexec/sandbox/tmp/tmp.JUUquOgsXm/E---3.1_22729.p',product2_idempotence) ).
cnf(qg2a,negated_conjecture,
( product2(X4,X2,X1)
| ~ product1(X1,X2,X3)
| ~ product1(X3,X1,X4) ),
file('/export/starexec/sandbox/tmp/tmp.JUUquOgsXm/E---3.1_22729.p',qg2a) ).
cnf(e_4_is_not_e_3,axiom,
~ equalish(e_4,e_3),
file('/export/starexec/sandbox/tmp/tmp.JUUquOgsXm/E---3.1_22729.p',e_4_is_not_e_3) ).
cnf(e_3_is_not_e_4,axiom,
~ equalish(e_3,e_4),
file('/export/starexec/sandbox/tmp/tmp.JUUquOgsXm/E---3.1_22729.p',e_3_is_not_e_4) ).
cnf(e_1_is_not_e_3,axiom,
~ equalish(e_1,e_3),
file('/export/starexec/sandbox/tmp/tmp.JUUquOgsXm/E---3.1_22729.p',e_1_is_not_e_3) ).
cnf(c_0_16,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) ),
product1_total_function1 ).
cnf(c_0_17,axiom,
group_element(e_4),
element_4 ).
cnf(c_0_18,axiom,
( equalish(X2,X4)
| ~ product1(X1,X2,X3)
| ~ product1(X1,X4,X3) ),
product1_right_cancellation ).
cnf(c_0_19,axiom,
product1(X1,X1,X1),
product1_idempotence ).
cnf(c_0_20,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_16,c_0_17]) ).
cnf(c_0_21,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_22,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_23,axiom,
( equalish(X1,X4)
| ~ product1(X1,X2,X3)
| ~ product1(X4,X2,X3) ),
product1_left_cancellation ).
cnf(c_0_24,plain,
( equalish(X1,X2)
| ~ product1(X2,X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,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_20,c_0_21]) ).
cnf(c_0_26,axiom,
~ equalish(e_4,e_1),
e_4_is_not_e_1 ).
cnf(c_0_27,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_16,c_0_22]) ).
cnf(c_0_28,plain,
( equalish(X1,X2)
| ~ product1(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_19]) ).
cnf(c_0_29,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_24,c_0_25]),c_0_26]) ).
cnf(c_0_30,axiom,
~ equalish(e_1,e_4),
e_1_is_not_e_4 ).
cnf(c_0_31,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_27,c_0_21]) ).
cnf(c_0_32,axiom,
~ equalish(e_3,e_1),
e_3_is_not_e_1 ).
cnf(c_0_33,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_16,c_0_21]) ).
cnf(c_0_34,axiom,
( equalish(X3,X4)
| ~ product2(X1,X2,X3)
| ~ product2(X1,X2,X4) ),
product2_total_function2 ).
cnf(c_0_35,axiom,
product2(X1,X1,X1),
product2_idempotence ).
cnf(c_0_36,negated_conjecture,
( product2(X4,X2,X1)
| ~ product1(X1,X2,X3)
| ~ product1(X3,X1,X4) ),
qg2a ).
cnf(c_0_37,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_28,c_0_29]),c_0_30]) ).
cnf(c_0_38,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_24,c_0_31]),c_0_32]) ).
cnf(c_0_39,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_33,c_0_17]) ).
cnf(c_0_40,plain,
( equalish(X1,X2)
| ~ product2(X2,X2,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,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_36,c_0_37]) ).
cnf(c_0_42,axiom,
~ equalish(e_4,e_3),
e_4_is_not_e_3 ).
cnf(c_0_43,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_36,c_0_38]) ).
cnf(c_0_44,axiom,
~ equalish(e_3,e_4),
e_3_is_not_e_4 ).
cnf(c_0_45,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_28,c_0_39]),c_0_26]) ).
cnf(c_0_46,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_40,c_0_41]),c_0_42]) ).
cnf(c_0_47,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_40,c_0_43]),c_0_44]) ).
cnf(c_0_48,axiom,
~ equalish(e_1,e_3),
e_1_is_not_e_3 ).
cnf(c_0_49,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_24,c_0_45]),c_0_30]) ).
cnf(c_0_50,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_18,c_0_46]) ).
cnf(c_0_51,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_28,c_0_47]),c_0_48]) ).
cnf(c_0_52,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_36,c_0_49]) ).
cnf(c_0_53,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_50,c_0_51]),c_0_44]) ).
cnf(c_0_54,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_27,c_0_17]) ).
cnf(c_0_55,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_40,c_0_52]),c_0_48]) ).
cnf(c_0_56,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_53,c_0_54]) ).
cnf(c_0_57,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_55,c_0_38]) ).
cnf(c_0_58,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_24,c_0_56]),c_0_44]) ).
cnf(c_0_59,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_28,c_0_57]),c_0_48]) ).
cnf(c_0_60,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_28,c_0_58]),c_0_42]) ).
cnf(c_0_61,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_23,c_0_59]) ).
cnf(c_0_62,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_18,c_0_60]) ).
cnf(c_0_63,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_61,c_0_60]),c_0_26]) ).
cnf(c_0_64,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_20,c_0_22]) ).
cnf(c_0_65,negated_conjecture,
~ product1(e_3,e_4,e_1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_48]) ).
cnf(c_0_66,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_64,c_0_65]) ).
cnf(c_0_67,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_28,c_0_66]),c_0_44]) ).
cnf(c_0_68,plain,
product1(e_3,e_4,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_67]),c_0_42]) ).
cnf(c_0_69,plain,
( equalish(X1,e_3)
| ~ product1(X1,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_23,c_0_68]) ).
cnf(c_0_70,negated_conjecture,
~ product1(e_4,e_3,e_1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_46]),c_0_48]) ).
cnf(c_0_71,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_54,c_0_70]) ).
cnf(c_0_72,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_24,c_0_71]),c_0_44]) ).
cnf(c_0_73,plain,
product1(e_4,e_3,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_72]),c_0_42]) ).
cnf(c_0_74,plain,
( equalish(X1,e_3)
| ~ product1(e_4,X1,e_2) ),
inference(spm,[status(thm)],[c_0_18,c_0_73]) ).
cnf(c_0_75,negated_conjecture,
product1(e_4,e_1,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_73]),c_0_26]) ).
cnf(c_0_76,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : GRP124-9.004 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n008.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 : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Oct 3 02:24:28 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.JUUquOgsXm/E---3.1_22729.p
% 0.15/0.44 # Version: 3.1pre001
% 0.15/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # Starting sh5l with 300s (1) cores
% 0.15/0.44 # new_bool_3 with pid 22807 completed with status 0
% 0.15/0.44 # Result found by new_bool_3
% 0.15/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44 # Search class: FGUNS-FFSS00-SFFFFFNN
% 0.15/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.44 # SAT001_MinMin_p005000_rr_RG with pid 22811 completed with status 0
% 0.15/0.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44 # Search class: FGUNS-FFSS00-SFFFFFNN
% 0.15/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.44 # Preprocessing time : 0.001 s
% 0.15/0.44 # Presaturation interreduction done
% 0.15/0.44
% 0.15/0.44 # Proof found!
% 0.15/0.44 # SZS status Unsatisfiable
% 0.15/0.44 # SZS output start CNFRefutation
% See solution above
% 0.15/0.44 # Parsed axioms : 29
% 0.15/0.44 # Removed by relevancy pruning/SinE : 2
% 0.15/0.44 # Initial clauses : 27
% 0.15/0.44 # Removed in clause preprocessing : 0
% 0.15/0.44 # Initial clauses in saturation : 27
% 0.15/0.44 # Processed clauses : 335
% 0.15/0.44 # ...of these trivial : 0
% 0.15/0.44 # ...subsumed : 70
% 0.15/0.44 # ...remaining for further processing : 265
% 0.15/0.44 # Other redundant clauses eliminated : 0
% 0.15/0.44 # Clauses deleted for lack of memory : 0
% 0.15/0.44 # Backward-subsumed : 106
% 0.15/0.44 # Backward-rewritten : 16
% 0.15/0.44 # Generated clauses : 722
% 0.15/0.44 # ...of the previous two non-redundant : 597
% 0.15/0.44 # ...aggressively subsumed : 0
% 0.15/0.44 # Contextual simplify-reflections : 0
% 0.15/0.44 # Paramodulations : 719
% 0.15/0.44 # Factorizations : 0
% 0.15/0.44 # NegExts : 0
% 0.15/0.44 # Equation resolutions : 0
% 0.15/0.44 # Total rewrite steps : 137
% 0.15/0.44 # Propositional unsat checks : 0
% 0.15/0.44 # Propositional check models : 0
% 0.15/0.44 # Propositional check unsatisfiable : 0
% 0.15/0.44 # Propositional clauses : 0
% 0.15/0.44 # Propositional clauses after purity: 0
% 0.15/0.44 # Propositional unsat core size : 0
% 0.15/0.44 # Propositional preprocessing time : 0.000
% 0.15/0.44 # Propositional encoding time : 0.000
% 0.15/0.44 # Propositional solver time : 0.000
% 0.15/0.44 # Success case prop preproc time : 0.000
% 0.15/0.44 # Success case prop encoding time : 0.000
% 0.15/0.44 # Success case prop solver time : 0.000
% 0.15/0.44 # Current number of processed clauses : 113
% 0.15/0.44 # Positive orientable unit clauses : 10
% 0.15/0.44 # Positive unorientable unit clauses: 0
% 0.15/0.44 # Negative unit clauses : 18
% 0.15/0.44 # Non-unit-clauses : 85
% 0.15/0.44 # Current number of unprocessed clauses: 257
% 0.15/0.44 # ...number of literals in the above : 1109
% 0.15/0.44 # Current number of archived formulas : 0
% 0.15/0.44 # Current number of archived clauses : 152
% 0.15/0.44 # Clause-clause subsumption calls (NU) : 3913
% 0.15/0.44 # Rec. Clause-clause subsumption calls : 2210
% 0.15/0.44 # Non-unit clause-clause subsumptions : 104
% 0.15/0.44 # Unit Clause-clause subsumption calls : 359
% 0.15/0.44 # Rewrite failures with RHS unbound : 0
% 0.15/0.44 # BW rewrite match attempts : 24
% 0.15/0.44 # BW rewrite match successes : 3
% 0.15/0.44 # Condensation attempts : 0
% 0.15/0.44 # Condensation successes : 0
% 0.15/0.44 # Termbank termtop insertions : 10887
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.022 s
% 0.15/0.44 # System time : 0.003 s
% 0.15/0.44 # Total time : 0.025 s
% 0.15/0.44 # Maximum resident set size: 1624 pages
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.022 s
% 0.15/0.44 # System time : 0.006 s
% 0.15/0.44 # Total time : 0.028 s
% 0.15/0.44 # Maximum resident set size: 1692 pages
% 0.15/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------