TSTP Solution File: GRP212-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP212-1 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 20:54:50 EDT 2024
% Result : Unsatisfiable 4.12s 1.00s
% Output : CNFRefutation 4.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 14
% Syntax : Number of clauses : 75 ( 22 unt; 49 nHn; 60 RR)
% Number of literals : 164 ( 163 equ; 43 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 : 44 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',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/sandbox2/benchmark/theBenchmark.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/sandbox2/benchmark/theBenchmark.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/sandbox2/benchmark/theBenchmark.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/sandbox2/benchmark/theBenchmark.p',prove_this_4) ).
cnf(prove_this_20,negated_conjecture,
( inverse(sk_c3) = sk_c8
| inverse(sk_c4) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.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/sandbox2/benchmark/theBenchmark.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/sandbox2/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_12,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.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/sandbox2/benchmark/theBenchmark.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/sandbox2/benchmark/theBenchmark.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/sandbox2/benchmark/theBenchmark.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,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_32,negated_conjecture,
multiply(sk_c8,sk_c8) = sk_c7,
inference(spm,[status(thm)],[c_0_22,c_0_30]) ).
cnf(c_0_33,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_17]) ).
cnf(c_0_34,negated_conjecture,
( multiply(sk_c8,sk_c6) = sk_c7
| identity = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_31]),c_0_15]) ).
cnf(c_0_35,negated_conjecture,
multiply(inverse(sk_c8),sk_c7) = sk_c8,
inference(spm,[status(thm)],[c_0_17,c_0_32]) ).
cnf(c_0_36,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c5,sk_c8) = sk_c6 ),
prove_this_11 ).
cnf(c_0_38,negated_conjecture,
( identity = sk_c8
| sk_c6 = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_34]),c_0_35]) ).
cnf(c_0_39,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_36]),c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c5) = sk_c8 ),
prove_this_12 ).
cnf(c_0_41,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c6
| multiply(sk_c2,sk_c1) = identity ),
inference(spm,[status(thm)],[c_0_15,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( multiply(sk_c8,X1) = X1
| sk_c6 = sk_c8 ),
inference(spm,[status(thm)],[c_0_16,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c8) = sk_c5 ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
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_41]) ).
cnf(c_0_46,negated_conjecture,
( sk_c6 = sk_c8
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_32,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_39,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_32])]) ).
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_32])]) ).
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_36]) ).
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_39,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,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_36]) ).
cnf(c_0_60,negated_conjecture,
( sk_c7 = sk_c8
| identity = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_58]),c_0_15]) ).
cnf(c_0_61,negated_conjecture,
( inverse(sk_c8) = sk_c8
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_62,negated_conjecture,
( sk_c7 = sk_c8
| identity = sk_c7 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_61]),c_0_32]) ).
cnf(c_0_63,negated_conjecture,
sk_c7 = sk_c8,
inference(spm,[status(thm)],[c_0_60,c_0_62]) ).
cnf(c_0_64,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 ),
inference(fof_simplification,[status(thm)],[prove_this_31]) ).
cnf(c_0_65,negated_conjecture,
identity = sk_c8,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_63]),c_0_15]) ).
cnf(c_0_66,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 ),
c_0_64 ).
cnf(c_0_67,plain,
multiply(inverse(X1),X1) = sk_c8,
inference(rw,[status(thm)],[c_0_15,c_0_65]) ).
cnf(c_0_68,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_66])]) ).
cnf(c_0_69,plain,
multiply(X1,sk_c8) = X1,
inference(rw,[status(thm)],[c_0_36,c_0_65]) ).
cnf(c_0_70,plain,
multiply(sk_c8,X1) = X1,
inference(rw,[status(thm)],[c_0_16,c_0_65]) ).
cnf(c_0_71,plain,
multiply(X1,inverse(X1)) = sk_c8,
inference(spm,[status(thm)],[c_0_67,c_0_39]) ).
cnf(c_0_72,plain,
inverse(sk_c8) = sk_c8,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_65]),c_0_65]) ).
cnf(c_0_73,negated_conjecture,
inverse(X1) != sk_c8,
inference(cn,[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(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_68,c_0_63]),c_0_63]),c_0_63]),c_0_63]),c_0_63]),c_0_69]),c_0_70]),c_0_69]),c_0_71]),c_0_69]),c_0_69]),c_0_72])])])])]),c_0_72])]) ).
cnf(c_0_74,plain,
$false,
inference(sr,[status(thm)],[c_0_72,c_0_73]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP212-1 : TPTP v8.2.0. Released v2.5.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n002.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 05:15:53 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 4.12/1.00 # Version: 3.1.0
% 4.12/1.00 # Preprocessing class: FSMSSMSMSSSNFFN.
% 4.12/1.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.12/1.00 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 4.12/1.00 # Starting new_bool_3 with 300s (1) cores
% 4.12/1.00 # Starting new_bool_1 with 300s (1) cores
% 4.12/1.00 # Starting sh5l with 300s (1) cores
% 4.12/1.00 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 28232 completed with status 0
% 4.12/1.00 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 4.12/1.00 # Preprocessing class: FSMSSMSMSSSNFFN.
% 4.12/1.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.12/1.00 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 4.12/1.00 # No SInE strategy applied
% 4.12/1.00 # Search class: FGHPS-FFMM21-SFFFFFNN
% 4.12/1.00 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 4.12/1.00 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 4.12/1.00 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 4.12/1.00 # Starting new_bool_3 with 136s (1) cores
% 4.12/1.00 # Starting new_bool_1 with 136s (1) cores
% 4.12/1.00 # Starting sh5l with 136s (1) cores
% 4.12/1.00 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 28236 completed with status 0
% 4.12/1.00 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 4.12/1.00 # Preprocessing class: FSMSSMSMSSSNFFN.
% 4.12/1.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.12/1.00 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 4.12/1.00 # No SInE strategy applied
% 4.12/1.00 # Search class: FGHPS-FFMM21-SFFFFFNN
% 4.12/1.00 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 4.12/1.00 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 4.12/1.00 # Preprocessing time : 0.001 s
% 4.12/1.00 # Presaturation interreduction done
% 4.12/1.00
% 4.12/1.00 # Proof found!
% 4.12/1.00 # SZS status Unsatisfiable
% 4.12/1.00 # SZS output start CNFRefutation
% See solution above
% 4.12/1.00 # Parsed axioms : 34
% 4.12/1.00 # Removed by relevancy pruning/SinE : 0
% 4.12/1.00 # Initial clauses : 34
% 4.12/1.00 # Removed in clause preprocessing : 0
% 4.12/1.00 # Initial clauses in saturation : 34
% 4.12/1.00 # Processed clauses : 12638
% 4.12/1.00 # ...of these trivial : 612
% 4.12/1.00 # ...subsumed : 10293
% 4.12/1.00 # ...remaining for further processing : 1733
% 4.12/1.00 # Other redundant clauses eliminated : 13
% 4.12/1.00 # Clauses deleted for lack of memory : 0
% 4.12/1.00 # Backward-subsumed : 197
% 4.12/1.00 # Backward-rewritten : 1443
% 4.12/1.00 # Generated clauses : 56823
% 4.12/1.00 # ...of the previous two non-redundant : 54972
% 4.12/1.00 # ...aggressively subsumed : 0
% 4.12/1.00 # Contextual simplify-reflections : 41
% 4.12/1.00 # Paramodulations : 56790
% 4.12/1.00 # Factorizations : 7
% 4.12/1.00 # NegExts : 0
% 4.12/1.00 # Equation resolutions : 13
% 4.12/1.00 # Disequality decompositions : 0
% 4.12/1.00 # Total rewrite steps : 28679
% 4.12/1.00 # ...of those cached : 27689
% 4.12/1.00 # Propositional unsat checks : 0
% 4.12/1.00 # Propositional check models : 0
% 4.12/1.00 # Propositional check unsatisfiable : 0
% 4.12/1.00 # Propositional clauses : 0
% 4.12/1.00 # Propositional clauses after purity: 0
% 4.12/1.00 # Propositional unsat core size : 0
% 4.12/1.00 # Propositional preprocessing time : 0.000
% 4.12/1.00 # Propositional encoding time : 0.000
% 4.12/1.00 # Propositional solver time : 0.000
% 4.12/1.00 # Success case prop preproc time : 0.000
% 4.12/1.00 # Success case prop encoding time : 0.000
% 4.12/1.00 # Success case prop solver time : 0.000
% 4.12/1.00 # Current number of processed clauses : 35
% 4.12/1.00 # Positive orientable unit clauses : 19
% 4.12/1.00 # Positive unorientable unit clauses: 0
% 4.12/1.00 # Negative unit clauses : 1
% 4.12/1.00 # Non-unit-clauses : 15
% 4.12/1.00 # Current number of unprocessed clauses: 3548
% 4.12/1.00 # ...number of literals in the above : 19390
% 4.12/1.00 # Current number of archived formulas : 0
% 4.12/1.00 # Current number of archived clauses : 1693
% 4.12/1.00 # Clause-clause subsumption calls (NU) : 105975
% 4.12/1.00 # Rec. Clause-clause subsumption calls : 84109
% 4.12/1.00 # Non-unit clause-clause subsumptions : 10486
% 4.12/1.00 # Unit Clause-clause subsumption calls : 1268
% 4.12/1.00 # Rewrite failures with RHS unbound : 0
% 4.12/1.00 # BW rewrite match attempts : 86
% 4.12/1.00 # BW rewrite match successes : 66
% 4.12/1.00 # Condensation attempts : 0
% 4.12/1.00 # Condensation successes : 0
% 4.12/1.00 # Termbank termtop insertions : 582342
% 4.12/1.00 # Search garbage collected termcells : 31
% 4.12/1.00
% 4.12/1.00 # -------------------------------------------------
% 4.12/1.00 # User time : 0.475 s
% 4.12/1.00 # System time : 0.020 s
% 4.12/1.00 # Total time : 0.496 s
% 4.12/1.00 # Maximum resident set size: 1608 pages
% 4.12/1.00
% 4.12/1.00 # -------------------------------------------------
% 4.12/1.00 # User time : 2.406 s
% 4.12/1.00 # System time : 0.052 s
% 4.12/1.00 # Total time : 2.458 s
% 4.12/1.00 # Maximum resident set size: 1708 pages
% 4.12/1.00 % E---3.1 exiting
%------------------------------------------------------------------------------