TSTP Solution File: SWC363-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC363-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 : Tue May 21 04:26:05 EDT 2024
% Result : Unsatisfiable 2.12s 0.77s
% Output : CNFRefutation 2.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 21
% Syntax : Number of clauses : 76 ( 28 unt; 5 nHn; 65 RR)
% Number of literals : 193 ( 33 equ; 122 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 102 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_11,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_10,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause179,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause169,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause169) ).
cnf(co1_8,negated_conjecture,
~ segmentP(sk2,sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_12,negated_conjecture,
( memberP(sk4,sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(c_0_21,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_22,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_23,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_24,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_25,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_26,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
c_0_21 ).
cnf(c_0_27,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
c_0_24 ).
cnf(c_0_29,plain,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
inference(fof_simplification,[status(thm)],[clause179]) ).
cnf(c_0_30,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_31,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_32,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_33,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_25 ).
cnf(c_0_34,negated_conjecture,
cons(sk5,nil) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).
cnf(c_0_35,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_27])]) ).
cnf(c_0_36,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_37,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_38,plain,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
c_0_29 ).
cnf(c_0_39,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_30 ).
cnf(c_0_40,axiom,
ssList(nil),
clause8 ).
cnf(c_0_41,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_31 ).
cnf(c_0_42,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_43,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_32 ).
cnf(c_0_44,negated_conjecture,
( app(sk3,X1) = cons(sk5,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_45,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_46,plain,
( app(cons(X1,X2),cons(X1,X3)) != X4
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(X4) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]),c_0_41]) ).
cnf(c_0_47,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
c_0_42 ).
cnf(c_0_48,negated_conjecture,
( ssList(cons(sk5,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]) ).
cnf(c_0_49,plain,
( cons(X1,cons(X1,X2)) != X3
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(X3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_33]),c_0_40])]),c_0_41]) ).
cnf(c_0_50,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(cons(sk5,X2))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
inference(fof_simplification,[status(thm)],[clause173]) ).
cnf(c_0_52,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_53,negated_conjecture,
( cons(sk5,sk3) != X1
| ~ ssList(X1)
| ~ duplicatefreeP(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_34]),c_0_35]),c_0_40])]) ).
cnf(c_0_54,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(cons(sk5,sk3)) ),
inference(spm,[status(thm)],[c_0_50,c_0_45]) ).
cnf(c_0_55,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_51 ).
cnf(c_0_56,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_52 ).
cnf(c_0_57,plain,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause169]) ).
cnf(c_0_58,negated_conjecture,
( ssItem(X1)
| ~ ssList(cons(sk5,sk3)) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_59,negated_conjecture,
~ segmentP(sk2,sk1),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_60,plain,
( segmentP(X1,X2)
| app(X3,app(X2,X4)) != X1
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_61,plain,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
c_0_57 ).
cnf(c_0_62,negated_conjecture,
ssItem(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_41]),c_0_35]),c_0_45])]) ).
cnf(c_0_63,negated_conjecture,
( memberP(sk4,sk5)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_64,negated_conjecture,
~ segmentP(sk2,sk1),
c_0_59 ).
cnf(c_0_65,negated_conjecture,
( segmentP(X1,sk3)
| app(X2,cons(sk5,X3)) != X1
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_44]),c_0_45])]) ).
cnf(c_0_66,plain,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62])]) ).
cnf(c_0_67,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_68,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_69,negated_conjecture,
( memberP(sk4,sk5)
| ~ neq(sk4,nil) ),
c_0_63 ).
cnf(c_0_70,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_71,negated_conjecture,
~ segmentP(sk4,sk3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_37]),c_0_23]) ).
cnf(c_0_72,negated_conjecture,
( segmentP(X1,sk3)
| ~ memberP(X1,sk5)
| ~ ssList(X1) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]),c_0_68])])]) ).
cnf(c_0_73,negated_conjecture,
memberP(sk4,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_27])]) ).
cnf(c_0_74,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_70,c_0_23]) ).
cnf(c_0_75,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73]),c_0_74])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWC363-1 : TPTP v8.2.0. Released v2.4.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n005.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 03:38:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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/benchmark/theBenchmark.p
% 2.12/0.77 # Version: 3.1.0
% 2.12/0.77 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.12/0.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.12/0.77 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.12/0.77 # Starting new_bool_3 with 300s (1) cores
% 2.12/0.77 # Starting new_bool_1 with 300s (1) cores
% 2.12/0.77 # Starting sh5l with 300s (1) cores
% 2.12/0.77 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3991 completed with status 0
% 2.12/0.77 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.12/0.77 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.12/0.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.12/0.77 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.12/0.77 # No SInE strategy applied
% 2.12/0.77 # Search class: FGHSM-FSLM21-MFFFFFNN
% 2.12/0.77 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 2.12/0.77 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 2.12/0.77 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.12/0.77 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 2.12/0.77 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 2.12/0.77 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 2.12/0.77 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 4000 completed with status 0
% 2.12/0.77 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN
% 2.12/0.77 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.12/0.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.12/0.77 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.12/0.77 # No SInE strategy applied
% 2.12/0.77 # Search class: FGHSM-FSLM21-MFFFFFNN
% 2.12/0.77 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 2.12/0.77 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 2.12/0.77 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.12/0.77 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 2.12/0.77 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 2.12/0.77 # Preprocessing time : 0.005 s
% 2.12/0.77
% 2.12/0.77 # Proof found!
% 2.12/0.77 # SZS status Unsatisfiable
% 2.12/0.77 # SZS output start CNFRefutation
% See solution above
% 2.12/0.77 # Parsed axioms : 197
% 2.12/0.77 # Removed by relevancy pruning/SinE : 0
% 2.12/0.77 # Initial clauses : 197
% 2.12/0.77 # Removed in clause preprocessing : 0
% 2.12/0.77 # Initial clauses in saturation : 197
% 2.12/0.77 # Processed clauses : 1449
% 2.12/0.77 # ...of these trivial : 37
% 2.12/0.77 # ...subsumed : 501
% 2.12/0.77 # ...remaining for further processing : 911
% 2.12/0.77 # Other redundant clauses eliminated : 80
% 2.12/0.77 # Clauses deleted for lack of memory : 0
% 2.12/0.77 # Backward-subsumed : 127
% 2.12/0.77 # Backward-rewritten : 152
% 2.12/0.77 # Generated clauses : 11878
% 2.12/0.77 # ...of the previous two non-redundant : 11156
% 2.12/0.77 # ...aggressively subsumed : 0
% 2.12/0.77 # Contextual simplify-reflections : 48
% 2.12/0.77 # Paramodulations : 11500
% 2.12/0.77 # Factorizations : 184
% 2.12/0.77 # NegExts : 0
% 2.12/0.77 # Equation resolutions : 193
% 2.12/0.77 # Disequality decompositions : 0
% 2.12/0.77 # Total rewrite steps : 5837
% 2.12/0.77 # ...of those cached : 5495
% 2.12/0.77 # Propositional unsat checks : 0
% 2.12/0.77 # Propositional check models : 0
% 2.12/0.77 # Propositional check unsatisfiable : 0
% 2.12/0.77 # Propositional clauses : 0
% 2.12/0.77 # Propositional clauses after purity: 0
% 2.12/0.77 # Propositional unsat core size : 0
% 2.12/0.77 # Propositional preprocessing time : 0.000
% 2.12/0.77 # Propositional encoding time : 0.000
% 2.12/0.77 # Propositional solver time : 0.000
% 2.12/0.77 # Success case prop preproc time : 0.000
% 2.12/0.77 # Success case prop encoding time : 0.000
% 2.12/0.77 # Success case prop solver time : 0.000
% 2.12/0.77 # Current number of processed clauses : 626
% 2.12/0.77 # Positive orientable unit clauses : 78
% 2.12/0.77 # Positive unorientable unit clauses: 0
% 2.12/0.77 # Negative unit clauses : 16
% 2.12/0.77 # Non-unit-clauses : 532
% 2.12/0.77 # Current number of unprocessed clauses: 9395
% 2.12/0.77 # ...number of literals in the above : 42438
% 2.12/0.77 # Current number of archived formulas : 0
% 2.12/0.77 # Current number of archived clauses : 280
% 2.12/0.77 # Clause-clause subsumption calls (NU) : 68993
% 2.12/0.77 # Rec. Clause-clause subsumption calls : 17899
% 2.12/0.77 # Non-unit clause-clause subsumptions : 451
% 2.12/0.77 # Unit Clause-clause subsumption calls : 2800
% 2.12/0.77 # Rewrite failures with RHS unbound : 0
% 2.12/0.77 # BW rewrite match attempts : 42
% 2.12/0.77 # BW rewrite match successes : 33
% 2.12/0.77 # Condensation attempts : 0
% 2.12/0.77 # Condensation successes : 0
% 2.12/0.77 # Termbank termtop insertions : 201083
% 2.12/0.77 # Search garbage collected termcells : 537
% 2.12/0.77
% 2.12/0.77 # -------------------------------------------------
% 2.12/0.77 # User time : 0.249 s
% 2.12/0.77 # System time : 0.008 s
% 2.12/0.77 # Total time : 0.257 s
% 2.12/0.77 # Maximum resident set size: 2136 pages
% 2.12/0.77
% 2.12/0.77 # -------------------------------------------------
% 2.12/0.77 # User time : 1.205 s
% 2.12/0.77 # System time : 0.053 s
% 2.12/0.77 # Total time : 1.258 s
% 2.12/0.77 # Maximum resident set size: 1896 pages
% 2.12/0.77 % E---3.1 exiting
% 2.12/0.77 % E exiting
%------------------------------------------------------------------------------