TSTP Solution File: GRP389-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP389-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:58 EDT 2023
% Result : Unsatisfiable 2.47s 0.76s
% Output : CNFRefutation 2.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 14
% Syntax : Number of clauses : 63 ( 17 unt; 36 nHn; 52 RR)
% Number of literals : 154 ( 153 equ; 59 neg)
% Maximal clause size : 15 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.dkIk0q46Id/E---3.1_9638.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.dkIk0q46Id/E---3.1_9638.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.dkIk0q46Id/E---3.1_9638.p',left_identity) ).
cnf(prove_this_34,negated_conjecture,
( multiply(sk_c2,sk_c3) = sk_c10
| multiply(sk_c7,sk_c8) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.dkIk0q46Id/E---3.1_9638.p',prove_this_34) ).
cnf(prove_this_35,negated_conjecture,
( multiply(sk_c2,sk_c3) = sk_c10
| inverse(sk_c7) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.dkIk0q46Id/E---3.1_9638.p',prove_this_35) ).
cnf(prove_this_24,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| multiply(sk_c6,sk_c10) = sk_c11 ),
file('/export/starexec/sandbox/tmp/tmp.dkIk0q46Id/E---3.1_9638.p',prove_this_24) ).
cnf(prove_this_23,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| inverse(sk_c6) = sk_c11 ),
file('/export/starexec/sandbox/tmp/tmp.dkIk0q46Id/E---3.1_9638.p',prove_this_23) ).
cnf(prove_this_44,negated_conjecture,
( inverse(sk_c2) = sk_c3
| inverse(sk_c7) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.dkIk0q46Id/E---3.1_9638.p',prove_this_44) ).
cnf(prove_this_43,negated_conjecture,
( inverse(sk_c2) = sk_c3
| multiply(sk_c7,sk_c8) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.dkIk0q46Id/E---3.1_9638.p',prove_this_43) ).
cnf(prove_this_4,negated_conjecture,
( inverse(sk_c10) = sk_c9
| inverse(sk_c5) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.dkIk0q46Id/E---3.1_9638.p',prove_this_4) ).
cnf(prove_this_15,negated_conjecture,
( inverse(sk_c1) = sk_c11
| multiply(sk_c6,sk_c10) = sk_c11 ),
file('/export/starexec/sandbox/tmp/tmp.dkIk0q46Id/E---3.1_9638.p',prove_this_15) ).
cnf(prove_this_14,negated_conjecture,
( inverse(sk_c1) = sk_c11
| inverse(sk_c6) = sk_c11 ),
file('/export/starexec/sandbox/tmp/tmp.dkIk0q46Id/E---3.1_9638.p',prove_this_14) ).
cnf(prove_this_3,negated_conjecture,
( inverse(sk_c10) = sk_c9
| multiply(sk_c5,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.dkIk0q46Id/E---3.1_9638.p',prove_this_3) ).
cnf(prove_this_55,negated_conjecture,
( inverse(sk_c10) != sk_c9
| inverse(X1) != sk_c11
| multiply(X1,sk_c10) != sk_c11
| multiply(X2,X3) != sk_c10
| inverse(X2) != X3
| multiply(X3,sk_c9) != sk_c10
| multiply(X4,sk_c11) != sk_c10
| inverse(X4) != sk_c11
| multiply(X5,sk_c10) != sk_c9
| inverse(X5) != sk_c10
| inverse(X6) != sk_c11
| multiply(X6,sk_c10) != sk_c11
| multiply(X7,X8) != sk_c10
| inverse(X7) != X8
| multiply(X8,sk_c9) != sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.dkIk0q46Id/E---3.1_9638.p',prove_this_55) ).
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_c10
| multiply(sk_c7,sk_c8) = sk_c10 ),
prove_this_34 ).
cnf(c_0_19,negated_conjecture,
( multiply(inverse(sk_c7),sk_c10) = sk_c8
| multiply(sk_c2,sk_c3) = sk_c10 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( multiply(sk_c2,sk_c3) = sk_c10
| inverse(sk_c7) = sk_c8 ),
prove_this_35 ).
cnf(c_0_21,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| multiply(sk_c6,sk_c10) = sk_c11 ),
prove_this_24 ).
cnf(c_0_22,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
( multiply(sk_c2,sk_c3) = sk_c10
| multiply(sk_c8,sk_c10) = sk_c8 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( multiply(inverse(sk_c6),sk_c11) = sk_c10
| multiply(sk_c1,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| inverse(sk_c6) = sk_c11 ),
prove_this_23 ).
cnf(c_0_26,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( inverse(sk_c2) = sk_c3
| inverse(sk_c7) = sk_c8 ),
prove_this_44 ).
cnf(c_0_28,negated_conjecture,
( multiply(inverse(sk_c2),sk_c10) = sk_c3
| multiply(sk_c8,sk_c10) = sk_c8 ),
inference(spm,[status(thm)],[c_0_17,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
( inverse(sk_c2) = sk_c3
| multiply(sk_c7,sk_c8) = sk_c10 ),
prove_this_43 ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| multiply(sk_c11,sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_26]),c_0_26]) ).
cnf(c_0_32,negated_conjecture,
( inverse(sk_c10) = sk_c9
| inverse(sk_c5) = sk_c10 ),
prove_this_4 ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c8,multiply(sk_c7,X1)) = X1
| inverse(sk_c2) = sk_c3 ),
inference(spm,[status(thm)],[c_0_17,c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c10
| multiply(sk_c8,sk_c10) = sk_c8
| multiply(sk_c3,sk_c10) = sk_c3 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
( multiply(inverse(sk_c1),sk_c11) = sk_c10
| multiply(sk_c11,sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_17,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
( inverse(sk_c1) = sk_c11
| multiply(sk_c6,sk_c10) = sk_c11 ),
prove_this_15 ).
cnf(c_0_37,negated_conjecture,
( inverse(sk_c10) = sk_c9
| inverse(sk_c10) = sk_c5 ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
( multiply(sk_c3,sk_c10) = sk_c3
| multiply(sk_c8,sk_c10) = sk_c8
| inverse(sk_c2) = sk_c3 ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c6,sk_c10) = sk_c11
| multiply(sk_c11,sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( inverse(sk_c10) = sk_c9
| sk_c5 != sk_c9 ),
inference(ef,[status(thm)],[c_0_37]) ).
cnf(c_0_41,negated_conjecture,
( multiply(sk_c8,sk_c10) = sk_c8
| multiply(sk_c3,sk_c10) = sk_c3 ),
inference(spm,[status(thm)],[c_0_28,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
( multiply(inverse(sk_c6),sk_c11) = sk_c10
| multiply(sk_c11,sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_17,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( inverse(sk_c1) = sk_c11
| inverse(sk_c6) = sk_c11 ),
prove_this_14 ).
cnf(c_0_44,negated_conjecture,
( inverse(sk_c9) = sk_c10
| sk_c5 != sk_c9 ),
inference(spm,[status(thm)],[c_0_31,c_0_40]) ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c3,sk_c10) = sk_c3
| sk_c10 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_41]),c_0_15]) ).
cnf(c_0_46,negated_conjecture,
( multiply(sk_c11,sk_c11) = sk_c10
| inverse(sk_c1) = sk_c11 ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
( inverse(sk_c10) = sk_c9
| multiply(sk_c5,sk_c10) = sk_c9 ),
prove_this_3 ).
cnf(c_0_48,negated_conjecture,
( multiply(sk_c10,sk_c9) = identity
| sk_c5 != sk_c9 ),
inference(spm,[status(thm)],[c_0_15,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
sk_c10 = identity,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_45]),c_0_15])]) ).
cnf(c_0_50,negated_conjecture,
multiply(sk_c11,sk_c11) = sk_c10,
inference(spm,[status(thm)],[c_0_35,c_0_46]) ).
cnf(c_0_51,negated_conjecture,
( inverse(sk_c10) != sk_c9
| inverse(X1) != sk_c11
| multiply(X1,sk_c10) != sk_c11
| multiply(X2,X3) != sk_c10
| inverse(X2) != X3
| multiply(X3,sk_c9) != sk_c10
| multiply(X4,sk_c11) != sk_c10
| inverse(X4) != sk_c11
| multiply(X5,sk_c10) != sk_c9
| inverse(X5) != sk_c10
| inverse(X6) != sk_c11
| multiply(X6,sk_c10) != sk_c11
| multiply(X7,X8) != sk_c10
| inverse(X7) != X8
| multiply(X8,sk_c9) != sk_c10 ),
prove_this_55 ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c5,sk_c10) = sk_c9
| multiply(sk_c9,sk_c10) = identity ),
inference(spm,[status(thm)],[c_0_15,c_0_47]) ).
cnf(c_0_53,negated_conjecture,
( sk_c9 = identity
| sk_c5 != sk_c9 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49]),c_0_16]) ).
cnf(c_0_54,negated_conjecture,
multiply(inverse(sk_c11),sk_c10) = sk_c11,
inference(spm,[status(thm)],[c_0_17,c_0_50]) ).
cnf(c_0_55,negated_conjecture,
( multiply(inverse(X1),sk_c9) != sk_c10
| multiply(inverse(X2),sk_c9) != sk_c10
| multiply(X1,inverse(X1)) != sk_c10
| multiply(X2,inverse(X2)) != sk_c10
| multiply(X3,sk_c10) != sk_c11
| multiply(X4,sk_c10) != sk_c9
| multiply(X5,sk_c11) != sk_c10
| multiply(X6,sk_c10) != sk_c11
| inverse(sk_c10) != sk_c9
| inverse(X3) != sk_c11
| inverse(X4) != sk_c10
| inverse(X5) != sk_c11
| inverse(X6) != sk_c11 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_51])]) ).
cnf(c_0_56,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_26]) ).
cnf(c_0_57,negated_conjecture,
sk_c9 = identity,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_49]),c_0_26]),c_0_49]),c_0_26]),c_0_53]) ).
cnf(c_0_58,negated_conjecture,
inverse(sk_c11) = sk_c11,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_49]),c_0_26]) ).
cnf(c_0_59,negated_conjecture,
( multiply(X1,inverse(X1)) != identity
| multiply(X2,inverse(X2)) != identity
| multiply(X3,sk_c11) != identity
| inverse(X1) != identity
| inverse(X2) != identity
| inverse(X3) != sk_c11 ),
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_49]),c_0_49]),c_0_49]),c_0_49]),c_0_49]),c_0_26]),c_0_49]),c_0_26]),c_0_49]),c_0_49]),c_0_26]),c_0_49]),c_0_56]),c_0_49])])])]),c_0_57]),c_0_26]),c_0_57]),c_0_26]),c_0_57]),c_0_58]),c_0_57]),c_0_56])]) ).
cnf(c_0_60,negated_conjecture,
( multiply(X1,inverse(X1)) != identity
| multiply(X2,sk_c11) != identity
| inverse(X1) != identity
| inverse(X2) != sk_c11 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_56]),c_0_16])]) ).
cnf(c_0_61,negated_conjecture,
( multiply(X1,sk_c11) != identity
| inverse(X1) != sk_c11 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_56]),c_0_16])]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_58]),c_0_50]),c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : GRP389-1 : TPTP v8.1.2. Released v2.5.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n028.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 02:50:07 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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/tmp/tmp.dkIk0q46Id/E---3.1_9638.p
% 2.47/0.76 # Version: 3.1pre001
% 2.47/0.76 # Preprocessing class: FSMSSMSMSSSNFFN.
% 2.47/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.47/0.76 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.47/0.76 # Starting new_bool_3 with 300s (1) cores
% 2.47/0.76 # Starting new_bool_1 with 300s (1) cores
% 2.47/0.76 # Starting sh5l with 300s (1) cores
% 2.47/0.76 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 9716 completed with status 0
% 2.47/0.76 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 2.47/0.76 # Preprocessing class: FSMSSMSMSSSNFFN.
% 2.47/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.47/0.76 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.47/0.76 # No SInE strategy applied
% 2.47/0.76 # Search class: FGHPS-FFMM21-SFFFFFNN
% 2.47/0.76 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.47/0.76 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 2.47/0.76 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 2.47/0.76 # Starting new_bool_3 with 136s (1) cores
% 2.47/0.76 # Starting new_bool_1 with 136s (1) cores
% 2.47/0.76 # Starting sh5l with 136s (1) cores
% 2.47/0.76 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 9720 completed with status 0
% 2.47/0.76 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 2.47/0.76 # Preprocessing class: FSMSSMSMSSSNFFN.
% 2.47/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.47/0.76 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.47/0.76 # No SInE strategy applied
% 2.47/0.76 # Search class: FGHPS-FFMM21-SFFFFFNN
% 2.47/0.76 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.47/0.76 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 2.47/0.76 # Preprocessing time : 0.001 s
% 2.47/0.76 # Presaturation interreduction done
% 2.47/0.76
% 2.47/0.76 # Proof found!
% 2.47/0.76 # SZS status Unsatisfiable
% 2.47/0.76 # SZS output start CNFRefutation
% See solution above
% 2.47/0.76 # Parsed axioms : 58
% 2.47/0.76 # Removed by relevancy pruning/SinE : 0
% 2.47/0.76 # Initial clauses : 58
% 2.47/0.76 # Removed in clause preprocessing : 0
% 2.47/0.76 # Initial clauses in saturation : 58
% 2.47/0.76 # Processed clauses : 5159
% 2.47/0.76 # ...of these trivial : 308
% 2.47/0.76 # ...subsumed : 3395
% 2.47/0.76 # ...remaining for further processing : 1456
% 2.47/0.76 # Other redundant clauses eliminated : 147
% 2.47/0.76 # Clauses deleted for lack of memory : 0
% 2.47/0.76 # Backward-subsumed : 145
% 2.47/0.76 # Backward-rewritten : 902
% 2.47/0.76 # Generated clauses : 20986
% 2.47/0.76 # ...of the previous two non-redundant : 19722
% 2.47/0.76 # ...aggressively subsumed : 0
% 2.47/0.76 # Contextual simplify-reflections : 110
% 2.47/0.76 # Paramodulations : 20835
% 2.47/0.76 # Factorizations : 5
% 2.47/0.76 # NegExts : 0
% 2.47/0.76 # Equation resolutions : 147
% 2.47/0.76 # Total rewrite steps : 10065
% 2.47/0.76 # Propositional unsat checks : 0
% 2.47/0.76 # Propositional check models : 0
% 2.47/0.76 # Propositional check unsatisfiable : 0
% 2.47/0.76 # Propositional clauses : 0
% 2.47/0.76 # Propositional clauses after purity: 0
% 2.47/0.76 # Propositional unsat core size : 0
% 2.47/0.76 # Propositional preprocessing time : 0.000
% 2.47/0.76 # Propositional encoding time : 0.000
% 2.47/0.76 # Propositional solver time : 0.000
% 2.47/0.76 # Success case prop preproc time : 0.000
% 2.47/0.76 # Success case prop encoding time : 0.000
% 2.47/0.76 # Success case prop solver time : 0.000
% 2.47/0.76 # Current number of processed clauses : 350
% 2.47/0.76 # Positive orientable unit clauses : 16
% 2.47/0.76 # Positive unorientable unit clauses: 0
% 2.47/0.76 # Negative unit clauses : 0
% 2.47/0.76 # Non-unit-clauses : 334
% 2.47/0.76 # Current number of unprocessed clauses: 11970
% 2.47/0.76 # ...number of literals in the above : 73423
% 2.47/0.76 # Current number of archived formulas : 0
% 2.47/0.76 # Current number of archived clauses : 1105
% 2.47/0.76 # Clause-clause subsumption calls (NU) : 86816
% 2.47/0.76 # Rec. Clause-clause subsumption calls : 56985
% 2.47/0.76 # Non-unit clause-clause subsumptions : 3640
% 2.47/0.76 # Unit Clause-clause subsumption calls : 892
% 2.47/0.76 # Rewrite failures with RHS unbound : 0
% 2.47/0.76 # BW rewrite match attempts : 39
% 2.47/0.76 # BW rewrite match successes : 38
% 2.47/0.76 # Condensation attempts : 0
% 2.47/0.76 # Condensation successes : 0
% 2.47/0.76 # Termbank termtop insertions : 321244
% 2.47/0.76
% 2.47/0.76 # -------------------------------------------------
% 2.47/0.76 # User time : 0.318 s
% 2.47/0.76 # System time : 0.013 s
% 2.47/0.76 # Total time : 0.330 s
% 2.47/0.76 # Maximum resident set size: 1676 pages
% 2.47/0.76
% 2.47/0.76 # -------------------------------------------------
% 2.47/0.76 # User time : 1.603 s
% 2.47/0.76 # System time : 0.032 s
% 2.47/0.76 # Total time : 1.635 s
% 2.47/0.76 # Maximum resident set size: 1696 pages
% 2.47/0.76 % E---3.1 exiting
% 2.47/0.76 % E---3.1 exiting
%------------------------------------------------------------------------------