TSTP Solution File: SWC188-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC188-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 19:41:57 EDT 2023
% Result : Unsatisfiable 0.19s 0.54s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 22
% Syntax : Number of clauses : 74 ( 27 unt; 6 nHn; 74 RR)
% Number of literals : 186 ( 58 equ; 116 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 60 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_11,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
file('/export/starexec/sandbox2/tmp/tmp.gFaPJRS4h4/E---3.1_15055.p',co1_11) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.gFaPJRS4h4/E---3.1_15055.p',co1_6) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.gFaPJRS4h4/E---3.1_15055.p',clause118) ).
cnf(co1_10,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox2/tmp/tmp.gFaPJRS4h4/E---3.1_15055.p',co1_10) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.gFaPJRS4h4/E---3.1_15055.p',clause85) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.gFaPJRS4h4/E---3.1_15055.p',clause119) ).
cnf(co1_9,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox2/tmp/tmp.gFaPJRS4h4/E---3.1_15055.p',co1_9) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.gFaPJRS4h4/E---3.1_15055.p',clause86) ).
cnf(co1_8,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox2/tmp/tmp.gFaPJRS4h4/E---3.1_15055.p',co1_8) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.gFaPJRS4h4/E---3.1_15055.p',clause8) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/tmp/tmp.gFaPJRS4h4/E---3.1_15055.p',co1_7) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.gFaPJRS4h4/E---3.1_15055.p',clause149) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.gFaPJRS4h4/E---3.1_15055.p',clause99) ).
cnf(clause175,axiom,
( memberP(X4,X2)
| app(X1,cons(X2,X3)) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox2/tmp/tmp.gFaPJRS4h4/E---3.1_15055.p',clause175) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.gFaPJRS4h4/E---3.1_15055.p',clause120) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.gFaPJRS4h4/E---3.1_15055.p',co1_1) ).
cnf(co1_18,negated_conjecture,
( cons(sk9,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox2/tmp/tmp.gFaPJRS4h4/E---3.1_15055.p',co1_18) ).
cnf(co1_14,negated_conjecture,
( ssItem(sk9)
| nil = sk3 ),
file('/export/starexec/sandbox2/tmp/tmp.gFaPJRS4h4/E---3.1_15055.p',co1_14) ).
cnf(clause161,axiom,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.gFaPJRS4h4/E---3.1_15055.p',clause161) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.gFaPJRS4h4/E---3.1_15055.p',clause71) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.gFaPJRS4h4/E---3.1_15055.p',clause157) ).
cnf(co1_12,negated_conjecture,
sk5 != sk6,
file('/export/starexec/sandbox2/tmp/tmp.gFaPJRS4h4/E---3.1_15055.p',co1_12) ).
cnf(c_0_22,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
co1_11 ).
cnf(c_0_23,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_24,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause118 ).
cnf(c_0_25,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk3,
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
ssList(sk8),
co1_10 ).
cnf(c_0_27,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),cons(sk6,nil)) = nil
| sk3 != nil
| ~ ssList(app(app(sk7,cons(sk5,nil)),cons(sk6,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_28,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_29,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause119 ).
cnf(c_0_30,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),cons(sk6,nil)) = nil
| sk3 != nil
| ~ ssList(app(sk7,cons(sk5,nil)))
| ~ ssList(cons(sk6,nil)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( cons(sk6,nil) = nil
| sk3 != nil
| ~ ssList(app(sk7,cons(sk5,nil)))
| ~ ssList(cons(sk6,nil)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,negated_conjecture,
ssList(sk7),
co1_9 ).
cnf(c_0_33,negated_conjecture,
( cons(sk6,nil) = nil
| sk3 != nil
| ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_28]),c_0_32])]) ).
cnf(c_0_34,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_35,negated_conjecture,
ssItem(sk6),
co1_8 ).
cnf(c_0_36,axiom,
ssList(nil),
clause8 ).
cnf(c_0_37,negated_conjecture,
( cons(sk6,nil) = nil
| sk3 != nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_38,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_39,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_40,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause99 ).
cnf(c_0_41,negated_conjecture,
( cons(sk6,nil) = nil
| sk3 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_34]),c_0_38]),c_0_36])]) ).
cnf(c_0_42,axiom,
( memberP(X4,X2)
| app(X1,cons(X2,X3)) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssList(X4) ),
clause175 ).
cnf(c_0_43,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),app(cons(sk6,nil),sk8)) = sk3
| ~ ssList(app(sk7,cons(sk5,nil)))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_39]),c_0_26])]) ).
cnf(c_0_44,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_45,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_46,negated_conjecture,
( cons(sk9,nil) = sk3
| nil = sk3 ),
co1_18 ).
cnf(c_0_47,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_35]),c_0_36])]) ).
cnf(c_0_48,negated_conjecture,
( ssItem(sk9)
| nil = sk3 ),
co1_14 ).
cnf(c_0_49,plain,
( memberP(app(X1,cons(X2,X3)),X2)
| ~ ssItem(X2)
| ~ ssList(app(X1,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_50,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),cons(sk6,sk8)) = sk3
| ~ ssList(app(sk7,cons(sk5,nil)))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_35]),c_0_26])]) ).
cnf(c_0_51,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_45,c_0_23]) ).
cnf(c_0_52,axiom,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
clause161 ).
cnf(c_0_53,negated_conjecture,
cons(sk9,nil) = sk3,
inference(sr,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_54,negated_conjecture,
ssItem(sk9),
inference(sr,[status(thm)],[c_0_48,c_0_47]) ).
cnf(c_0_55,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_56,negated_conjecture,
( memberP(sk3,sk6)
| ~ ssList(app(sk7,cons(sk5,nil)))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_35]),c_0_51]),c_0_26])]) ).
cnf(c_0_57,negated_conjecture,
( sk9 = X1
| ~ memberP(sk3,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_36])]),c_0_55]) ).
cnf(c_0_58,negated_conjecture,
( memberP(sk3,sk6)
| ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_28]),c_0_32])]) ).
cnf(c_0_59,negated_conjecture,
( sk6 = sk9
| ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_35])]) ).
cnf(c_0_60,negated_conjecture,
( app(app(sk7,app(cons(sk5,nil),cons(sk6,nil))),sk8) = sk3
| ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_39]),c_0_32])]) ).
cnf(c_0_61,negated_conjecture,
( sk6 = sk9
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_62,negated_conjecture,
( app(app(sk7,cons(sk5,cons(sk6,nil))),sk8) = sk3
| ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_44]),c_0_38])]) ).
cnf(c_0_63,negated_conjecture,
sk6 = sk9,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_34]),c_0_38]),c_0_36])]) ).
cnf(c_0_64,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_65,negated_conjecture,
( app(app(sk7,cons(sk5,sk3)),sk8) = sk3
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_53]),c_0_53]),c_0_51])]) ).
cnf(c_0_66,plain,
( memberP(app(X1,app(cons(X2,X3),X4)),X2)
| ~ ssItem(X2)
| ~ ssList(app(X1,app(cons(X2,X3),X4)))
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_64]),c_0_28]) ).
cnf(c_0_67,negated_conjecture,
( app(sk7,app(cons(sk5,sk3),sk8)) = sk3
| ~ ssList(cons(sk5,sk3))
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_65]),c_0_32]),c_0_26])]) ).
cnf(c_0_68,negated_conjecture,
sk5 != sk6,
co1_12 ).
cnf(c_0_69,negated_conjecture,
( memberP(sk3,sk5)
| ~ ssList(cons(sk5,sk3))
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_38]),c_0_51]),c_0_32]),c_0_26])]) ).
cnf(c_0_70,negated_conjecture,
sk5 != sk9,
inference(rw,[status(thm)],[c_0_68,c_0_63]) ).
cnf(c_0_71,negated_conjecture,
( ~ ssList(cons(sk5,sk3))
| ~ ssList(cons(sk5,nil)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_69]),c_0_38])]),c_0_70]) ).
cnf(c_0_72,negated_conjecture,
~ ssList(cons(sk5,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_34]),c_0_38]),c_0_51])]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_34]),c_0_38]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC188-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n013.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 : 2400
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Oct 3 01:44:47 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 0.19/0.48 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.gFaPJRS4h4/E---3.1_15055.p
% 0.19/0.54 # Version: 3.1pre001
% 0.19/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.54 # Starting sh5l with 300s (1) cores
% 0.19/0.54 # new_bool_3 with pid 15141 completed with status 0
% 0.19/0.54 # Result found by new_bool_3
% 0.19/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.54 # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.19/0.54 # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.19/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.54 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 15146 completed with status 0
% 0.19/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.54 # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.19/0.54 # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.19/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.54 # Preprocessing time : 0.003 s
% 0.19/0.54 # Presaturation interreduction done
% 0.19/0.54
% 0.19/0.54 # Proof found!
% 0.19/0.54 # SZS status Unsatisfiable
% 0.19/0.54 # SZS output start CNFRefutation
% See solution above
% 0.19/0.54 # Parsed axioms : 205
% 0.19/0.54 # Removed by relevancy pruning/SinE : 149
% 0.19/0.54 # Initial clauses : 56
% 0.19/0.54 # Removed in clause preprocessing : 0
% 0.19/0.54 # Initial clauses in saturation : 56
% 0.19/0.54 # Processed clauses : 756
% 0.19/0.54 # ...of these trivial : 8
% 0.19/0.54 # ...subsumed : 410
% 0.19/0.54 # ...remaining for further processing : 338
% 0.19/0.54 # Other redundant clauses eliminated : 10
% 0.19/0.54 # Clauses deleted for lack of memory : 0
% 0.19/0.54 # Backward-subsumed : 81
% 0.19/0.54 # Backward-rewritten : 15
% 0.19/0.54 # Generated clauses : 2667
% 0.19/0.54 # ...of the previous two non-redundant : 2360
% 0.19/0.54 # ...aggressively subsumed : 0
% 0.19/0.54 # Contextual simplify-reflections : 34
% 0.19/0.54 # Paramodulations : 2648
% 0.19/0.54 # Factorizations : 0
% 0.19/0.54 # NegExts : 0
% 0.19/0.54 # Equation resolutions : 16
% 0.19/0.54 # Total rewrite steps : 3388
% 0.19/0.54 # Propositional unsat checks : 0
% 0.19/0.54 # Propositional check models : 0
% 0.19/0.54 # Propositional check unsatisfiable : 0
% 0.19/0.54 # Propositional clauses : 0
% 0.19/0.54 # Propositional clauses after purity: 0
% 0.19/0.54 # Propositional unsat core size : 0
% 0.19/0.54 # Propositional preprocessing time : 0.000
% 0.19/0.54 # Propositional encoding time : 0.000
% 0.19/0.54 # Propositional solver time : 0.000
% 0.19/0.54 # Success case prop preproc time : 0.000
% 0.19/0.54 # Success case prop encoding time : 0.000
% 0.19/0.54 # Success case prop solver time : 0.000
% 0.19/0.54 # Current number of processed clauses : 182
% 0.19/0.54 # Positive orientable unit clauses : 23
% 0.19/0.54 # Positive unorientable unit clauses: 0
% 0.19/0.54 # Negative unit clauses : 10
% 0.19/0.54 # Non-unit-clauses : 149
% 0.19/0.54 # Current number of unprocessed clauses: 1597
% 0.19/0.54 # ...number of literals in the above : 8656
% 0.19/0.54 # Current number of archived formulas : 0
% 0.19/0.54 # Current number of archived clauses : 152
% 0.19/0.54 # Clause-clause subsumption calls (NU) : 8896
% 0.19/0.54 # Rec. Clause-clause subsumption calls : 2793
% 0.19/0.54 # Non-unit clause-clause subsumptions : 287
% 0.19/0.54 # Unit Clause-clause subsumption calls : 562
% 0.19/0.54 # Rewrite failures with RHS unbound : 0
% 0.19/0.54 # BW rewrite match attempts : 8
% 0.19/0.54 # BW rewrite match successes : 7
% 0.19/0.54 # Condensation attempts : 0
% 0.19/0.54 # Condensation successes : 0
% 0.19/0.54 # Termbank termtop insertions : 53357
% 0.19/0.54
% 0.19/0.54 # -------------------------------------------------
% 0.19/0.54 # User time : 0.043 s
% 0.19/0.54 # System time : 0.010 s
% 0.19/0.54 # Total time : 0.053 s
% 0.19/0.54 # Maximum resident set size: 1976 pages
% 0.19/0.54
% 0.19/0.54 # -------------------------------------------------
% 0.19/0.54 # User time : 0.046 s
% 0.19/0.54 # System time : 0.013 s
% 0.19/0.54 # Total time : 0.059 s
% 0.19/0.54 # Maximum resident set size: 1852 pages
% 0.19/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------