TSTP Solution File: GRP247-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP247-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:45 EDT 2023
% Result : Unsatisfiable 0.15s 0.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 16
% Syntax : Number of clauses : 73 ( 19 unt; 46 nHn; 63 RR)
% Number of literals : 167 ( 166 equ; 53 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 : 42 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.YhV8bsZaNz/E---3.1_13650.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.YhV8bsZaNz/E---3.1_13650.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.YhV8bsZaNz/E---3.1_13650.p',left_identity) ).
cnf(prove_this_1,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c4,sk_c9) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.YhV8bsZaNz/E---3.1_13650.p',prove_this_1) ).
cnf(prove_this_15,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c7
| multiply(sk_c5,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.YhV8bsZaNz/E---3.1_13650.p',prove_this_15) ).
cnf(prove_this_2,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| inverse(sk_c4) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.YhV8bsZaNz/E---3.1_13650.p',prove_this_2) ).
cnf(prove_this_21,negated_conjecture,
( inverse(sk_c2) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.YhV8bsZaNz/E---3.1_13650.p',prove_this_21) ).
cnf(prove_this_7,negated_conjecture,
( inverse(sk_c1) = sk_c9
| multiply(sk_c4,sk_c9) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.YhV8bsZaNz/E---3.1_13650.p',prove_this_7) ).
cnf(prove_this_16,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c7
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.YhV8bsZaNz/E---3.1_13650.p',prove_this_16) ).
cnf(prove_this_8,negated_conjecture,
( inverse(sk_c1) = sk_c9
| inverse(sk_c4) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.YhV8bsZaNz/E---3.1_13650.p',prove_this_8) ).
cnf(prove_this_22,negated_conjecture,
( inverse(sk_c2) = sk_c8
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.YhV8bsZaNz/E---3.1_13650.p',prove_this_22) ).
cnf(prove_this_30,negated_conjecture,
( inverse(sk_c3) = sk_c9
| multiply(sk_c6,sk_c8) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.YhV8bsZaNz/E---3.1_13650.p',prove_this_30) ).
cnf(prove_this_36,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c9
| multiply(sk_c6,sk_c8) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.YhV8bsZaNz/E---3.1_13650.p',prove_this_36) ).
cnf(prove_this_35,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c9
| inverse(sk_c6) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.YhV8bsZaNz/E---3.1_13650.p',prove_this_35) ).
cnf(prove_this_37,negated_conjecture,
( multiply(X1,sk_c9) != sk_c8
| inverse(X1) != sk_c9
| multiply(X2,sk_c8) != sk_c7
| inverse(X2) != sk_c8
| inverse(X3) != sk_c9
| multiply(X3,sk_c7) != sk_c9
| 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/tmp/tmp.YhV8bsZaNz/E---3.1_13650.p',prove_this_37) ).
cnf(prove_this_29,negated_conjecture,
( inverse(sk_c3) = sk_c9
| inverse(sk_c6) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.YhV8bsZaNz/E---3.1_13650.p',prove_this_29) ).
cnf(c_0_16,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_17,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_18,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_19,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c4,sk_c9) = sk_c8 ),
prove_this_1 ).
cnf(c_0_21,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c7
| multiply(sk_c5,sk_c8) = sk_c7 ),
prove_this_15 ).
cnf(c_0_22,negated_conjecture,
( multiply(inverse(sk_c4),sk_c8) = sk_c9
| multiply(sk_c1,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| inverse(sk_c4) = sk_c9 ),
prove_this_2 ).
cnf(c_0_24,negated_conjecture,
( multiply(inverse(sk_c2),sk_c7) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( inverse(sk_c2) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c7 ),
prove_this_21 ).
cnf(c_0_26,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c7
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( multiply(inverse(sk_c1),sk_c8) = sk_c9
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( inverse(sk_c1) = sk_c9
| multiply(sk_c4,sk_c9) = sk_c8 ),
prove_this_7 ).
cnf(c_0_30,negated_conjecture,
( multiply(inverse(sk_c5),sk_c7) = sk_c8
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_19,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c7
| inverse(sk_c5) = sk_c8 ),
prove_this_16 ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c4,sk_c9) = sk_c8
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c7
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
( multiply(inverse(sk_c4),sk_c8) = sk_c9
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_19,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( inverse(sk_c1) = sk_c9
| inverse(sk_c4) = sk_c9 ),
prove_this_8 ).
cnf(c_0_36,negated_conjecture,
( multiply(inverse(sk_c2),sk_c7) = sk_c8
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_19,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( inverse(sk_c2) = sk_c8
| inverse(sk_c5) = sk_c8 ),
prove_this_22 ).
cnf(c_0_38,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c9
| inverse(sk_c1) = sk_c9 ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c8
| inverse(sk_c5) = sk_c8 ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
multiply(sk_c9,sk_c8) = sk_c9,
inference(spm,[status(thm)],[c_0_28,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
multiply(sk_c8,sk_c7) = sk_c8,
inference(spm,[status(thm)],[c_0_30,c_0_39]) ).
cnf(c_0_42,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_19,c_0_19]) ).
cnf(c_0_43,negated_conjecture,
( inverse(sk_c3) = sk_c9
| multiply(sk_c6,sk_c8) = sk_c9 ),
prove_this_30 ).
cnf(c_0_44,negated_conjecture,
sk_c8 = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_40]),c_0_17]) ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c9
| multiply(sk_c6,sk_c8) = sk_c9 ),
prove_this_36 ).
cnf(c_0_46,negated_conjecture,
sk_c7 = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_41]),c_0_17]) ).
cnf(c_0_47,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c9
| inverse(sk_c6) = sk_c9 ),
prove_this_35 ).
cnf(c_0_48,negated_conjecture,
( multiply(X1,sk_c9) != sk_c8
| inverse(X1) != sk_c9
| multiply(X2,sk_c8) != sk_c7
| inverse(X2) != sk_c8
| inverse(X3) != sk_c9
| multiply(X3,sk_c7) != sk_c9
| 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 ),
prove_this_37 ).
cnf(c_0_49,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_42]) ).
cnf(c_0_50,negated_conjecture,
( multiply(sk_c6,identity) = sk_c9
| inverse(sk_c3) = sk_c9 ),
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c3,identity) = sk_c9
| multiply(sk_c6,identity) = sk_c9 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_44]) ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c9
| multiply(sk_c9,sk_c6) = identity ),
inference(spm,[status(thm)],[c_0_17,c_0_47]) ).
cnf(c_0_53,negated_conjecture,
( multiply(X1,identity) != sk_c9
| multiply(X2,identity) != identity
| multiply(X3,sk_c9) != identity
| multiply(X4,identity) != sk_c9
| multiply(X5,identity) != identity
| multiply(X6,sk_c9) != identity
| inverse(X1) != sk_c9
| inverse(X2) != identity
| inverse(X3) != sk_c9
| inverse(X4) != sk_c9
| inverse(X5) != identity
| inverse(X6) != sk_c9 ),
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_48,c_0_46]),c_0_46]),c_0_46]),c_0_44]),c_0_44]),c_0_44]),c_0_44]),c_0_44]),c_0_44]),c_0_44]) ).
cnf(c_0_54,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_17,c_0_49]) ).
cnf(c_0_55,negated_conjecture,
( inverse(sk_c3) = sk_c9
| sk_c6 = sk_c9 ),
inference(rw,[status(thm)],[c_0_50,c_0_49]) ).
cnf(c_0_56,negated_conjecture,
( sk_c6 = sk_c9
| sk_c3 = sk_c9 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_49]),c_0_49]) ).
cnf(c_0_57,negated_conjecture,
( multiply(sk_c9,sk_c6) = identity
| multiply(sk_c3,identity) = sk_c9 ),
inference(rw,[status(thm)],[c_0_52,c_0_46]) ).
cnf(c_0_58,negated_conjecture,
( multiply(X1,sk_c9) != identity
| multiply(X2,sk_c9) != identity
| inverse(sk_c9) != sk_c9
| inverse(X1) != sk_c9
| inverse(X2) != sk_c9 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[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)],[c_0_53,c_0_49]),c_0_49]),c_0_49]),c_0_49])])])])]),c_0_54])]) ).
cnf(c_0_59,negated_conjecture,
( inverse(sk_c9) = sk_c9
| sk_c6 = sk_c9 ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_60,negated_conjecture,
( multiply(inverse(sk_c3),sk_c9) = identity
| multiply(sk_c9,sk_c6) = identity ),
inference(spm,[status(thm)],[c_0_19,c_0_57]) ).
cnf(c_0_61,negated_conjecture,
( inverse(sk_c3) = sk_c9
| inverse(sk_c6) = sk_c9 ),
prove_this_29 ).
cnf(c_0_62,negated_conjecture,
( sk_c6 = sk_c9
| multiply(X1,sk_c9) != identity
| multiply(X2,sk_c9) != identity
| inverse(X1) != sk_c9
| inverse(X2) != sk_c9 ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_49]),c_0_49]) ).
cnf(c_0_64,negated_conjecture,
( multiply(sk_c9,sk_c6) = identity
| multiply(sk_c9,sk_c9) = identity
| inverse(sk_c6) = sk_c9 ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_65,negated_conjecture,
( sk_c6 = sk_c9
| multiply(X1,sk_c9) != identity
| inverse(X1) != sk_c9 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_17]),c_0_63])]) ).
cnf(c_0_66,negated_conjecture,
( multiply(sk_c9,sk_c9) = identity
| multiply(sk_c9,sk_c6) = identity ),
inference(spm,[status(thm)],[c_0_17,c_0_64]) ).
cnf(c_0_67,negated_conjecture,
sk_c6 = sk_c9,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_63])]),c_0_17])]) ).
cnf(c_0_68,negated_conjecture,
multiply(sk_c9,sk_c9) = identity,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67])]) ).
cnf(c_0_69,negated_conjecture,
inverse(sk_c9) = sk_c9,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_68]),c_0_49]) ).
cnf(c_0_70,negated_conjecture,
( multiply(X1,sk_c9) != identity
| multiply(X2,sk_c9) != identity
| inverse(X1) != sk_c9
| inverse(X2) != sk_c9 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_69])]) ).
cnf(c_0_71,negated_conjecture,
( multiply(X1,sk_c9) != identity
| inverse(X1) != sk_c9 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_68]),c_0_69])]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_69]),c_0_68])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : GRP247-1 : TPTP v8.1.2. Released v2.5.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Oct 3 02:58:04 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 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.YhV8bsZaNz/E---3.1_13650.p
% 0.15/0.46 # Version: 3.1pre001
% 0.15/0.46 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.46 # Starting sh5l with 300s (1) cores
% 0.15/0.46 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 13777 completed with status 0
% 0.15/0.46 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.15/0.46 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.46 # No SInE strategy applied
% 0.15/0.46 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.15/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.46 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.15/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/0.46 # Starting new_bool_3 with 136s (1) cores
% 0.15/0.46 # Starting new_bool_1 with 136s (1) cores
% 0.15/0.46 # Starting sh5l with 136s (1) cores
% 0.15/0.46 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 13783 completed with status 0
% 0.15/0.46 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.46 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.46 # No SInE strategy applied
% 0.15/0.46 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.15/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.46 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.15/0.46 # Preprocessing time : 0.001 s
% 0.15/0.46 # Presaturation interreduction done
% 0.15/0.46
% 0.15/0.46 # Proof found!
% 0.15/0.46 # SZS status Unsatisfiable
% 0.15/0.46 # SZS output start CNFRefutation
% See solution above
% 0.15/0.46 # Parsed axioms : 40
% 0.15/0.46 # Removed by relevancy pruning/SinE : 0
% 0.15/0.46 # Initial clauses : 40
% 0.15/0.46 # Removed in clause preprocessing : 0
% 0.15/0.46 # Initial clauses in saturation : 40
% 0.15/0.46 # Processed clauses : 724
% 0.15/0.46 # ...of these trivial : 9
% 0.15/0.46 # ...subsumed : 262
% 0.15/0.46 # ...remaining for further processing : 453
% 0.15/0.46 # Other redundant clauses eliminated : 34
% 0.15/0.46 # Clauses deleted for lack of memory : 0
% 0.15/0.46 # Backward-subsumed : 70
% 0.15/0.46 # Backward-rewritten : 304
% 0.15/0.46 # Generated clauses : 2669
% 0.15/0.46 # ...of the previous two non-redundant : 2479
% 0.15/0.46 # ...aggressively subsumed : 0
% 0.15/0.46 # Contextual simplify-reflections : 12
% 0.15/0.46 # Paramodulations : 2635
% 0.15/0.46 # Factorizations : 0
% 0.15/0.46 # NegExts : 0
% 0.15/0.46 # Equation resolutions : 34
% 0.15/0.46 # Total rewrite steps : 1239
% 0.15/0.46 # Propositional unsat checks : 0
% 0.15/0.46 # Propositional check models : 0
% 0.15/0.46 # Propositional check unsatisfiable : 0
% 0.15/0.46 # Propositional clauses : 0
% 0.15/0.46 # Propositional clauses after purity: 0
% 0.15/0.46 # Propositional unsat core size : 0
% 0.15/0.46 # Propositional preprocessing time : 0.000
% 0.15/0.46 # Propositional encoding time : 0.000
% 0.15/0.46 # Propositional solver time : 0.000
% 0.15/0.46 # Success case prop preproc time : 0.000
% 0.15/0.46 # Success case prop encoding time : 0.000
% 0.15/0.46 # Success case prop solver time : 0.000
% 0.15/0.46 # Current number of processed clauses : 39
% 0.15/0.46 # Positive orientable unit clauses : 14
% 0.15/0.46 # Positive unorientable unit clauses: 0
% 0.15/0.46 # Negative unit clauses : 0
% 0.15/0.46 # Non-unit-clauses : 25
% 0.15/0.46 # Current number of unprocessed clauses: 1175
% 0.15/0.46 # ...number of literals in the above : 6523
% 0.15/0.46 # Current number of archived formulas : 0
% 0.15/0.46 # Current number of archived clauses : 414
% 0.15/0.46 # Clause-clause subsumption calls (NU) : 2730
% 0.15/0.46 # Rec. Clause-clause subsumption calls : 1824
% 0.15/0.46 # Non-unit clause-clause subsumptions : 314
% 0.15/0.46 # Unit Clause-clause subsumption calls : 245
% 0.15/0.46 # Rewrite failures with RHS unbound : 0
% 0.15/0.46 # BW rewrite match attempts : 33
% 0.15/0.46 # BW rewrite match successes : 33
% 0.15/0.46 # Condensation attempts : 0
% 0.15/0.46 # Condensation successes : 0
% 0.15/0.46 # Termbank termtop insertions : 39870
% 0.15/0.46
% 0.15/0.46 # -------------------------------------------------
% 0.15/0.46 # User time : 0.052 s
% 0.15/0.46 # System time : 0.003 s
% 0.15/0.46 # Total time : 0.055 s
% 0.15/0.46 # Maximum resident set size: 1608 pages
% 0.15/0.46
% 0.15/0.46 # -------------------------------------------------
% 0.15/0.46 # User time : 0.240 s
% 0.15/0.46 # System time : 0.010 s
% 0.15/0.46 # Total time : 0.251 s
% 0.15/0.46 # Maximum resident set size: 1688 pages
% 0.15/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------