TSTP Solution File: GRP263-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP263-1 : TPTP v8.1.2. 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:46:48 EDT 2023
% Result : Unsatisfiable 0.16s 0.51s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 14
% Syntax : Number of clauses : 61 ( 20 unt; 35 nHn; 49 RR)
% Number of literals : 151 ( 150 equ; 61 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 : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.6ojuYFashB/E---3.1_15510.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.6ojuYFashB/E---3.1_15510.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.6ojuYFashB/E---3.1_15510.p',left_identity) ).
cnf(prove_this_23,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c9
| multiply(sk_c4,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.6ojuYFashB/E---3.1_15510.p',prove_this_23) ).
cnf(prove_this_1,negated_conjecture,
( multiply(sk_c1,sk_c11) = sk_c10
| multiply(sk_c3,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.6ojuYFashB/E---3.1_15510.p',prove_this_1) ).
cnf(prove_this_24,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c9
| inverse(sk_c4) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.6ojuYFashB/E---3.1_15510.p',prove_this_24) ).
cnf(prove_this_2,negated_conjecture,
( multiply(sk_c1,sk_c11) = sk_c10
| inverse(sk_c3) = sk_c11 ),
file('/export/starexec/sandbox/tmp/tmp.6ojuYFashB/E---3.1_15510.p',prove_this_2) ).
cnf(prove_this_33,negated_conjecture,
( inverse(sk_c2) = sk_c10
| multiply(sk_c4,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.6ojuYFashB/E---3.1_15510.p',prove_this_33) ).
cnf(prove_this_11,negated_conjecture,
( inverse(sk_c1) = sk_c11
| multiply(sk_c3,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.6ojuYFashB/E---3.1_15510.p',prove_this_11) ).
cnf(prove_this_34,negated_conjecture,
( inverse(sk_c2) = sk_c10
| inverse(sk_c4) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.6ojuYFashB/E---3.1_15510.p',prove_this_34) ).
cnf(prove_this_12,negated_conjecture,
( inverse(sk_c1) = sk_c11
| inverse(sk_c3) = sk_c11 ),
file('/export/starexec/sandbox/tmp/tmp.6ojuYFashB/E---3.1_15510.p',prove_this_12) ).
cnf(prove_this_45,negated_conjecture,
( multiply(sk_c9,sk_c10) = sk_c11
| multiply(sk_c5,sk_c8) = sk_c11 ),
file('/export/starexec/sandbox/tmp/tmp.6ojuYFashB/E---3.1_15510.p',prove_this_45) ).
cnf(prove_this_46,negated_conjecture,
( multiply(sk_c9,sk_c10) = sk_c11
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.6ojuYFashB/E---3.1_15510.p',prove_this_46) ).
cnf(prove_this_51,negated_conjecture,
( multiply(X1,sk_c11) != sk_c10
| inverse(X1) != sk_c11
| multiply(X2,sk_c10) != sk_c9
| inverse(X2) != sk_c10
| multiply(sk_c9,sk_c10) != sk_c11
| multiply(X3,sk_c11) != sk_c10
| inverse(X3) != sk_c11
| multiply(X4,sk_c10) != sk_c9
| inverse(X4) != sk_c10
| multiply(X5,X6) != sk_c11
| inverse(X5) != X6
| multiply(X6,sk_c10) != sk_c11
| inverse(X7) != X8
| inverse(X8) != X6
| multiply(X7,X6) != X8 ),
file('/export/starexec/sandbox/tmp/tmp.6ojuYFashB/E---3.1_15510.p',prove_this_51) ).
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_c10) = sk_c9
| multiply(sk_c4,sk_c10) = sk_c9 ),
prove_this_23 ).
cnf(c_0_19,negated_conjecture,
( multiply(sk_c1,sk_c11) = sk_c10
| multiply(sk_c3,sk_c11) = sk_c10 ),
prove_this_1 ).
cnf(c_0_20,negated_conjecture,
( multiply(inverse(sk_c4),sk_c9) = sk_c10
| multiply(sk_c2,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c9
| inverse(sk_c4) = sk_c10 ),
prove_this_24 ).
cnf(c_0_22,negated_conjecture,
( multiply(inverse(sk_c3),sk_c10) = sk_c11
| multiply(sk_c1,sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( multiply(sk_c1,sk_c11) = sk_c10
| inverse(sk_c3) = sk_c11 ),
prove_this_2 ).
cnf(c_0_24,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c9
| multiply(sk_c10,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c1,sk_c11) = sk_c10
| multiply(sk_c11,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( multiply(inverse(sk_c2),sk_c9) = sk_c10
| multiply(sk_c10,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_17,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( inverse(sk_c2) = sk_c10
| multiply(sk_c4,sk_c10) = sk_c9 ),
prove_this_33 ).
cnf(c_0_28,negated_conjecture,
( multiply(inverse(sk_c1),sk_c10) = sk_c11
| multiply(sk_c11,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_17,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( inverse(sk_c1) = sk_c11
| multiply(sk_c3,sk_c11) = sk_c10 ),
prove_this_11 ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| multiply(sk_c10,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( multiply(sk_c3,sk_c11) = sk_c10
| multiply(sk_c11,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( multiply(inverse(sk_c4),sk_c9) = sk_c10
| multiply(sk_c10,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_17,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
( inverse(sk_c2) = sk_c10
| inverse(sk_c4) = sk_c10 ),
prove_this_34 ).
cnf(c_0_34,negated_conjecture,
( multiply(inverse(sk_c3),sk_c10) = sk_c11
| multiply(sk_c11,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_17,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( inverse(sk_c1) = sk_c11
| inverse(sk_c3) = sk_c11 ),
prove_this_12 ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c10,sk_c9) = sk_c10
| inverse(sk_c2) = sk_c10 ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c9,sk_c10) = sk_c11
| multiply(sk_c5,sk_c8) = sk_c11 ),
prove_this_45 ).
cnf(c_0_38,negated_conjecture,
( multiply(sk_c11,sk_c10) = sk_c11
| inverse(sk_c1) = sk_c11 ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
multiply(sk_c10,sk_c9) = sk_c10,
inference(spm,[status(thm)],[c_0_26,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( multiply(inverse(sk_c5),sk_c11) = sk_c8
| multiply(sk_c9,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_17,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
( multiply(sk_c9,sk_c10) = sk_c11
| inverse(sk_c5) = sk_c8 ),
prove_this_46 ).
cnf(c_0_42,negated_conjecture,
multiply(sk_c11,sk_c10) = sk_c11,
inference(spm,[status(thm)],[c_0_28,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
identity = sk_c9,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_39]),c_0_15]) ).
cnf(c_0_44,negated_conjecture,
( multiply(sk_c9,sk_c10) = sk_c11
| multiply(sk_c8,sk_c11) = sk_c8 ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
sk_c9 = sk_c10,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_42]),c_0_15]),c_0_43]) ).
cnf(c_0_46,negated_conjecture,
( multiply(X1,sk_c11) != sk_c10
| inverse(X1) != sk_c11
| multiply(X2,sk_c10) != sk_c9
| inverse(X2) != sk_c10
| multiply(sk_c9,sk_c10) != sk_c11
| multiply(X3,sk_c11) != sk_c10
| inverse(X3) != sk_c11
| multiply(X4,sk_c10) != sk_c9
| inverse(X4) != sk_c10
| multiply(X5,X6) != sk_c11
| inverse(X5) != X6
| multiply(X6,sk_c10) != sk_c11
| inverse(X7) != X8
| inverse(X8) != X6
| multiply(X7,X6) != X8 ),
prove_this_51 ).
cnf(c_0_47,negated_conjecture,
( multiply(sk_c9,sk_c10) = sk_c11
| identity = sk_c11 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_44]),c_0_15]) ).
cnf(c_0_48,negated_conjecture,
multiply(sk_c10,sk_c10) = sk_c10,
inference(rw,[status(thm)],[c_0_39,c_0_45]) ).
cnf(c_0_49,plain,
multiply(sk_c10,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_43]),c_0_45]) ).
cnf(c_0_50,plain,
multiply(inverse(X1),X1) = sk_c10,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_43]),c_0_45]) ).
cnf(c_0_51,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_17]) ).
cnf(c_0_52,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),sk_c10) != sk_c11
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(sk_c9,sk_c10) != sk_c11
| multiply(X2,inverse(X2)) != sk_c11
| multiply(X3,sk_c10) != sk_c9
| multiply(X4,sk_c11) != sk_c10
| multiply(X5,sk_c10) != sk_c9
| multiply(X6,sk_c11) != sk_c10
| inverse(X3) != sk_c10
| inverse(X4) != sk_c11
| inverse(X5) != sk_c10
| inverse(X6) != sk_c11 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_46])]) ).
cnf(c_0_53,negated_conjecture,
sk_c11 = sk_c10,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_43]),c_0_45]),c_0_48]),c_0_45])]) ).
cnf(c_0_54,plain,
multiply(inverse(sk_c10),X1) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_49]) ).
cnf(c_0_55,plain,
multiply(X1,sk_c10) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_50]),c_0_51]) ).
cnf(c_0_56,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),sk_c10) != sk_c10
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(X2,inverse(X2)) != sk_c10
| multiply(X3,sk_c10) != sk_c10
| multiply(X4,sk_c10) != sk_c10
| multiply(X5,sk_c10) != sk_c10
| multiply(X6,sk_c10) != sk_c10
| inverse(X3) != sk_c10
| inverse(X4) != sk_c10
| inverse(X5) != sk_c10
| inverse(X6) != sk_c10 ),
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)],[c_0_52,c_0_45]),c_0_45]),c_0_45]),c_0_53]),c_0_49]),c_0_53]),c_0_53]),c_0_53]),c_0_53]),c_0_53]),c_0_53])]) ).
cnf(c_0_57,plain,
inverse(sk_c10) = sk_c10,
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(X2,inverse(X2)) != sk_c10
| inverse(X2) != sk_c10 ),
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)],[inference(rw,[status(thm)],[c_0_56,c_0_55]),c_0_55]),c_0_55]),c_0_55]),c_0_55])])])])]),c_0_57])]) ).
cnf(c_0_59,negated_conjecture,
( inverse(X1) != sk_c10
| inverse(X1) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_57]),c_0_55]),c_0_55]),c_0_49])]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_59,c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : GRP263-1 : TPTP v8.1.2. Released v2.5.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n002.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Oct 3 03:08:44 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.6ojuYFashB/E---3.1_15510.p
% 0.16/0.51 # Version: 3.1pre001
% 0.16/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.51 # Starting sh5l with 300s (1) cores
% 0.16/0.51 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 15603 completed with status 0
% 0.16/0.51 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.16/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.51 # No SInE strategy applied
% 0.16/0.51 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.16/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.51 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.16/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.16/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.16/0.51 # Starting sh5l with 136s (1) cores
% 0.16/0.51 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 15608 completed with status 0
% 0.16/0.51 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.16/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.51 # No SInE strategy applied
% 0.16/0.51 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.16/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.51 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.16/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.16/0.51 # Preprocessing time : 0.001 s
% 0.16/0.51 # Presaturation interreduction done
% 0.16/0.51
% 0.16/0.51 # Proof found!
% 0.16/0.51 # SZS status Unsatisfiable
% 0.16/0.51 # SZS output start CNFRefutation
% See solution above
% 0.16/0.51 # Parsed axioms : 54
% 0.16/0.51 # Removed by relevancy pruning/SinE : 0
% 0.16/0.51 # Initial clauses : 54
% 0.16/0.51 # Removed in clause preprocessing : 0
% 0.16/0.51 # Initial clauses in saturation : 54
% 0.16/0.51 # Processed clauses : 1713
% 0.16/0.51 # ...of these trivial : 55
% 0.16/0.51 # ...subsumed : 1026
% 0.16/0.51 # ...remaining for further processing : 632
% 0.16/0.51 # Other redundant clauses eliminated : 6
% 0.16/0.51 # Clauses deleted for lack of memory : 0
% 0.16/0.51 # Backward-subsumed : 102
% 0.16/0.51 # Backward-rewritten : 354
% 0.16/0.51 # Generated clauses : 4971
% 0.16/0.51 # ...of the previous two non-redundant : 4518
% 0.16/0.51 # ...aggressively subsumed : 0
% 0.16/0.51 # Contextual simplify-reflections : 9
% 0.16/0.51 # Paramodulations : 4966
% 0.16/0.51 # Factorizations : 0
% 0.16/0.51 # NegExts : 0
% 0.16/0.51 # Equation resolutions : 6
% 0.16/0.51 # Total rewrite steps : 2560
% 0.16/0.51 # Propositional unsat checks : 0
% 0.16/0.51 # Propositional check models : 0
% 0.16/0.51 # Propositional check unsatisfiable : 0
% 0.16/0.51 # Propositional clauses : 0
% 0.16/0.51 # Propositional clauses after purity: 0
% 0.16/0.51 # Propositional unsat core size : 0
% 0.16/0.51 # Propositional preprocessing time : 0.000
% 0.16/0.51 # Propositional encoding time : 0.000
% 0.16/0.51 # Propositional solver time : 0.000
% 0.16/0.51 # Success case prop preproc time : 0.000
% 0.16/0.51 # Success case prop encoding time : 0.000
% 0.16/0.51 # Success case prop solver time : 0.000
% 0.16/0.51 # Current number of processed clauses : 121
% 0.16/0.51 # Positive orientable unit clauses : 13
% 0.16/0.51 # Positive unorientable unit clauses: 0
% 0.16/0.51 # Negative unit clauses : 0
% 0.16/0.51 # Non-unit-clauses : 108
% 0.16/0.51 # Current number of unprocessed clauses: 1648
% 0.16/0.51 # ...number of literals in the above : 6345
% 0.16/0.51 # Current number of archived formulas : 0
% 0.16/0.51 # Current number of archived clauses : 510
% 0.16/0.51 # Clause-clause subsumption calls (NU) : 16185
% 0.16/0.51 # Rec. Clause-clause subsumption calls : 10304
% 0.16/0.51 # Non-unit clause-clause subsumptions : 1131
% 0.16/0.51 # Unit Clause-clause subsumption calls : 375
% 0.16/0.51 # Rewrite failures with RHS unbound : 0
% 0.16/0.51 # BW rewrite match attempts : 39
% 0.16/0.51 # BW rewrite match successes : 31
% 0.16/0.51 # Condensation attempts : 0
% 0.16/0.51 # Condensation successes : 0
% 0.16/0.51 # Termbank termtop insertions : 60188
% 0.16/0.51
% 0.16/0.51 # -------------------------------------------------
% 0.16/0.51 # User time : 0.076 s
% 0.16/0.51 # System time : 0.005 s
% 0.16/0.51 # Total time : 0.081 s
% 0.16/0.51 # Maximum resident set size: 1668 pages
% 0.16/0.51
% 0.16/0.51 # -------------------------------------------------
% 0.16/0.51 # User time : 0.393 s
% 0.16/0.51 # System time : 0.013 s
% 0.16/0.51 # Total time : 0.406 s
% 0.16/0.51 # Maximum resident set size: 1692 pages
% 0.16/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------