TSTP Solution File: BOO038-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : BOO038-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:18:35 EDT 2023
% Result : Unsatisfiable 46.88s 6.38s
% Output : CNFRefutation 46.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 2
% Syntax : Number of clauses : 62 ( 59 unt; 0 nHn; 5 RR)
% Number of literals : 67 ( 66 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 15 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 133 ( 31 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(dn1,axiom,
inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4)))))))) = X3,
file('/export/starexec/sandbox/tmp/tmp.Vfv7Rqz5ta/E---3.1_10172.p',dn1) ).
cnf(huntinton,negated_conjecture,
( add(b,a) != add(a,b)
| add(add(a,b),c) != add(a,add(b,c))
| add(inverse(add(inverse(a),b)),inverse(add(inverse(a),inverse(b)))) != a ),
file('/export/starexec/sandbox/tmp/tmp.Vfv7Rqz5ta/E---3.1_10172.p',huntinton) ).
cnf(c_0_2,axiom,
inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4)))))))) = X3,
dn1 ).
cnf(c_0_3,plain,
inverse(add(inverse(add(inverse(add(inverse(add(inverse(add(inverse(inverse(X1)),X2)),X1)),X3)),inverse(X1))),X1)) = inverse(X1),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
inverse(add(inverse(add(X1,inverse(X1))),X1)) = inverse(X1),
inference(spm,[status(thm)],[c_0_3,c_0_2]) ).
cnf(c_0_5,plain,
inverse(add(inverse(X1),inverse(add(X1,inverse(add(inverse(X1),inverse(add(X1,X2)))))))) = X1,
inference(spm,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_6,plain,
inverse(add(inverse(add(X1,X2)),inverse(add(inverse(add(inverse(add(X3,X4)),X1)),inverse(add(inverse(X2),inverse(add(X2,X5)))))))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_7,plain,
inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,X3)))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_5]) ).
cnf(c_0_8,plain,
inverse(add(inverse(add(inverse(add(X1,X2)),X1)),inverse(add(X1,X2)))) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
inverse(add(inverse(add(X1,X2)),inverse(add(inverse(X1),X2)))) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_10,plain,
inverse(add(inverse(X1),inverse(add(X1,X1)))) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_11,plain,
inverse(add(inverse(add(inverse(X1),X1)),inverse(X1))) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_12,plain,
inverse(add(inverse(add(X1,inverse(add(X1,X1)))),X1)) = inverse(add(X1,X1)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
inverse(add(X1,inverse(add(inverse(X1),inverse(X1))))) = inverse(X1),
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_14,plain,
inverse(add(inverse(add(X1,X1)),inverse(add(X1,X1)))) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_12]) ).
cnf(c_0_15,plain,
inverse(add(inverse(X1),inverse(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_13]),c_0_13]) ).
cnf(c_0_16,plain,
add(X1,X1) = X1,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
inverse(add(inverse(add(add(X1,inverse(X1)),X1)),inverse(X1))) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_4]) ).
cnf(c_0_18,plain,
inverse(add(inverse(add(inverse(add(X1,X2)),X1)),inverse(X1))) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_16]) ).
cnf(c_0_19,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
inverse(add(X1,inverse(add(add(X1,inverse(X1)),inverse(X1))))) = inverse(X1),
inference(spm,[status(thm)],[c_0_7,c_0_17]) ).
cnf(c_0_21,plain,
inverse(add(X1,add(X2,X1))) = inverse(add(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_7]),c_0_19]) ).
cnf(c_0_22,plain,
inverse(add(inverse(add(inverse(X1),X2)),inverse(add(X1,X2)))) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_20]) ).
cnf(c_0_23,plain,
add(X1,add(X2,X1)) = add(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_21]),c_0_16]),c_0_21]),c_0_16]),c_0_19]) ).
cnf(c_0_24,plain,
add(inverse(add(inverse(X1),X2)),inverse(add(X1,X2))) = inverse(X2),
inference(spm,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_25,plain,
inverse(add(inverse(X1),inverse(add(inverse(add(inverse(add(inverse(add(inverse(inverse(X1)),X2)),X1)),X3)),inverse(add(inverse(X1),inverse(add(X1,X4)))))))) = X1,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_26,plain,
add(inverse(add(X1,X2)),inverse(X2)) = inverse(X2),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
inverse(add(X1,add(X1,X2))) = inverse(add(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_8]),c_0_19]) ).
cnf(c_0_28,plain,
inverse(add(inverse(X1),inverse(add(X1,X2)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_19]),c_0_27]) ).
cnf(c_0_29,plain,
add(inverse(X1),inverse(add(X1,X2))) = inverse(X1),
inference(spm,[status(thm)],[c_0_19,c_0_28]) ).
cnf(c_0_30,plain,
inverse(add(X1,inverse(add(inverse(add(X2,X3)),inverse(add(inverse(inverse(add(X2,inverse(add(inverse(X1),inverse(add(X1,X4))))))),inverse(add(inverse(add(X2,inverse(add(inverse(X1),inverse(add(X1,X4)))))),X5)))))))) = inverse(add(X2,inverse(add(inverse(X1),inverse(add(X1,X4)))))),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_31,plain,
add(X1,inverse(add(inverse(X1),X2))) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_19]) ).
cnf(c_0_32,plain,
inverse(add(X1,X2)) = inverse(add(X2,X1)),
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(spm,[status(thm)],[c_0_30,c_0_31]),c_0_19]),c_0_28]),c_0_28]),c_0_31]),c_0_29]),c_0_19]),c_0_28]) ).
cnf(c_0_33,plain,
add(inverse(add(X1,X2)),inverse(add(inverse(X1),X2))) = inverse(X2),
inference(spm,[status(thm)],[c_0_19,c_0_9]) ).
cnf(c_0_34,plain,
add(X1,X2) = add(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_32]),c_0_19]) ).
cnf(c_0_35,plain,
add(X1,inverse(add(X1,inverse(add(X1,X2))))) = add(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_29]),c_0_19]),c_0_19]),c_0_19]) ).
cnf(c_0_36,plain,
inverse(add(inverse(add(X1,X2)),inverse(add(inverse(add(X2,X3)),X1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_34]),c_0_28]),c_0_34]) ).
cnf(c_0_37,plain,
inverse(add(inverse(add(X1,X2)),inverse(add(X1,inverse(add(X1,X2)))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_32]),c_0_32]) ).
cnf(c_0_38,plain,
inverse(add(inverse(add(X1,X2)),inverse(add(inverse(add(X3,X1)),inverse(add(inverse(X2),inverse(add(X2,X4)))))))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_6]) ).
cnf(c_0_39,plain,
add(inverse(add(X1,X2)),inverse(add(X1,inverse(add(X1,X2))))) = add(inverse(add(X1,X2)),inverse(add(inverse(add(X2,X3)),X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_32]) ).
cnf(c_0_40,plain,
add(inverse(add(X1,X2)),inverse(add(X1,inverse(add(X1,X2))))) = inverse(X1),
inference(spm,[status(thm)],[c_0_19,c_0_37]) ).
cnf(c_0_41,plain,
inverse(add(X1,inverse(add(inverse(add(X2,inverse(add(X3,X1)))),inverse(add(inverse(add(X4,X3)),X1)))))) = inverse(add(inverse(add(X4,X3)),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_38]),c_0_19]),c_0_28]),c_0_28]),c_0_31]),c_0_28]) ).
cnf(c_0_42,plain,
add(inverse(add(X1,X2)),inverse(add(inverse(add(X2,X3)),X1))) = inverse(X1),
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
inverse(add(X1,inverse(add(X2,inverse(add(X2,X1)))))) = inverse(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_19]),c_0_16]),c_0_34]),c_0_34]) ).
cnf(c_0_44,plain,
add(X1,inverse(add(X2,inverse(add(X2,X1))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_43]),c_0_19]) ).
cnf(c_0_45,plain,
inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(add(X1,X2)),inverse(add(inverse(add(X1,X2)),X3)))))))) = inverse(add(inverse(add(X1,X2)),inverse(add(inverse(add(X1,X2)),X3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_35]),c_0_19]),c_0_31]) ).
cnf(c_0_46,plain,
add(X1,inverse(add(X2,inverse(add(X1,X2))))) = X1,
inference(spm,[status(thm)],[c_0_44,c_0_34]) ).
cnf(c_0_47,plain,
inverse(add(X1,inverse(add(X2,X1)))) = inverse(add(X1,inverse(X2))),
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(spm,[status(thm)],[c_0_45,c_0_33]),c_0_19]),c_0_19]),c_0_34]),c_0_46]),c_0_19]),c_0_34]) ).
cnf(c_0_48,plain,
inverse(add(X1,inverse(add(inverse(add(X2,X3)),inverse(add(X3,X1)))))) = inverse(add(X3,X1)),
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(spm,[status(thm)],[c_0_30,c_0_30]),c_0_28]),c_0_28]),c_0_19]),c_0_28]),c_0_31]),c_0_28]) ).
cnf(c_0_49,plain,
add(X1,inverse(add(X2,X1))) = add(X1,inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_47]),c_0_19]) ).
cnf(c_0_50,plain,
add(X1,inverse(add(inverse(add(X2,X3)),inverse(add(X3,X1))))) = add(X3,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_48]),c_0_19]) ).
cnf(c_0_51,plain,
add(inverse(add(X1,X2)),inverse(add(X2,add(X1,X3)))) = inverse(add(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_2]),c_0_28]),c_0_28]),c_0_34]),c_0_49]),c_0_19]) ).
cnf(c_0_52,negated_conjecture,
( add(b,a) != add(a,b)
| add(add(a,b),c) != add(a,add(b,c))
| add(inverse(add(inverse(a),b)),inverse(add(inverse(a),inverse(b)))) != a ),
huntinton ).
cnf(c_0_53,plain,
add(add(X1,X2),add(X1,X3)) = add(X3,add(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_19]) ).
cnf(c_0_54,plain,
add(X1,inverse(add(inverse(add(X2,X3)),inverse(add(X2,X1))))) = add(X2,X1),
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(spm,[status(thm)],[c_0_19,c_0_30]),c_0_19]),c_0_19]),c_0_28]),c_0_28]),c_0_31]),c_0_28]) ).
cnf(c_0_55,negated_conjecture,
( add(inverse(add(b,inverse(a))),inverse(add(inverse(a),inverse(b)))) != a
| add(c,add(a,b)) != add(a,add(b,c)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_32]),c_0_34]),c_0_34])]) ).
cnf(c_0_56,plain,
add(inverse(add(X1,X2)),inverse(add(X2,inverse(X1)))) = inverse(X2),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_57,plain,
add(add(X1,X2),add(X3,X1)) = add(X3,add(X1,X2)),
inference(spm,[status(thm)],[c_0_53,c_0_34]) ).
cnf(c_0_58,plain,
add(add(X1,X2),add(X2,X3)) = add(X3,add(X1,X2)),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_59,negated_conjecture,
add(c,add(a,b)) != add(a,add(b,c)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56]),c_0_19])]) ).
cnf(c_0_60,plain,
add(X1,add(X2,X3)) = add(X2,add(X3,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_57]),c_0_58]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60]),c_0_34]),c_0_60]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : BOO038-1 : TPTP v8.1.2. Released v2.5.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n022.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.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 20:34:24 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/0.43 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.Vfv7Rqz5ta/E---3.1_10172.p
% 46.88/6.38 # Version: 3.1pre001
% 46.88/6.38 # Preprocessing class: FSSSSMSSSSSNFFN.
% 46.88/6.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 46.88/6.38 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 46.88/6.38 # Starting new_bool_3 with 300s (1) cores
% 46.88/6.38 # Starting new_bool_1 with 300s (1) cores
% 46.88/6.38 # Starting sh5l with 300s (1) cores
% 46.88/6.38 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 10250 completed with status 0
% 46.88/6.38 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 46.88/6.38 # Preprocessing class: FSSSSMSSSSSNFFN.
% 46.88/6.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 46.88/6.38 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 46.88/6.38 # No SInE strategy applied
% 46.88/6.38 # Search class: FUHPF-FFSF21-DFFFFFNN
% 46.88/6.38 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 46.88/6.38 # Starting G-E--_208_C18_F2_SE_CS_SP_PS_S5PRR_RG_S04A with 811s (1) cores
% 46.88/6.38 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 46.88/6.38 # Starting new_bool_3 with 136s (1) cores
% 46.88/6.38 # Starting new_bool_1 with 136s (1) cores
% 46.88/6.38 # Starting sh5l with 136s (1) cores
% 46.88/6.38 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 10257 completed with status 0
% 46.88/6.38 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 46.88/6.38 # Preprocessing class: FSSSSMSSSSSNFFN.
% 46.88/6.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 46.88/6.38 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 46.88/6.38 # No SInE strategy applied
% 46.88/6.38 # Search class: FUHPF-FFSF21-DFFFFFNN
% 46.88/6.38 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 46.88/6.38 # Starting G-E--_208_C18_F2_SE_CS_SP_PS_S5PRR_RG_S04A with 811s (1) cores
% 46.88/6.38 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 46.88/6.38 # Preprocessing time : 0.003 s
% 46.88/6.38
% 46.88/6.38 # Proof found!
% 46.88/6.38 # SZS status Unsatisfiable
% 46.88/6.38 # SZS output start CNFRefutation
% See solution above
% 46.88/6.38 # Parsed axioms : 2
% 46.88/6.38 # Removed by relevancy pruning/SinE : 0
% 46.88/6.38 # Initial clauses : 2
% 46.88/6.38 # Removed in clause preprocessing : 0
% 46.88/6.38 # Initial clauses in saturation : 2
% 46.88/6.38 # Processed clauses : 5565
% 46.88/6.38 # ...of these trivial : 2032
% 46.88/6.38 # ...subsumed : 3158
% 46.88/6.38 # ...remaining for further processing : 375
% 46.88/6.38 # Other redundant clauses eliminated : 0
% 46.88/6.38 # Clauses deleted for lack of memory : 0
% 46.88/6.38 # Backward-subsumed : 1
% 46.88/6.38 # Backward-rewritten : 158
% 46.88/6.38 # Generated clauses : 224048
% 46.88/6.38 # ...of the previous two non-redundant : 148237
% 46.88/6.38 # ...aggressively subsumed : 0
% 46.88/6.38 # Contextual simplify-reflections : 0
% 46.88/6.38 # Paramodulations : 224048
% 46.88/6.38 # Factorizations : 0
% 46.88/6.38 # NegExts : 0
% 46.88/6.38 # Equation resolutions : 0
% 46.88/6.38 # Total rewrite steps : 580033
% 46.88/6.38 # Propositional unsat checks : 0
% 46.88/6.38 # Propositional check models : 0
% 46.88/6.38 # Propositional check unsatisfiable : 0
% 46.88/6.38 # Propositional clauses : 0
% 46.88/6.38 # Propositional clauses after purity: 0
% 46.88/6.38 # Propositional unsat core size : 0
% 46.88/6.38 # Propositional preprocessing time : 0.000
% 46.88/6.38 # Propositional encoding time : 0.000
% 46.88/6.38 # Propositional solver time : 0.000
% 46.88/6.38 # Success case prop preproc time : 0.000
% 46.88/6.38 # Success case prop encoding time : 0.000
% 46.88/6.38 # Success case prop solver time : 0.000
% 46.88/6.38 # Current number of processed clauses : 216
% 46.88/6.38 # Positive orientable unit clauses : 213
% 46.88/6.38 # Positive unorientable unit clauses: 3
% 46.88/6.38 # Negative unit clauses : 0
% 46.88/6.38 # Non-unit-clauses : 0
% 46.88/6.38 # Current number of unprocessed clauses: 131209
% 46.88/6.38 # ...number of literals in the above : 131209
% 46.88/6.38 # Current number of archived formulas : 0
% 46.88/6.38 # Current number of archived clauses : 159
% 46.88/6.38 # Clause-clause subsumption calls (NU) : 0
% 46.88/6.38 # Rec. Clause-clause subsumption calls : 0
% 46.88/6.38 # Non-unit clause-clause subsumptions : 0
% 46.88/6.38 # Unit Clause-clause subsumption calls : 377
% 46.88/6.38 # Rewrite failures with RHS unbound : 0
% 46.88/6.38 # BW rewrite match attempts : 15770
% 46.88/6.38 # BW rewrite match successes : 333
% 46.88/6.38 # Condensation attempts : 0
% 46.88/6.38 # Condensation successes : 0
% 46.88/6.38 # Termbank termtop insertions : 8896734
% 46.88/6.38
% 46.88/6.38 # -------------------------------------------------
% 46.88/6.38 # User time : 5.733 s
% 46.88/6.38 # System time : 0.152 s
% 46.88/6.38 # Total time : 5.885 s
% 46.88/6.38 # Maximum resident set size: 1544 pages
% 46.88/6.38
% 46.88/6.38 # -------------------------------------------------
% 46.88/6.38 # User time : 29.111 s
% 46.88/6.38 # System time : 0.260 s
% 46.88/6.38 # Total time : 29.371 s
% 46.88/6.38 # Maximum resident set size: 1676 pages
% 46.88/6.38 % E---3.1 exiting
%------------------------------------------------------------------------------