TSTP Solution File: GRP222-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP222-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:39:21 EDT 2023
% Result : Unsatisfiable 0.20s 0.54s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 14
% Syntax : Number of clauses : 72 ( 30 unt; 35 nHn; 54 RR)
% Number of literals : 147 ( 146 equ; 42 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 47 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.grrYpPWv7H/E---3.1_16140.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/tmp/tmp.grrYpPWv7H/E---3.1_16140.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.grrYpPWv7H/E---3.1_16140.p',left_identity) ).
cnf(prove_this_8,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c7
| multiply(sk_c5,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.grrYpPWv7H/E---3.1_16140.p',prove_this_8) ).
cnf(prove_this_4,negated_conjecture,
( inverse(sk_c1) = sk_c7
| multiply(sk_c5,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.grrYpPWv7H/E---3.1_16140.p',prove_this_4) ).
cnf(prove_this_21,negated_conjecture,
( inverse(X1) != sk_c7
| multiply(X1,sk_c6) != sk_c7
| multiply(X2,X3) != sk_c6
| inverse(X2) != X3
| multiply(X3,sk_c7) != sk_c6
| multiply(X4,sk_c7) != sk_c6
| inverse(X4) != sk_c7
| inverse(X5) != sk_c7
| multiply(X5,sk_c6) != sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.grrYpPWv7H/E---3.1_16140.p',prove_this_21) ).
cnf(prove_this_7,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c7
| inverse(sk_c5) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.grrYpPWv7H/E---3.1_16140.p',prove_this_7) ).
cnf(prove_this_6,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c7
| inverse(sk_c4) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.grrYpPWv7H/E---3.1_16140.p',prove_this_6) ).
cnf(prove_this_5,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c7
| multiply(sk_c4,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox2/tmp/tmp.grrYpPWv7H/E---3.1_16140.p',prove_this_5) ).
cnf(prove_this_3,negated_conjecture,
( inverse(sk_c1) = sk_c7
| inverse(sk_c5) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.grrYpPWv7H/E---3.1_16140.p',prove_this_3) ).
cnf(prove_this_9,negated_conjecture,
( multiply(sk_c2,sk_c3) = sk_c6
| multiply(sk_c4,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox2/tmp/tmp.grrYpPWv7H/E---3.1_16140.p',prove_this_9) ).
cnf(prove_this_13,negated_conjecture,
( inverse(sk_c2) = sk_c3
| multiply(sk_c4,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox2/tmp/tmp.grrYpPWv7H/E---3.1_16140.p',prove_this_13) ).
cnf(prove_this_10,negated_conjecture,
( multiply(sk_c2,sk_c3) = sk_c6
| inverse(sk_c4) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.grrYpPWv7H/E---3.1_16140.p',prove_this_10) ).
cnf(prove_this_14,negated_conjecture,
( inverse(sk_c2) = sk_c3
| inverse(sk_c4) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.grrYpPWv7H/E---3.1_16140.p',prove_this_14) ).
cnf(c_0_14,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_15,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_16,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_17,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_18,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c7
| multiply(sk_c5,sk_c6) = sk_c7 ),
prove_this_8 ).
cnf(c_0_19,negated_conjecture,
( multiply(inverse(sk_c1),sk_c7) = sk_c6
| multiply(sk_c5,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( inverse(sk_c1) = sk_c7
| multiply(sk_c5,sk_c6) = sk_c7 ),
prove_this_4 ).
cnf(c_0_21,negated_conjecture,
( multiply(sk_c5,sk_c6) = sk_c7
| multiply(sk_c7,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( inverse(X1) != sk_c7
| multiply(X1,sk_c6) != sk_c7
| multiply(X2,X3) != sk_c6
| inverse(X2) != X3
| multiply(X3,sk_c7) != sk_c6
| multiply(X4,sk_c7) != sk_c6
| inverse(X4) != sk_c7
| inverse(X5) != sk_c7
| multiply(X5,sk_c6) != sk_c7 ),
prove_this_21 ).
cnf(c_0_23,negated_conjecture,
( multiply(inverse(sk_c5),sk_c7) = sk_c6
| multiply(sk_c7,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c7
| inverse(sk_c5) = sk_c7 ),
prove_this_7 ).
cnf(c_0_25,negated_conjecture,
( multiply(inverse(X1),sk_c7) != sk_c6
| multiply(X1,inverse(X1)) != sk_c6
| multiply(X2,sk_c6) != sk_c7
| multiply(X3,sk_c7) != sk_c6
| multiply(X4,sk_c6) != sk_c7
| inverse(X2) != sk_c7
| inverse(X3) != sk_c7
| inverse(X4) != sk_c7 ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c7
| multiply(sk_c7,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c7
| multiply(inverse(X1),sk_c7) != sk_c6
| multiply(X1,inverse(X1)) != sk_c6
| multiply(X2,sk_c7) != sk_c6
| multiply(X3,sk_c6) != sk_c7
| inverse(X2) != sk_c7
| inverse(X3) != sk_c7 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_24]),c_0_18]) ).
cnf(c_0_28,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c7
| inverse(sk_c4) = sk_c7 ),
prove_this_6 ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c7
| multiply(sk_c4,sk_c7) = sk_c6 ),
prove_this_5 ).
cnf(c_0_30,negated_conjecture,
( multiply(inverse(sk_c1),sk_c7) = sk_c6
| multiply(sk_c7,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_17,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( inverse(sk_c1) = sk_c7
| inverse(sk_c5) = sk_c7 ),
prove_this_3 ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c2,sk_c3) = sk_c6
| multiply(sk_c4,sk_c7) = sk_c6 ),
prove_this_9 ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c7
| multiply(inverse(X1),sk_c7) != sk_c6
| multiply(X1,inverse(X1)) != sk_c6
| multiply(X2,sk_c6) != sk_c7
| inverse(X2) != sk_c7 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( multiply(sk_c7,sk_c7) = sk_c6
| inverse(sk_c5) = sk_c7 ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( multiply(inverse(sk_c2),sk_c6) = sk_c3
| multiply(sk_c4,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_17,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( inverse(sk_c2) = sk_c3
| multiply(sk_c4,sk_c7) = sk_c6 ),
prove_this_13 ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c7
| multiply(inverse(X1),sk_c7) != sk_c6
| multiply(X1,inverse(X1)) != sk_c6 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_24]),c_0_18]) ).
cnf(c_0_38,negated_conjecture,
multiply(sk_c7,sk_c7) = sk_c6,
inference(spm,[status(thm)],[c_0_23,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c4,sk_c7) = sk_c6
| multiply(sk_c3,sk_c6) = sk_c3 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
multiply(sk_c1,sk_c6) = sk_c7,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_28]),c_0_38])]),c_0_29]) ).
cnf(c_0_41,negated_conjecture,
( multiply(inverse(sk_c4),sk_c6) = sk_c7
| multiply(sk_c3,sk_c6) = sk_c3 ),
inference(spm,[status(thm)],[c_0_17,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
( multiply(sk_c2,sk_c3) = sk_c6
| inverse(sk_c4) = sk_c7 ),
prove_this_10 ).
cnf(c_0_43,negated_conjecture,
multiply(inverse(sk_c1),sk_c7) = sk_c6,
inference(spm,[status(thm)],[c_0_17,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
( multiply(sk_c2,sk_c3) = sk_c6
| multiply(sk_c3,sk_c6) = sk_c3
| multiply(sk_c7,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
multiply(inverse(sk_c1),multiply(sk_c7,X1)) = multiply(sk_c6,X1),
inference(spm,[status(thm)],[c_0_14,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
( multiply(inverse(sk_c2),sk_c6) = sk_c3
| multiply(sk_c7,sk_c6) = sk_c7
| multiply(sk_c3,sk_c6) = sk_c3 ),
inference(spm,[status(thm)],[c_0_17,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
( inverse(sk_c2) = sk_c3
| inverse(sk_c4) = sk_c7 ),
prove_this_14 ).
cnf(c_0_48,negated_conjecture,
multiply(inverse(sk_c1),sk_c6) = multiply(sk_c6,sk_c7),
inference(spm,[status(thm)],[c_0_45,c_0_38]) ).
cnf(c_0_49,negated_conjecture,
multiply(inverse(inverse(sk_c1)),sk_c6) = sk_c7,
inference(spm,[status(thm)],[c_0_17,c_0_43]) ).
cnf(c_0_50,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| multiply(sk_c3,sk_c6) = sk_c3
| inverse(sk_c4) = sk_c7 ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
multiply(inverse(sk_c1),multiply(sk_c6,X1)) = multiply(sk_c6,multiply(sk_c7,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_48]),c_0_14]) ).
cnf(c_0_52,negated_conjecture,
multiply(inverse(inverse(sk_c1)),multiply(sk_c6,X1)) = multiply(sk_c7,X1),
inference(spm,[status(thm)],[c_0_14,c_0_49]) ).
cnf(c_0_53,negated_conjecture,
( multiply(sk_c3,sk_c6) = sk_c3
| multiply(sk_c7,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_41,c_0_50]) ).
cnf(c_0_54,negated_conjecture,
multiply(sk_c7,multiply(sk_c7,X1)) = multiply(sk_c6,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_51]),c_0_52]) ).
cnf(c_0_55,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| identity = sk_c6 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_53]),c_0_15]) ).
cnf(c_0_56,negated_conjecture,
( multiply(sk_c6,sk_c6) = sk_c6
| identity = sk_c6 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_38]) ).
cnf(c_0_57,negated_conjecture,
identity = sk_c6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_56]),c_0_15])]) ).
cnf(c_0_58,plain,
multiply(inverse(X1),X1) = sk_c6,
inference(rw,[status(thm)],[c_0_15,c_0_57]) ).
cnf(c_0_59,plain,
multiply(inverse(inverse(X1)),sk_c6) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_58]) ).
cnf(c_0_60,plain,
multiply(sk_c6,X1) = X1,
inference(rw,[status(thm)],[c_0_16,c_0_57]) ).
cnf(c_0_61,negated_conjecture,
multiply(inverse(sk_c7),sk_c6) = sk_c7,
inference(spm,[status(thm)],[c_0_17,c_0_38]) ).
cnf(c_0_62,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_59]),c_0_60]) ).
cnf(c_0_63,negated_conjecture,
multiply(inverse(inverse(sk_c7)),sk_c7) = sk_c6,
inference(spm,[status(thm)],[c_0_17,c_0_61]) ).
cnf(c_0_64,plain,
multiply(X1,sk_c6) = X1,
inference(rw,[status(thm)],[c_0_59,c_0_62]) ).
cnf(c_0_65,negated_conjecture,
multiply(inverse(inverse(inverse(sk_c7))),sk_c6) = sk_c7,
inference(spm,[status(thm)],[c_0_17,c_0_63]) ).
cnf(c_0_66,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_64]),c_0_64]) ).
cnf(c_0_67,negated_conjecture,
inverse(sk_c7) = sk_c7,
inference(rw,[status(thm)],[c_0_65,c_0_59]) ).
cnf(c_0_68,plain,
multiply(X1,inverse(X1)) = sk_c6,
inference(spm,[status(thm)],[c_0_58,c_0_66]) ).
cnf(c_0_69,negated_conjecture,
( multiply(inverse(X1),sk_c7) != sk_c6
| multiply(X2,sk_c7) != sk_c6
| inverse(X2) != sk_c7 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_64]),c_0_64])])]),c_0_67])]),c_0_68])]) ).
cnf(c_0_70,negated_conjecture,
multiply(inverse(X1),sk_c7) != sk_c6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_67]),c_0_38])]) ).
cnf(c_0_71,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_67]),c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP222-1 : TPTP v8.1.2. Released v2.5.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n002.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 02:37:45 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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/tmp/tmp.grrYpPWv7H/E---3.1_16140.p
% 0.20/0.54 # Version: 3.1pre001
% 0.20/0.54 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 # Starting sh5l with 300s (1) cores
% 0.20/0.54 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 16224 completed with status 0
% 0.20/0.54 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.20/0.54 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.54 # No SInE strategy applied
% 0.20/0.54 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.20/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.54 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.20/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.20/0.54 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.54 # Starting sh5l with 136s (1) cores
% 0.20/0.54 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 16229 completed with status 0
% 0.20/0.54 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.20/0.54 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.54 # No SInE strategy applied
% 0.20/0.54 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.20/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.54 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.20/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.20/0.54 # Preprocessing time : 0.001 s
% 0.20/0.54 # Presaturation interreduction done
% 0.20/0.54
% 0.20/0.54 # Proof found!
% 0.20/0.54 # SZS status Unsatisfiable
% 0.20/0.54 # SZS output start CNFRefutation
% See solution above
% 0.20/0.54 # Parsed axioms : 24
% 0.20/0.54 # Removed by relevancy pruning/SinE : 0
% 0.20/0.54 # Initial clauses : 24
% 0.20/0.54 # Removed in clause preprocessing : 0
% 0.20/0.54 # Initial clauses in saturation : 24
% 0.20/0.54 # Processed clauses : 570
% 0.20/0.54 # ...of these trivial : 44
% 0.20/0.54 # ...subsumed : 199
% 0.20/0.54 # ...remaining for further processing : 327
% 0.20/0.54 # Other redundant clauses eliminated : 15
% 0.20/0.54 # Clauses deleted for lack of memory : 0
% 0.20/0.54 # Backward-subsumed : 47
% 0.20/0.54 # Backward-rewritten : 236
% 0.20/0.54 # Generated clauses : 1659
% 0.20/0.54 # ...of the previous two non-redundant : 1445
% 0.20/0.54 # ...aggressively subsumed : 0
% 0.20/0.54 # Contextual simplify-reflections : 8
% 0.20/0.54 # Paramodulations : 1644
% 0.20/0.54 # Factorizations : 0
% 0.20/0.54 # NegExts : 0
% 0.20/0.54 # Equation resolutions : 15
% 0.20/0.54 # Total rewrite steps : 1255
% 0.20/0.54 # Propositional unsat checks : 0
% 0.20/0.54 # Propositional check models : 0
% 0.20/0.54 # Propositional check unsatisfiable : 0
% 0.20/0.54 # Propositional clauses : 0
% 0.20/0.54 # Propositional clauses after purity: 0
% 0.20/0.54 # Propositional unsat core size : 0
% 0.20/0.54 # Propositional preprocessing time : 0.000
% 0.20/0.54 # Propositional encoding time : 0.000
% 0.20/0.54 # Propositional solver time : 0.000
% 0.20/0.54 # Success case prop preproc time : 0.000
% 0.20/0.54 # Success case prop encoding time : 0.000
% 0.20/0.54 # Success case prop solver time : 0.000
% 0.20/0.54 # Current number of processed clauses : 17
% 0.20/0.54 # Positive orientable unit clauses : 16
% 0.20/0.54 # Positive unorientable unit clauses: 0
% 0.20/0.54 # Negative unit clauses : 1
% 0.20/0.54 # Non-unit-clauses : 0
% 0.20/0.54 # Current number of unprocessed clauses: 629
% 0.20/0.54 # ...number of literals in the above : 2445
% 0.20/0.54 # Current number of archived formulas : 0
% 0.20/0.54 # Current number of archived clauses : 307
% 0.20/0.54 # Clause-clause subsumption calls (NU) : 1081
% 0.20/0.54 # Rec. Clause-clause subsumption calls : 908
% 0.20/0.54 # Non-unit clause-clause subsumptions : 217
% 0.20/0.54 # Unit Clause-clause subsumption calls : 384
% 0.20/0.54 # Rewrite failures with RHS unbound : 0
% 0.20/0.54 # BW rewrite match attempts : 173
% 0.20/0.54 # BW rewrite match successes : 67
% 0.20/0.54 # Condensation attempts : 0
% 0.20/0.54 # Condensation successes : 0
% 0.20/0.54 # Termbank termtop insertions : 20833
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.032 s
% 0.20/0.54 # System time : 0.006 s
% 0.20/0.54 # Total time : 0.038 s
% 0.20/0.54 # Maximum resident set size: 1584 pages
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.177 s
% 0.20/0.54 # System time : 0.013 s
% 0.20/0.54 # Total time : 0.190 s
% 0.20/0.54 # Maximum resident set size: 1680 pages
% 0.20/0.54 % E---3.1 exiting
% 0.20/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------