TSTP Solution File: LCL890-10 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : LCL890-10 : TPTP v8.2.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% Computer : n025.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 Jun 24 11:03:27 EDT 2024
% Result : Unsatisfiable 141.46s 18.44s
% Output : CNFRefutation 141.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 18
% Syntax : Number of clauses : 69 ( 69 unt; 0 nHn; 12 RR)
% Number of literals : 69 ( 68 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-4 aty)
% Number of variables : 129 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(sos_03,axiom,
'+'(X1,'0') = X1,
file('/export/starexec/sandbox2/tmp/tmp.IzzfSu4jmo/E---3.1_12256.p',sos_03) ).
cnf(sos_02,axiom,
'+'(X1,X2) = '+'(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.IzzfSu4jmo/E---3.1_12256.p',sos_02) ).
cnf(sos_10,axiom,
ifeq('>='(X1,X2),true,'>='('+'(X1,X3),'+'(X2,X3)),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.IzzfSu4jmo/E---3.1_12256.p',sos_10) ).
cnf(sos_09,axiom,
'>='(X1,'0') = true,
file('/export/starexec/sandbox2/tmp/tmp.IzzfSu4jmo/E---3.1_12256.p',sos_09) ).
cnf(ifeq_axiom_001,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/tmp/tmp.IzzfSu4jmo/E---3.1_12256.p',ifeq_axiom_001) ).
cnf(sos_08_1,axiom,
ifeq('>='('+'(X1,X2),X3),true,'>='(X2,'==>'(X1,X3)),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.IzzfSu4jmo/E---3.1_12256.p',sos_08_1) ).
cnf(sos_07,axiom,
ifeq2('>='(X1,X2),true,ifeq2('>='(X2,X1),true,X2,X1),X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.IzzfSu4jmo/E---3.1_12256.p',sos_07) ).
cnf(ifeq_axiom,axiom,
ifeq2(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/tmp/tmp.IzzfSu4jmo/E---3.1_12256.p',ifeq_axiom) ).
cnf(sos_05,axiom,
'>='(X1,X1) = true,
file('/export/starexec/sandbox2/tmp/tmp.IzzfSu4jmo/E---3.1_12256.p',sos_05) ).
cnf(sos_01,axiom,
'+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.IzzfSu4jmo/E---3.1_12256.p',sos_01) ).
cnf(sos_08,axiom,
ifeq('>='(X1,'==>'(X2,X3)),true,'>='('+'(X2,X1),X3),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.IzzfSu4jmo/E---3.1_12256.p',sos_08) ).
cnf(goals_14,negated_conjecture,
sK2_goals_14_X19 = '==>'(sK2_goals_14_X19,sK3_goals_14_X18),
file('/export/starexec/sandbox2/tmp/tmp.IzzfSu4jmo/E---3.1_12256.p',goals_14) ).
cnf(sos_12,axiom,
ifeq('>='(X1,X2),true,'>='('==>'(X3,X1),'==>'(X3,X2)),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.IzzfSu4jmo/E---3.1_12256.p',sos_12) ).
cnf(sos_06,axiom,
ifeq('>='(X1,X2),true,ifeq('>='(X3,X1),true,'>='(X3,X2),true),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.IzzfSu4jmo/E---3.1_12256.p',sos_06) ).
cnf(goals_14_1,negated_conjecture,
'>='('==>'(sK1_goals_14_X17,sK3_goals_14_X18),sK1_goals_14_X17) = true,
file('/export/starexec/sandbox2/tmp/tmp.IzzfSu4jmo/E---3.1_12256.p',goals_14_1) ).
cnf(sos_13,axiom,
'+'(X1,'==>'(X1,X2)) = '+'(X2,'==>'(X2,X1)),
file('/export/starexec/sandbox2/tmp/tmp.IzzfSu4jmo/E---3.1_12256.p',sos_13) ).
cnf(sos_11,axiom,
ifeq('>='(X1,X2),true,'>='('==>'(X2,X3),'==>'(X1,X3)),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.IzzfSu4jmo/E---3.1_12256.p',sos_11) ).
cnf(goals_14_2,negated_conjecture,
'>='(sK2_goals_14_X19,sK1_goals_14_X17) != true,
file('/export/starexec/sandbox2/tmp/tmp.IzzfSu4jmo/E---3.1_12256.p',goals_14_2) ).
cnf(c_0_18,axiom,
'+'(X1,'0') = X1,
sos_03 ).
cnf(c_0_19,axiom,
'+'(X1,X2) = '+'(X2,X1),
sos_02 ).
cnf(c_0_20,axiom,
ifeq('>='(X1,X2),true,'>='('+'(X1,X3),'+'(X2,X3)),true) = true,
sos_10 ).
cnf(c_0_21,plain,
'+'('0',X1) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,axiom,
'>='(X1,'0') = true,
sos_09 ).
cnf(c_0_23,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom_001 ).
cnf(c_0_24,axiom,
ifeq('>='('+'(X1,X2),X3),true,'>='(X2,'==>'(X1,X3)),true) = true,
sos_08_1 ).
cnf(c_0_25,plain,
'>='('+'(X1,X2),X2) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]) ).
cnf(c_0_26,axiom,
ifeq2('>='(X1,X2),true,ifeq2('>='(X2,X1),true,X2,X1),X1) = X1,
sos_07 ).
cnf(c_0_27,axiom,
ifeq2(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_28,axiom,
'>='(X1,X1) = true,
sos_05 ).
cnf(c_0_29,axiom,
'+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
sos_01 ).
cnf(c_0_30,axiom,
ifeq('>='(X1,'==>'(X2,X3)),true,'>='('+'(X2,X1),X3),true) = true,
sos_08 ).
cnf(c_0_31,negated_conjecture,
sK2_goals_14_X19 = '==>'(sK2_goals_14_X19,sK3_goals_14_X18),
goals_14 ).
cnf(c_0_32,axiom,
ifeq('>='(X1,X2),true,'>='('==>'(X3,X1),'==>'(X3,X2)),true) = true,
sos_12 ).
cnf(c_0_33,plain,
'>='(X1,'==>'(X2,X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_23]) ).
cnf(c_0_34,plain,
ifeq2('>='('0',X1),true,X1,'0') = '0',
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_22]),c_0_27]) ).
cnf(c_0_35,plain,
'>='(X1,'==>'(X2,'+'(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_28]),c_0_23]) ).
cnf(c_0_36,plain,
'+'(X1,'+'(X2,X3)) = '+'(X3,'+'(X1,X2)),
inference(spm,[status(thm)],[c_0_19,c_0_29]) ).
cnf(c_0_37,negated_conjecture,
ifeq('>='(X1,sK2_goals_14_X19),true,'>='('+'(sK2_goals_14_X19,X1),sK3_goals_14_X18),true) = true,
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
'>='('+'(X1,'==>'(X1,X2)),X2) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_28]),c_0_23]) ).
cnf(c_0_39,plain,
'>='('==>'(X1,X2),'==>'(X1,'==>'(X3,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_23]) ).
cnf(c_0_40,plain,
'==>'(X1,X1) = '0',
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_18]),c_0_27]) ).
cnf(c_0_41,axiom,
ifeq('>='(X1,X2),true,ifeq('>='(X3,X1),true,'>='(X3,X2),true),true) = true,
sos_06 ).
cnf(c_0_42,negated_conjecture,
'>='('==>'(sK1_goals_14_X17,sK3_goals_14_X18),sK1_goals_14_X17) = true,
goals_14_1 ).
cnf(c_0_43,plain,
ifeq('>='('+'(X1,'+'(X2,X3)),X4),true,'>='('+'(X3,X1),'==>'(X2,X4)),true) = true,
inference(spm,[status(thm)],[c_0_24,c_0_36]) ).
cnf(c_0_44,negated_conjecture,
'>='('+'(sK2_goals_14_X19,'+'(X1,'==>'(X1,sK2_goals_14_X19))),sK3_goals_14_X18) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_23]) ).
cnf(c_0_45,axiom,
'+'(X1,'==>'(X1,X2)) = '+'(X2,'==>'(X2,X1)),
sos_13 ).
cnf(c_0_46,plain,
'>='('0','==>'(X1,'==>'(X2,X1))) = true,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_47,negated_conjecture,
ifeq('>='(X1,'==>'(sK1_goals_14_X17,sK3_goals_14_X18)),true,'>='(X1,sK1_goals_14_X17),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_23]) ).
cnf(c_0_48,negated_conjecture,
'>='('+'(sK2_goals_14_X19,'==>'(X1,sK2_goals_14_X19)),'==>'(X1,sK3_goals_14_X18)) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_19]),c_0_23]) ).
cnf(c_0_49,plain,
ifeq('>='(X1,X2),true,'>='('+'(X1,'==>'(X2,X3)),'+'(X3,'==>'(X3,X2))),true) = true,
inference(spm,[status(thm)],[c_0_20,c_0_45]) ).
cnf(c_0_50,plain,
'==>'(X1,'==>'(X2,X1)) = '0',
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_46]),c_0_22]),c_0_27]),c_0_27]) ).
cnf(c_0_51,negated_conjecture,
'>='('+'(sK2_goals_14_X19,'==>'(sK1_goals_14_X17,sK2_goals_14_X19)),sK1_goals_14_X17) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_23]) ).
cnf(c_0_52,axiom,
ifeq('>='(X1,X2),true,'>='('==>'(X2,X3),'==>'(X1,X3)),true) = true,
sos_11 ).
cnf(c_0_53,plain,
ifeq('>='(X1,'==>'(X2,X3)),true,'>='('+'(X1,'==>'('==>'(X2,X3),X3)),X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_18]) ).
cnf(c_0_54,negated_conjecture,
'>='('==>'(sK1_goals_14_X17,sK2_goals_14_X19),'==>'(sK2_goals_14_X19,sK1_goals_14_X17)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_51]),c_0_23]) ).
cnf(c_0_55,plain,
ifeq('>='('+'(X1,X2),X3),true,'>='(X1,'==>'(X2,X3)),true) = true,
inference(spm,[status(thm)],[c_0_24,c_0_19]) ).
cnf(c_0_56,plain,
'>='('==>'('==>'(X1,X2),X3),'==>'(X2,X3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_33]),c_0_23]) ).
cnf(c_0_57,negated_conjecture,
'>='('+'('==>'(sK1_goals_14_X17,sK2_goals_14_X19),'==>'('==>'(sK2_goals_14_X19,sK1_goals_14_X17),sK1_goals_14_X17)),sK1_goals_14_X17) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_23]) ).
cnf(c_0_58,plain,
ifeq('>='(X1,X2),true,'>='('0','==>'(X1,X2)),true) = true,
inference(spm,[status(thm)],[c_0_24,c_0_18]) ).
cnf(c_0_59,plain,
'>='(X1,'==>'('==>'(X1,X2),X2)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_38]),c_0_23]) ).
cnf(c_0_60,plain,
ifeq('>='('==>'(X1,X2),X3),true,'>='('==>'('==>'(X4,X1),X2),X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_56]),c_0_23]) ).
cnf(c_0_61,negated_conjecture,
'>='('==>'(sK1_goals_14_X17,sK2_goals_14_X19),'==>'('==>'('==>'(sK2_goals_14_X19,sK1_goals_14_X17),sK1_goals_14_X17),sK1_goals_14_X17)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_57]),c_0_23]) ).
cnf(c_0_62,plain,
'>='('0','==>'(X1,'==>'('==>'(X1,X2),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_23]) ).
cnf(c_0_63,negated_conjecture,
'>='(sK2_goals_14_X19,sK1_goals_14_X17) != true,
inference(fof_simplification,[status(thm)],[goals_14_2]) ).
cnf(c_0_64,plain,
ifeq('>='('==>'(X1,X2),'==>'(X1,X3)),true,'>='('+'(X2,'==>'(X2,X1)),X3),true) = true,
inference(spm,[status(thm)],[c_0_30,c_0_45]) ).
cnf(c_0_65,negated_conjecture,
'>='('==>'('==>'(X1,sK1_goals_14_X17),sK2_goals_14_X19),'==>'('==>'('==>'(sK2_goals_14_X19,sK1_goals_14_X17),sK1_goals_14_X17),sK1_goals_14_X17)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_23]) ).
cnf(c_0_66,plain,
'==>'(X1,'==>'('==>'(X1,X2),X2)) = '0',
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_62]),c_0_22]),c_0_27]),c_0_27]) ).
cnf(c_0_67,negated_conjecture,
'>='(sK2_goals_14_X19,sK1_goals_14_X17) != true,
c_0_63 ).
cnf(c_0_68,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]),c_0_18]),c_0_23]),c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL890-10 : TPTP v8.2.0. Released v7.3.0.
% 0.07/0.12 % Command : run_E %s %d SAT
% 0.13/0.33 % Computer : n025.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sat Jun 22 11:00:24 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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/tmp/tmp.IzzfSu4jmo/E---3.1_12256.p
% 141.46/18.44 # Version: 3.2.0
% 141.46/18.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 141.46/18.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 141.46/18.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 141.46/18.44 # Starting new_bool_3 with 300s (1) cores
% 141.46/18.44 # Starting new_bool_1 with 300s (1) cores
% 141.46/18.44 # Starting sh5l with 300s (1) cores
% 141.46/18.44 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 12334 completed with status 0
% 141.46/18.44 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 141.46/18.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 141.46/18.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 141.46/18.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 141.46/18.44 # No SInE strategy applied
% 141.46/18.44 # Search class: FUUPM-FFSF32-MFFFFFNN
% 141.46/18.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 141.46/18.44 # Starting G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with 811s (1) cores
% 141.46/18.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 141.46/18.44 # Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 141.46/18.44 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 141.46/18.44 # Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 141.46/18.44 # G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with pid 12338 completed with status 0
% 141.46/18.44 # Result found by G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y
% 141.46/18.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 141.46/18.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 141.46/18.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 141.46/18.44 # No SInE strategy applied
% 141.46/18.44 # Search class: FUUPM-FFSF32-MFFFFFNN
% 141.46/18.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 141.46/18.44 # Starting G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with 811s (1) cores
% 141.46/18.44 # Preprocessing time : 0.001 s
% 141.46/18.44
% 141.46/18.44 # Proof found!
% 141.46/18.44 # SZS status Unsatisfiable
% 141.46/18.44 # SZS output start CNFRefutation
% See solution above
% 141.46/18.44 # Parsed axioms : 19
% 141.46/18.44 # Removed by relevancy pruning/SinE : 0
% 141.46/18.44 # Initial clauses : 19
% 141.46/18.44 # Removed in clause preprocessing : 0
% 141.46/18.44 # Initial clauses in saturation : 19
% 141.46/18.44 # Processed clauses : 13127
% 141.46/18.44 # ...of these trivial : 7878
% 141.46/18.44 # ...subsumed : 238
% 141.46/18.44 # ...remaining for further processing : 5011
% 141.46/18.44 # Other redundant clauses eliminated : 0
% 141.46/18.44 # Clauses deleted for lack of memory : 0
% 141.46/18.44 # Backward-subsumed : 0
% 141.46/18.44 # Backward-rewritten : 1052
% 141.46/18.44 # Generated clauses : 1845269
% 141.46/18.44 # ...of the previous two non-redundant : 693361
% 141.46/18.44 # ...aggressively subsumed : 0
% 141.46/18.44 # Contextual simplify-reflections : 0
% 141.46/18.44 # Paramodulations : 1845269
% 141.46/18.44 # Factorizations : 0
% 141.46/18.44 # NegExts : 0
% 141.46/18.44 # Equation resolutions : 0
% 141.46/18.44 # Disequality decompositions : 0
% 141.46/18.44 # Total rewrite steps : 3325053
% 141.46/18.44 # ...of those cached : 2731144
% 141.46/18.44 # Propositional unsat checks : 0
% 141.46/18.44 # Propositional check models : 0
% 141.46/18.44 # Propositional check unsatisfiable : 0
% 141.46/18.44 # Propositional clauses : 0
% 141.46/18.44 # Propositional clauses after purity: 0
% 141.46/18.44 # Propositional unsat core size : 0
% 141.46/18.44 # Propositional preprocessing time : 0.000
% 141.46/18.44 # Propositional encoding time : 0.000
% 141.46/18.44 # Propositional solver time : 0.000
% 141.46/18.44 # Success case prop preproc time : 0.000
% 141.46/18.44 # Success case prop encoding time : 0.000
% 141.46/18.44 # Success case prop solver time : 0.000
% 141.46/18.44 # Current number of processed clauses : 3959
% 141.46/18.44 # Positive orientable unit clauses : 3922
% 141.46/18.44 # Positive unorientable unit clauses: 36
% 141.46/18.44 # Negative unit clauses : 1
% 141.46/18.44 # Non-unit-clauses : 0
% 141.46/18.44 # Current number of unprocessed clauses: 676471
% 141.46/18.44 # ...number of literals in the above : 676471
% 141.46/18.44 # Current number of archived formulas : 0
% 141.46/18.44 # Current number of archived clauses : 1052
% 141.46/18.44 # Clause-clause subsumption calls (NU) : 0
% 141.46/18.44 # Rec. Clause-clause subsumption calls : 0
% 141.46/18.44 # Non-unit clause-clause subsumptions : 0
% 141.46/18.44 # Unit Clause-clause subsumption calls : 329
% 141.46/18.44 # Rewrite failures with RHS unbound : 0
% 141.46/18.44 # BW rewrite match attempts : 100462
% 141.46/18.44 # BW rewrite match successes : 1109
% 141.46/18.44 # Condensation attempts : 13127
% 141.46/18.44 # Condensation successes : 0
% 141.46/18.44 # Termbank termtop insertions : 28091443
% 141.46/18.44 # Search garbage collected termcells : 2
% 141.46/18.44
% 141.46/18.44 # -------------------------------------------------
% 141.46/18.44 # User time : 16.844 s
% 141.46/18.44 # System time : 0.604 s
% 141.46/18.44 # Total time : 17.448 s
% 141.46/18.44 # Maximum resident set size: 1604 pages
% 141.46/18.44
% 141.46/18.44 # -------------------------------------------------
% 141.46/18.44 # User time : 84.787 s
% 141.46/18.44 # System time : 3.101 s
% 141.46/18.44 # Total time : 87.888 s
% 141.46/18.44 # Maximum resident set size: 1696 pages
% 141.46/18.44 % E---3.1 exiting
% 141.46/18.44 % E exiting
%------------------------------------------------------------------------------