TSTP Solution File: GRP212-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP212-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:46:39 EDT 2023
% Result : Unsatisfiable 3.13s 0.82s
% Output : CNFRefutation 3.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 14
% Syntax : Number of clauses : 68 ( 17 unt; 47 nHn; 56 RR)
% Number of literals : 146 ( 145 equ; 33 neg)
% Maximal clause size : 11 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.gBnIER7Hub/E---3.1_4482.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.gBnIER7Hub/E---3.1_4482.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.gBnIER7Hub/E---3.1_4482.p',left_identity) ).
cnf(prove_this_27,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c8
| multiply(sk_c4,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.gBnIER7Hub/E---3.1_4482.p',prove_this_27) ).
cnf(prove_this_26,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c8
| inverse(sk_c4) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.gBnIER7Hub/E---3.1_4482.p',prove_this_26) ).
cnf(prove_this_21,negated_conjecture,
( inverse(sk_c3) = sk_c8
| multiply(sk_c4,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.gBnIER7Hub/E---3.1_4482.p',prove_this_21) ).
cnf(prove_this_4,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| multiply(sk_c8,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.gBnIER7Hub/E---3.1_4482.p',prove_this_4) ).
cnf(prove_this_20,negated_conjecture,
( inverse(sk_c3) = sk_c8
| inverse(sk_c4) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.gBnIER7Hub/E---3.1_4482.p',prove_this_20) ).
cnf(prove_this_10,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c8,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.gBnIER7Hub/E---3.1_4482.p',prove_this_10) ).
cnf(prove_this_11,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c5,sk_c8) = sk_c6 ),
file('/export/starexec/sandbox/tmp/tmp.gBnIER7Hub/E---3.1_4482.p',prove_this_11) ).
cnf(prove_this_12,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.gBnIER7Hub/E---3.1_4482.p',prove_this_12) ).
cnf(prove_this_5,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c6 ),
file('/export/starexec/sandbox/tmp/tmp.gBnIER7Hub/E---3.1_4482.p',prove_this_5) ).
cnf(prove_this_6,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.gBnIER7Hub/E---3.1_4482.p',prove_this_6) ).
cnf(prove_this_31,negated_conjecture,
( multiply(X1,X2) != sk_c8
| inverse(X1) != X2
| multiply(X2,sk_c7) != sk_c8
| inverse(X3) != sk_c8
| multiply(X3,sk_c7) != sk_c8
| inverse(sk_c8) != sk_c7
| inverse(X4) != sk_c8
| multiply(X4,sk_c7) != sk_c8
| multiply(sk_c8,X5) != sk_c7
| multiply(X6,sk_c8) != X5
| inverse(X6) != sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.gBnIER7Hub/E---3.1_4482.p',prove_this_31) ).
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_c3,sk_c7) = sk_c8
| multiply(sk_c4,sk_c7) = sk_c8 ),
prove_this_27 ).
cnf(c_0_19,negated_conjecture,
( multiply(inverse(sk_c4),sk_c8) = sk_c7
| multiply(sk_c3,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c8
| inverse(sk_c4) = sk_c8 ),
prove_this_26 ).
cnf(c_0_21,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c8
| multiply(sk_c8,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( multiply(inverse(sk_c3),sk_c8) = sk_c7
| multiply(sk_c8,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
( inverse(sk_c3) = sk_c8
| multiply(sk_c4,sk_c7) = sk_c8 ),
prove_this_21 ).
cnf(c_0_24,negated_conjecture,
( multiply(sk_c4,sk_c7) = sk_c8
| multiply(sk_c8,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| multiply(sk_c8,sk_c6) = sk_c7 ),
prove_this_4 ).
cnf(c_0_26,negated_conjecture,
( multiply(inverse(sk_c4),sk_c8) = sk_c7
| multiply(sk_c8,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_17,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( inverse(sk_c3) = sk_c8
| inverse(sk_c4) = sk_c8 ),
prove_this_20 ).
cnf(c_0_28,negated_conjecture,
( multiply(inverse(sk_c1),sk_c8) = sk_c2
| multiply(sk_c8,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_17,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c8,sk_c6) = sk_c7 ),
prove_this_10 ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c8,sk_c8) = sk_c7
| inverse(sk_c3) = sk_c8 ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_17]) ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c1,multiply(sk_c2,X1)) = multiply(sk_c8,X1)
| multiply(sk_c8,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_14,c_0_25]) ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c8,sk_c6) = sk_c7
| multiply(sk_c2,sk_c8) = sk_c2 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
multiply(sk_c8,sk_c8) = sk_c7,
inference(spm,[status(thm)],[c_0_22,c_0_30]) ).
cnf(c_0_35,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c5,sk_c8) = sk_c6 ),
prove_this_11 ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c8,sk_c6) = sk_c7
| multiply(sk_c1,sk_c2) = sk_c7 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_38,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_35]),c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c5) = sk_c8 ),
prove_this_12 ).
cnf(c_0_40,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c6
| multiply(sk_c2,sk_c1) = identity ),
inference(spm,[status(thm)],[c_0_15,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( multiply(sk_c8,sk_c6) = sk_c7
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_25,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
multiply(inverse(sk_c8),sk_c7) = sk_c8,
inference(spm,[status(thm)],[c_0_17,c_0_34]) ).
cnf(c_0_43,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c8) = sk_c5 ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c6 ),
prove_this_5 ).
cnf(c_0_45,negated_conjecture,
( multiply(inverse(sk_c5),sk_c6) = sk_c8
| multiply(sk_c2,sk_c1) = identity ),
inference(spm,[status(thm)],[c_0_17,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( sk_c7 = sk_c8
| sk_c6 = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_41]),c_0_42]) ).
cnf(c_0_47,negated_conjecture,
( multiply(sk_c2,sk_c1) = identity
| inverse(sk_c8) = sk_c5 ),
inference(spm,[status(thm)],[c_0_15,c_0_43]) ).
cnf(c_0_48,negated_conjecture,
( multiply(inverse(sk_c5),sk_c6) = sk_c8
| multiply(sk_c1,sk_c2) = sk_c8 ),
inference(spm,[status(thm)],[c_0_17,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
( multiply(inverse(sk_c5),sk_c8) = sk_c8
| multiply(sk_c2,sk_c1) = identity
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( multiply(sk_c2,sk_c1) = identity
| inverse(sk_c5) = sk_c8 ),
inference(spm,[status(thm)],[c_0_38,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
( multiply(inverse(sk_c5),sk_c8) = sk_c8
| multiply(sk_c1,sk_c2) = sk_c8
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_48,c_0_46]) ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| inverse(sk_c5) = sk_c8 ),
prove_this_6 ).
cnf(c_0_53,negated_conjecture,
( multiply(sk_c2,sk_c1) = identity
| sk_c7 = sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_34])]) ).
cnf(c_0_54,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| sk_c7 = sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_34])]) ).
cnf(c_0_55,negated_conjecture,
( inverse(sk_c2) = sk_c1
| sk_c7 = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_53]),c_0_35]) ).
cnf(c_0_56,negated_conjecture,
( multiply(inverse(sk_c1),sk_c8) = sk_c2
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_17,c_0_54]) ).
cnf(c_0_57,negated_conjecture,
( inverse(sk_c1) = sk_c2
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_38,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c2
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_59,negated_conjecture,
( sk_c7 = sk_c8
| sk_c8 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_58]),c_0_15]) ).
cnf(c_0_60,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_61,negated_conjecture,
( multiply(X1,X2) != sk_c8
| inverse(X1) != X2
| multiply(X2,sk_c7) != sk_c8
| inverse(X3) != sk_c8
| multiply(X3,sk_c7) != sk_c8
| inverse(sk_c8) != sk_c7
| inverse(X4) != sk_c8
| multiply(X4,sk_c7) != sk_c8
| multiply(sk_c8,X5) != sk_c7
| multiply(X6,sk_c8) != X5
| inverse(X6) != sk_c8 ),
prove_this_31 ).
cnf(c_0_62,negated_conjecture,
sk_c8 = identity,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_59]),c_0_15])]) ).
cnf(c_0_63,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_60,c_0_35]) ).
cnf(c_0_64,negated_conjecture,
( multiply(sk_c8,multiply(X1,sk_c8)) != sk_c7
| multiply(inverse(X2),sk_c7) != sk_c8
| multiply(X2,inverse(X2)) != sk_c8
| multiply(X3,sk_c7) != sk_c8
| multiply(X4,sk_c7) != sk_c8
| inverse(sk_c8) != sk_c7
| inverse(X1) != sk_c8
| inverse(X3) != sk_c8
| inverse(X4) != sk_c8 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_61])]) ).
cnf(c_0_65,negated_conjecture,
sk_c7 = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_62]),c_0_63]),c_0_16]),c_0_62]) ).
cnf(c_0_66,negated_conjecture,
( multiply(X1,inverse(X1)) != identity
| inverse(X1) != identity ),
inference(cn,[status(thm)],[inference(rw,[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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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)],[c_0_64,c_0_62]),c_0_62]),c_0_35]),c_0_16]),c_0_62]),c_0_62]),c_0_62]),c_0_62]),c_0_62]),c_0_63]),c_0_62]),c_0_62]),c_0_62])]),c_0_65]),c_0_35]),c_0_65]),c_0_35]),c_0_65]),c_0_35]),c_0_65]),c_0_65]),c_0_63])])])]),c_0_63])]) ).
cnf(c_0_67,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_63]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GRP212-1 : TPTP v8.1.2. Released v2.5.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n013.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 02:34:14 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 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.gBnIER7Hub/E---3.1_4482.p
% 3.13/0.82 # Version: 3.1pre001
% 3.13/0.82 # Preprocessing class: FSMSSMSMSSSNFFN.
% 3.13/0.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.13/0.82 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 3.13/0.82 # Starting new_bool_3 with 300s (1) cores
% 3.13/0.82 # Starting new_bool_1 with 300s (1) cores
% 3.13/0.82 # Starting sh5l with 300s (1) cores
% 3.13/0.82 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 4562 completed with status 0
% 3.13/0.82 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 3.13/0.82 # Preprocessing class: FSMSSMSMSSSNFFN.
% 3.13/0.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.13/0.82 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 3.13/0.82 # No SInE strategy applied
% 3.13/0.82 # Search class: FGHPS-FFMM21-SFFFFFNN
% 3.13/0.82 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.13/0.82 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 3.13/0.82 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 3.13/0.82 # Starting new_bool_3 with 136s (1) cores
% 3.13/0.82 # Starting new_bool_1 with 136s (1) cores
% 3.13/0.82 # Starting sh5l with 136s (1) cores
% 3.13/0.82 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 4566 completed with status 0
% 3.13/0.82 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 3.13/0.82 # Preprocessing class: FSMSSMSMSSSNFFN.
% 3.13/0.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.13/0.82 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 3.13/0.82 # No SInE strategy applied
% 3.13/0.82 # Search class: FGHPS-FFMM21-SFFFFFNN
% 3.13/0.82 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.13/0.82 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 3.13/0.82 # Preprocessing time : 0.001 s
% 3.13/0.82 # Presaturation interreduction done
% 3.13/0.82
% 3.13/0.82 # Proof found!
% 3.13/0.82 # SZS status Unsatisfiable
% 3.13/0.82 # SZS output start CNFRefutation
% See solution above
% 3.13/0.82 # Parsed axioms : 34
% 3.13/0.82 # Removed by relevancy pruning/SinE : 0
% 3.13/0.82 # Initial clauses : 34
% 3.13/0.82 # Removed in clause preprocessing : 0
% 3.13/0.82 # Initial clauses in saturation : 34
% 3.13/0.82 # Processed clauses : 8009
% 3.13/0.82 # ...of these trivial : 214
% 3.13/0.82 # ...subsumed : 6436
% 3.13/0.82 # ...remaining for further processing : 1359
% 3.13/0.82 # Other redundant clauses eliminated : 14
% 3.13/0.82 # Clauses deleted for lack of memory : 0
% 3.13/0.82 # Backward-subsumed : 152
% 3.13/0.82 # Backward-rewritten : 1151
% 3.13/0.82 # Generated clauses : 29542
% 3.13/0.82 # ...of the previous two non-redundant : 29247
% 3.13/0.82 # ...aggressively subsumed : 0
% 3.13/0.82 # Contextual simplify-reflections : 28
% 3.13/0.82 # Paramodulations : 29530
% 3.13/0.82 # Factorizations : 3
% 3.13/0.82 # NegExts : 0
% 3.13/0.82 # Equation resolutions : 14
% 3.13/0.82 # Total rewrite steps : 13409
% 3.13/0.82 # Propositional unsat checks : 0
% 3.13/0.82 # Propositional check models : 0
% 3.13/0.82 # Propositional check unsatisfiable : 0
% 3.13/0.82 # Propositional clauses : 0
% 3.13/0.82 # Propositional clauses after purity: 0
% 3.13/0.82 # Propositional unsat core size : 0
% 3.13/0.82 # Propositional preprocessing time : 0.000
% 3.13/0.82 # Propositional encoding time : 0.000
% 3.13/0.82 # Propositional solver time : 0.000
% 3.13/0.82 # Success case prop preproc time : 0.000
% 3.13/0.82 # Success case prop encoding time : 0.000
% 3.13/0.82 # Success case prop solver time : 0.000
% 3.13/0.82 # Current number of processed clauses : 17
% 3.13/0.82 # Positive orientable unit clauses : 13
% 3.13/0.82 # Positive unorientable unit clauses: 0
% 3.13/0.82 # Negative unit clauses : 0
% 3.13/0.82 # Non-unit-clauses : 4
% 3.13/0.82 # Current number of unprocessed clauses: 6880
% 3.13/0.82 # ...number of literals in the above : 31260
% 3.13/0.82 # Current number of archived formulas : 0
% 3.13/0.82 # Current number of archived clauses : 1337
% 3.13/0.82 # Clause-clause subsumption calls (NU) : 64210
% 3.13/0.82 # Rec. Clause-clause subsumption calls : 45380
% 3.13/0.82 # Non-unit clause-clause subsumptions : 6615
% 3.13/0.82 # Unit Clause-clause subsumption calls : 262
% 3.13/0.82 # Rewrite failures with RHS unbound : 0
% 3.13/0.82 # BW rewrite match attempts : 20
% 3.13/0.82 # BW rewrite match successes : 20
% 3.13/0.82 # Condensation attempts : 0
% 3.13/0.82 # Condensation successes : 0
% 3.13/0.82 # Termbank termtop insertions : 311604
% 3.13/0.82
% 3.13/0.82 # -------------------------------------------------
% 3.13/0.82 # User time : 0.366 s
% 3.13/0.82 # System time : 0.011 s
% 3.13/0.82 # Total time : 0.377 s
% 3.13/0.82 # Maximum resident set size: 1596 pages
% 3.13/0.82
% 3.13/0.82 # -------------------------------------------------
% 3.13/0.82 # User time : 1.860 s
% 3.13/0.82 # System time : 0.030 s
% 3.13/0.82 # Total time : 1.890 s
% 3.13/0.82 # Maximum resident set size: 1684 pages
% 3.13/0.82 % E---3.1 exiting
%------------------------------------------------------------------------------