TSTP Solution File: SWC072-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC072-1 : TPTP v8.1.2. Released v2.4.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 19:39:10 EDT 2023
% Result : Unsatisfiable 0.18s 0.53s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 19
% Syntax : Number of clauses : 71 ( 20 unt; 12 nHn; 71 RR)
% Number of literals : 198 ( 61 equ; 124 neg)
% Maximal clause size : 12 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 63 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_9,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox2/tmp/tmp.tbV64qN9RC/E---3.1_11431.p',co1_9) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.tbV64qN9RC/E---3.1_11431.p',co1_5) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.tbV64qN9RC/E---3.1_11431.p',co1_2) ).
cnf(co1_8,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox2/tmp/tmp.tbV64qN9RC/E---3.1_11431.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.tbV64qN9RC/E---3.1_11431.p',co1_6) ).
cnf(co1_10,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk4) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk4) != X4
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.tbV64qN9RC/E---3.1_11431.p',co1_10) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.tbV64qN9RC/E---3.1_11431.p',clause100) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.tbV64qN9RC/E---3.1_11431.p',clause75) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.tbV64qN9RC/E---3.1_11431.p',clause85) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.tbV64qN9RC/E---3.1_11431.p',clause8) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.tbV64qN9RC/E---3.1_11431.p',clause76) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox2/tmp/tmp.tbV64qN9RC/E---3.1_11431.p',clause173) ).
cnf(co1_7,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.tbV64qN9RC/E---3.1_11431.p',co1_7) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.tbV64qN9RC/E---3.1_11431.p',clause74) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.tbV64qN9RC/E---3.1_11431.p',clause73) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.tbV64qN9RC/E---3.1_11431.p',clause120) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.tbV64qN9RC/E---3.1_11431.p',clause104) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.tbV64qN9RC/E---3.1_11431.p',clause86) ).
cnf(clause57,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.tbV64qN9RC/E---3.1_11431.p',clause57) ).
cnf(c_0_19,negated_conjecture,
( nil != sk2
| nil != sk1 ),
co1_9 ).
cnf(c_0_20,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_21,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_22,negated_conjecture,
( nil = sk3
| nil != sk4 ),
co1_8 ).
cnf(c_0_23,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_24,negated_conjecture,
( sk1 != nil
| sk4 != nil ),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk4) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk4) != X4
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
co1_10 ).
cnf(c_0_26,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_27,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_28,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
clause75 ).
cnf(c_0_29,negated_conjecture,
sk4 != nil,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( sk3 = X1
| tl(sk4) != X2
| hd(sk4) != X4
| app(X2,X3) != X1
| cons(X4,nil) != X3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(cn,[status(thm)],[c_0_25]) ).
cnf(c_0_31,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_32,negated_conjecture,
( X1 = sk4
| neq(sk4,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,axiom,
ssList(nil),
clause8 ).
cnf(c_0_34,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
clause76 ).
cnf(c_0_35,negated_conjecture,
ssList(tl(sk4)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_27]),c_0_29]) ).
cnf(c_0_36,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_37,negated_conjecture,
( app(tl(sk4),cons(hd(sk4),nil)) = sk1
| ~ neq(nil,sk4)
| ~ neq(sk4,nil)
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil))
| ~ ssList(tl(sk4)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_23])])])])]),c_0_31]) ).
cnf(c_0_38,negated_conjecture,
neq(sk4,nil),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_29]) ).
cnf(c_0_39,negated_conjecture,
ssItem(hd(sk4)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_27]),c_0_29]) ).
cnf(c_0_40,plain,
( X1 = nil
| neq(nil,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_33]) ).
cnf(c_0_41,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
co1_7 ).
cnf(c_0_42,negated_conjecture,
( X1 = tl(sk4)
| neq(tl(sk4),X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_35]) ).
cnf(c_0_43,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_44,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_45,negated_conjecture,
( app(tl(sk4),cons(hd(sk4),nil)) = sk1
| ~ neq(nil,sk4)
| ~ ssList(cons(hd(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_35])]),c_0_38]),c_0_39])]) ).
cnf(c_0_46,negated_conjecture,
neq(nil,sk4),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_27]),c_0_29]) ).
cnf(c_0_47,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_48,negated_conjecture,
( ~ neq(X1,nil)
| ~ segmentP(sk1,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_41,c_0_20]) ).
cnf(c_0_49,negated_conjecture,
( tl(sk4) = nil
| neq(tl(sk4),nil) ),
inference(spm,[status(thm)],[c_0_42,c_0_33]) ).
cnf(c_0_50,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_33])]),c_0_31]) ).
cnf(c_0_51,negated_conjecture,
( app(tl(sk4),cons(hd(sk4),nil)) = sk1
| ~ ssList(cons(hd(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]) ).
cnf(c_0_52,plain,
( segmentP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_47]),c_0_33])]),c_0_31]) ).
cnf(c_0_53,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_54,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_55,negated_conjecture,
( tl(sk4) = nil
| ~ segmentP(sk1,tl(sk4))
| ~ segmentP(sk4,tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_35])]) ).
cnf(c_0_56,negated_conjecture,
( segmentP(sk1,tl(sk4))
| ~ ssList(cons(hd(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_35])]) ).
cnf(c_0_57,plain,
( segmentP(cons(X1,X2),X2)
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_58,negated_conjecture,
cons(hd(sk4),tl(sk4)) = sk4,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_27]),c_0_29]) ).
cnf(c_0_59,negated_conjecture,
( tl(sk4) = nil
| ~ segmentP(sk4,tl(sk4))
| ~ ssList(cons(hd(sk4),nil)) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_60,negated_conjecture,
( segmentP(sk4,tl(sk4))
| ~ ssList(cons(hd(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_39]),c_0_35])]) ).
cnf(c_0_61,negated_conjecture,
( tl(sk4) = nil
| ~ ssList(cons(hd(sk4),nil)) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_62,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_63,negated_conjecture,
tl(sk4) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_39]),c_0_33])]) ).
cnf(c_0_64,negated_conjecture,
( segmentP(sk1,cons(hd(sk4),nil))
| ~ ssList(cons(hd(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_51]),c_0_35])]) ).
cnf(c_0_65,negated_conjecture,
cons(hd(sk4),nil) = sk4,
inference(rw,[status(thm)],[c_0_58,c_0_63]) ).
cnf(c_0_66,negated_conjecture,
( ~ segmentP(sk1,sk4)
| ~ segmentP(sk4,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_38]),c_0_27])]) ).
cnf(c_0_67,negated_conjecture,
segmentP(sk1,sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65]),c_0_65]),c_0_27])]) ).
cnf(c_0_68,negated_conjecture,
~ segmentP(sk4,sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67])]) ).
cnf(c_0_69,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
clause57 ).
cnf(c_0_70,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC072-1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n027.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 02:26:31 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.tbV64qN9RC/E---3.1_11431.p
% 0.18/0.53 # Version: 3.1pre001
% 0.18/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.53 # Starting sh5l with 300s (1) cores
% 0.18/0.53 # new_bool_3 with pid 11510 completed with status 0
% 0.18/0.53 # Result found by new_bool_3
% 0.18/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.53 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.18/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 11513 completed with status 0
% 0.18/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.53 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.18/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.53 # Preprocessing time : 0.006 s
% 0.18/0.53 # Presaturation interreduction done
% 0.18/0.53
% 0.18/0.53 # Proof found!
% 0.18/0.53 # SZS status Unsatisfiable
% 0.18/0.53 # SZS output start CNFRefutation
% See solution above
% 0.18/0.53 # Parsed axioms : 195
% 0.18/0.53 # Removed by relevancy pruning/SinE : 121
% 0.18/0.53 # Initial clauses : 74
% 0.18/0.53 # Removed in clause preprocessing : 0
% 0.18/0.53 # Initial clauses in saturation : 74
% 0.18/0.53 # Processed clauses : 596
% 0.18/0.53 # ...of these trivial : 15
% 0.18/0.53 # ...subsumed : 156
% 0.18/0.53 # ...remaining for further processing : 425
% 0.18/0.53 # Other redundant clauses eliminated : 19
% 0.18/0.53 # Clauses deleted for lack of memory : 0
% 0.18/0.53 # Backward-subsumed : 16
% 0.18/0.53 # Backward-rewritten : 97
% 0.18/0.53 # Generated clauses : 1652
% 0.18/0.53 # ...of the previous two non-redundant : 1547
% 0.18/0.53 # ...aggressively subsumed : 0
% 0.18/0.53 # Contextual simplify-reflections : 54
% 0.18/0.53 # Paramodulations : 1616
% 0.18/0.53 # Factorizations : 0
% 0.18/0.53 # NegExts : 0
% 0.18/0.53 # Equation resolutions : 24
% 0.18/0.53 # Total rewrite steps : 965
% 0.18/0.53 # Propositional unsat checks : 0
% 0.18/0.53 # Propositional check models : 0
% 0.18/0.53 # Propositional check unsatisfiable : 0
% 0.18/0.53 # Propositional clauses : 0
% 0.18/0.53 # Propositional clauses after purity: 0
% 0.18/0.53 # Propositional unsat core size : 0
% 0.18/0.53 # Propositional preprocessing time : 0.000
% 0.18/0.53 # Propositional encoding time : 0.000
% 0.18/0.53 # Propositional solver time : 0.000
% 0.18/0.53 # Success case prop preproc time : 0.000
% 0.18/0.53 # Success case prop encoding time : 0.000
% 0.18/0.53 # Success case prop solver time : 0.000
% 0.18/0.53 # Current number of processed clauses : 220
% 0.18/0.53 # Positive orientable unit clauses : 26
% 0.18/0.53 # Positive unorientable unit clauses: 0
% 0.18/0.53 # Negative unit clauses : 13
% 0.18/0.53 # Non-unit-clauses : 181
% 0.18/0.53 # Current number of unprocessed clauses: 1049
% 0.18/0.53 # ...number of literals in the above : 5213
% 0.18/0.53 # Current number of archived formulas : 0
% 0.18/0.53 # Current number of archived clauses : 194
% 0.18/0.53 # Clause-clause subsumption calls (NU) : 8348
% 0.18/0.53 # Rec. Clause-clause subsumption calls : 3115
% 0.18/0.53 # Non-unit clause-clause subsumptions : 175
% 0.18/0.53 # Unit Clause-clause subsumption calls : 812
% 0.18/0.53 # Rewrite failures with RHS unbound : 0
% 0.18/0.53 # BW rewrite match attempts : 7
% 0.18/0.53 # BW rewrite match successes : 7
% 0.18/0.53 # Condensation attempts : 0
% 0.18/0.53 # Condensation successes : 0
% 0.18/0.53 # Termbank termtop insertions : 34996
% 0.18/0.53
% 0.18/0.53 # -------------------------------------------------
% 0.18/0.53 # User time : 0.045 s
% 0.18/0.53 # System time : 0.010 s
% 0.18/0.53 # Total time : 0.056 s
% 0.18/0.53 # Maximum resident set size: 1964 pages
% 0.18/0.53
% 0.18/0.53 # -------------------------------------------------
% 0.18/0.53 # User time : 0.047 s
% 0.18/0.53 # System time : 0.013 s
% 0.18/0.53 # Total time : 0.061 s
% 0.18/0.53 # Maximum resident set size: 1848 pages
% 0.18/0.53 % E---3.1 exiting
% 0.18/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------