TSTP Solution File: GRP313-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP313-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:47:00 EDT 2023
% Result : Unsatisfiable 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 14
% Syntax : Number of clauses : 62 ( 18 unt; 36 nHn; 53 RR)
% Number of literals : 160 ( 159 equ; 70 neg)
% Maximal clause size : 14 ( 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 : 47 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.1HD3C4gt1R/E---3.1_9553.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.1HD3C4gt1R/E---3.1_9553.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.1HD3C4gt1R/E---3.1_9553.p',left_identity) ).
cnf(prove_this_8,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c4,sk_c9) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.1HD3C4gt1R/E---3.1_9553.p',prove_this_8) ).
cnf(prove_this_15,negated_conjecture,
( inverse(sk_c1) = sk_c9
| multiply(sk_c4,sk_c9) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.1HD3C4gt1R/E---3.1_9553.p',prove_this_15) ).
cnf(prove_this_24,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c7
| multiply(sk_c5,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.1HD3C4gt1R/E---3.1_9553.p',prove_this_24) ).
cnf(prove_this_9,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| inverse(sk_c4) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.1HD3C4gt1R/E---3.1_9553.p',prove_this_9) ).
cnf(prove_this_25,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c7
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.1HD3C4gt1R/E---3.1_9553.p',prove_this_25) ).
cnf(prove_this_6,negated_conjecture,
( multiply(sk_c8,sk_c9) = sk_c7
| multiply(sk_c6,sk_c7) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.1HD3C4gt1R/E---3.1_9553.p',prove_this_6) ).
cnf(prove_this_16,negated_conjecture,
( inverse(sk_c1) = sk_c9
| inverse(sk_c4) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.1HD3C4gt1R/E---3.1_9553.p',prove_this_16) ).
cnf(prove_this_31,negated_conjecture,
( inverse(sk_c2) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.1HD3C4gt1R/E---3.1_9553.p',prove_this_31) ).
cnf(prove_this_7,negated_conjecture,
( multiply(sk_c8,sk_c9) = sk_c7
| inverse(sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.1HD3C4gt1R/E---3.1_9553.p',prove_this_7) ).
cnf(prove_this_32,negated_conjecture,
( inverse(sk_c2) = sk_c8
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.1HD3C4gt1R/E---3.1_9553.p',prove_this_32) ).
cnf(prove_this_50,negated_conjecture,
( multiply(sk_c8,sk_c9) != sk_c7
| multiply(X1,sk_c9) != sk_c8
| inverse(X1) != sk_c9
| multiply(X2,sk_c8) != sk_c7
| inverse(X2) != sk_c8
| multiply(X3,sk_c8) != sk_c9
| inverse(X3) != sk_c8
| multiply(X4,sk_c9) != sk_c8
| inverse(X4) != sk_c9
| multiply(X5,sk_c8) != sk_c7
| inverse(X5) != sk_c8
| multiply(sk_c7,sk_c9) != sk_c8
| multiply(X6,sk_c7) != sk_c9
| inverse(X6) != sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.1HD3C4gt1R/E---3.1_9553.p',prove_this_50) ).
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_c1,sk_c9) = sk_c8
| multiply(sk_c4,sk_c9) = sk_c8 ),
prove_this_8 ).
cnf(c_0_19,negated_conjecture,
( multiply(inverse(sk_c1),sk_c8) = sk_c9
| 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_c1) = sk_c9
| multiply(sk_c4,sk_c9) = sk_c8 ),
prove_this_15 ).
cnf(c_0_21,negated_conjecture,
( multiply(sk_c4,sk_c9) = sk_c8
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c7
| multiply(sk_c5,sk_c8) = sk_c7 ),
prove_this_24 ).
cnf(c_0_23,negated_conjecture,
( multiply(inverse(sk_c4),sk_c8) = sk_c9
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| inverse(sk_c4) = sk_c9 ),
prove_this_9 ).
cnf(c_0_25,negated_conjecture,
( multiply(inverse(sk_c5),sk_c7) = sk_c8
| multiply(sk_c2,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c7
| inverse(sk_c5) = sk_c8 ),
prove_this_25 ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c1,sk_c9) = sk_c8
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c7
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c8,sk_c9) = sk_c7
| multiply(sk_c6,sk_c7) = sk_c9 ),
prove_this_6 ).
cnf(c_0_30,negated_conjecture,
( multiply(inverse(sk_c1),sk_c8) = sk_c9
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_17,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( inverse(sk_c1) = sk_c9
| inverse(sk_c4) = sk_c9 ),
prove_this_16 ).
cnf(c_0_32,negated_conjecture,
( multiply(inverse(sk_c2),sk_c7) = sk_c8
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_17,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( inverse(sk_c2) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c7 ),
prove_this_31 ).
cnf(c_0_34,negated_conjecture,
( multiply(inverse(sk_c6),sk_c9) = sk_c7
| multiply(sk_c8,sk_c9) = sk_c7 ),
inference(spm,[status(thm)],[c_0_17,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c8,sk_c9) = sk_c7
| inverse(sk_c6) = sk_c7 ),
prove_this_7 ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c9
| inverse(sk_c4) = sk_c9 ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_38,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c7
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c8,sk_c9) = sk_c7
| multiply(sk_c7,sk_c9) = sk_c7 ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
multiply(sk_c9,sk_c8) = sk_c9,
inference(spm,[status(thm)],[c_0_23,c_0_36]) ).
cnf(c_0_41,plain,
multiply(inverse(inverse(identity)),X1) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( multiply(inverse(sk_c5),sk_c7) = sk_c8
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_17,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
( inverse(sk_c2) = sk_c8
| inverse(sk_c5) = sk_c8 ),
prove_this_32 ).
cnf(c_0_44,negated_conjecture,
( multiply(sk_c8,sk_c9) = sk_c7
| identity = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_39]),c_0_15]) ).
cnf(c_0_45,negated_conjecture,
identity = sk_c8,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_40]),c_0_15]) ).
cnf(c_0_46,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c8
| inverse(sk_c2) = sk_c8 ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,negated_conjecture,
( multiply(sk_c8,sk_c9) = sk_c7
| sk_c9 = sk_c8 ),
inference(rw,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,plain,
inverse(sk_c8) = sk_c8,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_45]),c_0_45]) ).
cnf(c_0_50,negated_conjecture,
multiply(sk_c8,sk_c7) = sk_c8,
inference(spm,[status(thm)],[c_0_32,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
sk_c9 = sk_c8,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_48]),c_0_49]),c_0_50])]) ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c8,sk_c9) != sk_c7
| multiply(X1,sk_c9) != sk_c8
| inverse(X1) != sk_c9
| multiply(X2,sk_c8) != sk_c7
| inverse(X2) != sk_c8
| multiply(X3,sk_c8) != sk_c9
| inverse(X3) != sk_c8
| multiply(X4,sk_c9) != sk_c8
| inverse(X4) != sk_c9
| multiply(X5,sk_c8) != sk_c7
| inverse(X5) != sk_c8
| multiply(sk_c7,sk_c9) != sk_c8
| multiply(X6,sk_c7) != sk_c9
| inverse(X6) != sk_c7 ),
prove_this_50 ).
cnf(c_0_53,negated_conjecture,
multiply(sk_c8,sk_c8) = sk_c8,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_51]),c_0_51]) ).
cnf(c_0_54,negated_conjecture,
sk_c7 = sk_c8,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_50]),c_0_15]),c_0_45]) ).
cnf(c_0_55,negated_conjecture,
( multiply(X1,sk_c8) != sk_c8
| multiply(X2,sk_c8) != sk_c8
| multiply(X3,sk_c8) != sk_c8
| multiply(X4,sk_c8) != sk_c8
| multiply(X5,sk_c8) != sk_c8
| multiply(X6,sk_c8) != sk_c8
| inverse(X1) != sk_c8
| inverse(X2) != sk_c8
| inverse(X3) != sk_c8
| inverse(X4) != sk_c8
| inverse(X5) != sk_c8
| inverse(X6) != sk_c8 ),
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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_51]),c_0_51]),c_0_51]),c_0_51]),c_0_51]),c_0_51]),c_0_51]),c_0_51]),c_0_53]),c_0_54]),c_0_54]),c_0_53]),c_0_54]),c_0_54]),c_0_54]),c_0_54])]) ).
cnf(c_0_56,negated_conjecture,
( multiply(X1,sk_c8) != sk_c8
| multiply(X2,sk_c8) != sk_c8
| multiply(X3,sk_c8) != sk_c8
| multiply(X4,sk_c8) != sk_c8
| multiply(X5,sk_c8) != sk_c8
| inverse(X1) != sk_c8
| inverse(X2) != sk_c8
| inverse(X3) != sk_c8
| inverse(X4) != sk_c8
| inverse(X5) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_49]),c_0_53])]) ).
cnf(c_0_57,negated_conjecture,
( multiply(X1,sk_c8) != sk_c8
| multiply(X2,sk_c8) != sk_c8
| multiply(X3,sk_c8) != sk_c8
| multiply(X4,sk_c8) != sk_c8
| inverse(X1) != sk_c8
| inverse(X2) != sk_c8
| inverse(X3) != sk_c8
| inverse(X4) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_49]),c_0_53])]) ).
cnf(c_0_58,negated_conjecture,
( multiply(X1,sk_c8) != sk_c8
| multiply(X2,sk_c8) != sk_c8
| multiply(X3,sk_c8) != sk_c8
| inverse(X1) != sk_c8
| inverse(X2) != sk_c8
| inverse(X3) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_49]),c_0_53])]) ).
cnf(c_0_59,negated_conjecture,
( multiply(X1,sk_c8) != sk_c8
| multiply(X2,sk_c8) != sk_c8
| inverse(X1) != sk_c8
| inverse(X2) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_49]),c_0_53])]) ).
cnf(c_0_60,negated_conjecture,
( multiply(X1,sk_c8) != sk_c8
| inverse(X1) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_49]),c_0_53])]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_49]),c_0_53])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP313-1 : TPTP v8.1.2. Released v2.5.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 02:46:01 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 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.1HD3C4gt1R/E---3.1_9553.p
% 0.21/0.53 # Version: 3.1pre001
% 0.21/0.53 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 9662 completed with status 0
% 0.21/0.53 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.21/0.53 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.21/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.53 # Starting sh5l with 136s (1) cores
% 0.21/0.53 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 9668 completed with status 0
% 0.21/0.53 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.21/0.53 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.21/0.53 # Preprocessing time : 0.001 s
% 0.21/0.53 # Presaturation interreduction done
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Unsatisfiable
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 53
% 0.21/0.53 # Removed by relevancy pruning/SinE : 0
% 0.21/0.53 # Initial clauses : 53
% 0.21/0.53 # Removed in clause preprocessing : 0
% 0.21/0.53 # Initial clauses in saturation : 53
% 0.21/0.53 # Processed clauses : 328
% 0.21/0.53 # ...of these trivial : 11
% 0.21/0.53 # ...subsumed : 46
% 0.21/0.53 # ...remaining for further processing : 271
% 0.21/0.53 # Other redundant clauses eliminated : 0
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 12
% 0.21/0.53 # Backward-rewritten : 185
% 0.21/0.53 # Generated clauses : 1096
% 0.21/0.53 # ...of the previous two non-redundant : 1149
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 4
% 0.21/0.53 # Paramodulations : 1096
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 0
% 0.21/0.53 # Total rewrite steps : 428
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 21
% 0.21/0.53 # Positive orientable unit clauses : 8
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 0
% 0.21/0.53 # Non-unit-clauses : 13
% 0.21/0.53 # Current number of unprocessed clauses: 771
% 0.21/0.53 # ...number of literals in the above : 2764
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 250
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 2426
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 877
% 0.21/0.53 # Non-unit clause-clause subsumptions : 58
% 0.21/0.53 # Unit Clause-clause subsumption calls : 300
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 9
% 0.21/0.53 # BW rewrite match successes : 8
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 21624
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.040 s
% 0.21/0.53 # System time : 0.003 s
% 0.21/0.53 # Total time : 0.043 s
% 0.21/0.53 # Maximum resident set size: 1664 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.203 s
% 0.21/0.53 # System time : 0.010 s
% 0.21/0.53 # Total time : 0.213 s
% 0.21/0.53 # Maximum resident set size: 1696 pages
% 0.21/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------