TSTP Solution File: GRP390-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP390-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:47:49 EDT 2024
% Result : Unsatisfiable 1.55s 0.64s
% Output : CNFRefutation 1.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 14
% Syntax : Number of clauses : 68 ( 21 unt; 40 nHn; 54 RR)
% Number of literals : 166 ( 165 equ; 63 neg)
% Maximal clause size : 12 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 51 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(prove_this_19,negated_conjecture,
( multiply(sk_c2,sk_c3) = sk_c8
| multiply(sk_c4,sk_c9) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_19) ).
cnf(prove_this_25,negated_conjecture,
( inverse(sk_c2) = sk_c3
| multiply(sk_c4,sk_c9) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_25) ).
cnf(prove_this_26,negated_conjecture,
( inverse(sk_c2) = sk_c3
| inverse(sk_c4) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_26) ).
cnf(prove_this_20,negated_conjecture,
( multiply(sk_c2,sk_c3) = sk_c8
| inverse(sk_c4) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_20) ).
cnf(prove_this_18,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c9
| multiply(sk_c6,sk_c8) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_18) ).
cnf(prove_this_12,negated_conjecture,
( inverse(sk_c1) = sk_c9
| multiply(sk_c6,sk_c8) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_12) ).
cnf(prove_this_4,negated_conjecture,
( inverse(sk_c8) = sk_c7
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_4) ).
cnf(prove_this_17,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c9
| inverse(sk_c6) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_17) ).
cnf(prove_this_3,negated_conjecture,
( inverse(sk_c8) = sk_c7
| multiply(sk_c5,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_3) ).
cnf(prove_this_11,negated_conjecture,
( inverse(sk_c1) = sk_c9
| inverse(sk_c6) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_37,negated_conjecture,
( inverse(sk_c8) != sk_c7
| inverse(X1) != sk_c9
| multiply(X1,sk_c8) != sk_c9
| multiply(X2,X3) != sk_c8
| inverse(X2) != X3
| multiply(X3,sk_c7) != sk_c8
| multiply(X4,sk_c9) != sk_c8
| inverse(X4) != sk_c9
| multiply(X5,sk_c8) != sk_c7
| inverse(X5) != sk_c8
| inverse(X6) != sk_c9
| multiply(X6,sk_c8) != sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_37) ).
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_c2,sk_c3) = sk_c8
| multiply(sk_c4,sk_c9) = sk_c8 ),
prove_this_19 ).
cnf(c_0_19,negated_conjecture,
( multiply(inverse(sk_c2),sk_c8) = sk_c3
| multiply(sk_c4,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( inverse(sk_c2) = sk_c3
| multiply(sk_c4,sk_c9) = sk_c8 ),
prove_this_25 ).
cnf(c_0_21,negated_conjecture,
( multiply(sk_c4,sk_c9) = sk_c8
| multiply(sk_c3,sk_c8) = sk_c3 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( inverse(sk_c2) = sk_c3
| inverse(sk_c4) = sk_c9 ),
prove_this_26 ).
cnf(c_0_23,negated_conjecture,
( multiply(inverse(sk_c4),sk_c8) = sk_c9
| multiply(sk_c3,sk_c8) = sk_c3 ),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( multiply(sk_c2,sk_c3) = sk_c8
| inverse(sk_c4) = sk_c9 ),
prove_this_20 ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c3,multiply(sk_c2,X1)) = X1
| inverse(sk_c4) = sk_c9 ),
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( multiply(sk_c2,sk_c3) = sk_c8
| multiply(sk_c3,sk_c8) = sk_c3
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c9
| multiply(sk_c3,sk_c8) = sk_c3
| inverse(sk_c4) = sk_c9 ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c9
| multiply(sk_c6,sk_c8) = sk_c9 ),
prove_this_18 ).
cnf(c_0_29,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_17]) ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c3,sk_c8) = sk_c3
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_23,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( multiply(inverse(sk_c1),sk_c9) = sk_c8
| multiply(sk_c6,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_17,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( inverse(sk_c1) = sk_c9
| multiply(sk_c6,sk_c8) = sk_c9 ),
prove_this_12 ).
cnf(c_0_33,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c9
| identity = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_30]),c_0_15]) ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c9
| multiply(sk_c9,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_33]),c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( inverse(sk_c8) = sk_c7
| inverse(sk_c5) = sk_c8 ),
prove_this_4 ).
cnf(c_0_38,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
identity = sk_c8,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_34]),c_0_15])]) ).
cnf(c_0_40,negated_conjecture,
( multiply(inverse(sk_c6),sk_c9) = sk_c8
| multiply(sk_c9,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_17,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c9
| inverse(sk_c6) = sk_c9 ),
prove_this_17 ).
cnf(c_0_42,negated_conjecture,
( inverse(sk_c8) = sk_c7
| inverse(sk_c8) = sk_c5 ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,plain,
inverse(sk_c8) = sk_c8,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_39]) ).
cnf(c_0_44,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c9
| multiply(sk_c9,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( inverse(sk_c8) = sk_c7
| multiply(sk_c5,sk_c8) = sk_c7 ),
prove_this_3 ).
cnf(c_0_46,negated_conjecture,
( inverse(sk_c8) = sk_c5
| sk_c7 = sk_c8 ),
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
( multiply(inverse(sk_c1),sk_c9) = sk_c8
| multiply(sk_c9,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_17,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
( inverse(sk_c1) = sk_c9
| inverse(sk_c6) = sk_c9 ),
prove_this_11 ).
cnf(c_0_49,negated_conjecture,
( inverse(sk_c8) != sk_c7
| inverse(X1) != sk_c9
| multiply(X1,sk_c8) != sk_c9
| multiply(X2,X3) != sk_c8
| inverse(X2) != X3
| multiply(X3,sk_c7) != sk_c8
| multiply(X4,sk_c9) != sk_c8
| inverse(X4) != sk_c9
| multiply(X5,sk_c8) != sk_c7
| inverse(X5) != sk_c8
| inverse(X6) != sk_c9
| multiply(X6,sk_c8) != sk_c9 ),
inference(fof_simplification,[status(thm)],[prove_this_37]) ).
cnf(c_0_50,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c7
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_45,c_0_43]) ).
cnf(c_0_51,negated_conjecture,
( sk_c7 = sk_c8
| sk_c5 = sk_c8 ),
inference(spm,[status(thm)],[c_0_43,c_0_46]) ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c9,sk_c9) = sk_c8
| inverse(sk_c6) = sk_c9 ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,negated_conjecture,
( inverse(sk_c8) != sk_c7
| inverse(X1) != sk_c9
| multiply(X1,sk_c8) != sk_c9
| multiply(X2,X3) != sk_c8
| inverse(X2) != X3
| multiply(X3,sk_c7) != sk_c8
| multiply(X4,sk_c9) != sk_c8
| inverse(X4) != sk_c9
| multiply(X5,sk_c8) != sk_c7
| inverse(X5) != sk_c8
| inverse(X6) != sk_c9
| multiply(X6,sk_c8) != sk_c9 ),
c_0_49 ).
cnf(c_0_54,negated_conjecture,
( multiply(sk_c8,sk_c8) = sk_c7
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,negated_conjecture,
multiply(sk_c9,sk_c9) = sk_c8,
inference(spm,[status(thm)],[c_0_40,c_0_52]) ).
cnf(c_0_56,negated_conjecture,
( multiply(inverse(X1),sk_c7) != sk_c8
| multiply(X1,inverse(X1)) != sk_c8
| multiply(X2,sk_c8) != sk_c9
| multiply(X3,sk_c8) != sk_c7
| multiply(X4,sk_c9) != sk_c8
| multiply(X5,sk_c8) != sk_c9
| inverse(sk_c8) != sk_c7
| inverse(X2) != sk_c9
| inverse(X3) != sk_c8
| inverse(X4) != sk_c9
| inverse(X5) != sk_c9 ),
inference(er,[status(thm)],[c_0_53]) ).
cnf(c_0_57,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c8
| sk_c7 = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_54]),c_0_43]) ).
cnf(c_0_58,plain,
multiply(inverse(X1),X1) = sk_c8,
inference(rw,[status(thm)],[c_0_15,c_0_39]) ).
cnf(c_0_59,negated_conjecture,
multiply(inverse(sk_c9),sk_c8) = sk_c9,
inference(spm,[status(thm)],[c_0_17,c_0_55]) ).
cnf(c_0_60,plain,
multiply(X1,sk_c8) = X1,
inference(rw,[status(thm)],[c_0_33,c_0_39]) ).
cnf(c_0_61,negated_conjecture,
( multiply(inverse(X1),sk_c7) != sk_c8
| multiply(X1,inverse(X1)) != sk_c8
| multiply(X2,sk_c8) != sk_c9
| multiply(X3,sk_c8) != sk_c7
| multiply(X4,sk_c9) != sk_c8
| multiply(X5,sk_c8) != sk_c9
| inverse(X2) != sk_c9
| inverse(X3) != sk_c8
| inverse(X4) != sk_c9
| inverse(X5) != sk_c9
| sk_c7 != sk_c8 ),
inference(rw,[status(thm)],[c_0_56,c_0_43]) ).
cnf(c_0_62,negated_conjecture,
sk_c7 = sk_c8,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_57]),c_0_15]),c_0_39])]) ).
cnf(c_0_63,plain,
multiply(X1,inverse(X1)) = sk_c8,
inference(spm,[status(thm)],[c_0_58,c_0_36]) ).
cnf(c_0_64,negated_conjecture,
inverse(sk_c9) = sk_c9,
inference(rw,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_65,negated_conjecture,
( multiply(X1,sk_c9) != sk_c8
| inverse(X2) != sk_c8
| inverse(X1) != sk_c9 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62]),c_0_62]),c_0_62])]),c_0_60]),c_0_63]),c_0_60]),c_0_60]),c_0_60])])])])]),c_0_64]),c_0_43])]) ).
cnf(c_0_66,negated_conjecture,
( multiply(X1,sk_c9) != sk_c8
| inverse(X1) != sk_c9 ),
inference(spm,[status(thm)],[c_0_65,c_0_43]) ).
cnf(c_0_67,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_64]),c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP390-1 : TPTP v8.2.0. Released v2.5.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 05:32:22 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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/benchmark/theBenchmark.p
% 1.55/0.64 # Version: 3.1.0
% 1.55/0.64 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.55/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.55/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.55/0.64 # Starting new_bool_3 with 300s (1) cores
% 1.55/0.64 # Starting new_bool_1 with 300s (1) cores
% 1.55/0.64 # Starting sh5l with 300s (1) cores
% 1.55/0.64 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 16556 completed with status 0
% 1.55/0.64 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 1.55/0.64 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.55/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.55/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.55/0.64 # No SInE strategy applied
% 1.55/0.64 # Search class: FGHPS-FFMM21-SFFFFFNN
% 1.55/0.64 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.55/0.64 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.55/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1.55/0.64 # Starting new_bool_3 with 136s (1) cores
% 1.55/0.64 # Starting new_bool_1 with 136s (1) cores
% 1.55/0.64 # Starting sh5l with 136s (1) cores
% 1.55/0.64 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 16561 completed with status 0
% 1.55/0.64 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 1.55/0.64 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.55/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.55/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.55/0.64 # No SInE strategy applied
% 1.55/0.64 # Search class: FGHPS-FFMM21-SFFFFFNN
% 1.55/0.64 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.55/0.64 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.55/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1.55/0.64 # Preprocessing time : 0.001 s
% 1.55/0.64 # Presaturation interreduction done
% 1.55/0.64
% 1.55/0.64 # Proof found!
% 1.55/0.64 # SZS status Unsatisfiable
% 1.55/0.64 # SZS output start CNFRefutation
% See solution above
% 1.55/0.64 # Parsed axioms : 40
% 1.55/0.64 # Removed by relevancy pruning/SinE : 0
% 1.55/0.64 # Initial clauses : 40
% 1.55/0.64 # Removed in clause preprocessing : 0
% 1.55/0.64 # Initial clauses in saturation : 40
% 1.55/0.64 # Processed clauses : 2286
% 1.55/0.64 # ...of these trivial : 199
% 1.55/0.64 # ...subsumed : 1290
% 1.55/0.64 # ...remaining for further processing : 797
% 1.55/0.64 # Other redundant clauses eliminated : 45
% 1.55/0.64 # Clauses deleted for lack of memory : 0
% 1.55/0.64 # Backward-subsumed : 110
% 1.55/0.64 # Backward-rewritten : 606
% 1.55/0.64 # Generated clauses : 8189
% 1.55/0.64 # ...of the previous two non-redundant : 7869
% 1.55/0.64 # ...aggressively subsumed : 0
% 1.55/0.64 # Contextual simplify-reflections : 21
% 1.55/0.64 # Paramodulations : 8142
% 1.55/0.64 # Factorizations : 4
% 1.55/0.64 # NegExts : 0
% 1.55/0.64 # Equation resolutions : 45
% 1.55/0.64 # Disequality decompositions : 0
% 1.55/0.64 # Total rewrite steps : 3262
% 1.55/0.64 # ...of those cached : 3113
% 1.55/0.64 # Propositional unsat checks : 0
% 1.55/0.64 # Propositional check models : 0
% 1.55/0.64 # Propositional check unsatisfiable : 0
% 1.55/0.64 # Propositional clauses : 0
% 1.55/0.64 # Propositional clauses after purity: 0
% 1.55/0.64 # Propositional unsat core size : 0
% 1.55/0.64 # Propositional preprocessing time : 0.000
% 1.55/0.64 # Propositional encoding time : 0.000
% 1.55/0.64 # Propositional solver time : 0.000
% 1.55/0.64 # Success case prop preproc time : 0.000
% 1.55/0.64 # Success case prop encoding time : 0.000
% 1.55/0.64 # Success case prop solver time : 0.000
% 1.55/0.64 # Current number of processed clauses : 35
% 1.55/0.64 # Positive orientable unit clauses : 18
% 1.55/0.64 # Positive unorientable unit clauses: 0
% 1.55/0.64 # Negative unit clauses : 0
% 1.55/0.64 # Non-unit-clauses : 17
% 1.55/0.64 # Current number of unprocessed clauses: 2584
% 1.55/0.64 # ...number of literals in the above : 16114
% 1.55/0.64 # Current number of archived formulas : 0
% 1.55/0.64 # Current number of archived clauses : 756
% 1.55/0.64 # Clause-clause subsumption calls (NU) : 16776
% 1.55/0.64 # Rec. Clause-clause subsumption calls : 7427
% 1.55/0.64 # Non-unit clause-clause subsumptions : 1399
% 1.55/0.64 # Unit Clause-clause subsumption calls : 719
% 1.55/0.64 # Rewrite failures with RHS unbound : 0
% 1.55/0.64 # BW rewrite match attempts : 49
% 1.55/0.64 # BW rewrite match successes : 42
% 1.55/0.64 # Condensation attempts : 0
% 1.55/0.64 # Condensation successes : 0
% 1.55/0.64 # Termbank termtop insertions : 121543
% 1.55/0.64 # Search garbage collected termcells : 34
% 1.55/0.64
% 1.55/0.64 # -------------------------------------------------
% 1.55/0.64 # User time : 0.147 s
% 1.55/0.64 # System time : 0.010 s
% 1.55/0.64 # Total time : 0.157 s
% 1.55/0.64 # Maximum resident set size: 1652 pages
% 1.55/0.64
% 1.55/0.64 # -------------------------------------------------
% 1.55/0.64 # User time : 0.752 s
% 1.55/0.64 # System time : 0.022 s
% 1.55/0.64 # Total time : 0.774 s
% 1.55/0.64 # Maximum resident set size: 1716 pages
% 1.55/0.64 % E---3.1 exiting
% 1.55/0.64 % E exiting
%------------------------------------------------------------------------------