TSTP Solution File: COL121-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : COL121-1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 May 20 19:03:24 EDT 2024
% Result : Unsatisfiable 30.41s 4.38s
% Output : CNFRefutation 30.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 34 ( 7 unt; 0 nHn; 34 RR)
% Number of literals : 81 ( 0 equ; 51 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-4 aty)
% Number of variables : 74 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Transitive__Closure_Ortrancl__trans_0,axiom,
( c_in(c_Pair(X5,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))
| ~ c_in(c_Pair(X1,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))
| ~ c_in(c_Pair(X5,X1,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Transitive__Closure_Ortrancl__trans_0) ).
cnf(cls_conjecture_5,negated_conjecture,
( c_in(c_Pair(X1,v_x(X1),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_y,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5) ).
cnf(cls_Transitive__Closure_Or__into__rtrancl_0,axiom,
( c_in(X1,c_Transitive__Closure_Ortrancl(X2,X3),tc_prod(X3,X3))
| ~ c_in(X1,X2,tc_prod(X3,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Transitive__Closure_Or__into__rtrancl_0) ).
cnf(cls_Comb_Odiamond__strip__lemmaE_1,axiom,
( c_in(c_Pair(X5,c_Comb_Odiamond__strip__lemmaE__1(X1,X5,X4,X2),X2,X2),X1,tc_prod(X2,X2))
| ~ c_Comb_Odiamond(X1,X2)
| ~ c_in(c_Pair(X3,X4,X2,X2),X1,tc_prod(X2,X2))
| ~ c_in(c_Pair(X3,X5,X2,X2),c_Transitive__Closure_Ortrancl(X1,X2),tc_prod(X2,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Comb_Odiamond__strip__lemmaE_1) ).
cnf(cls_conjecture_4,negated_conjecture,
( c_in(c_Pair(v_ya,v_x(X1),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_y,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_conjecture_0,negated_conjecture,
c_Comb_Odiamond(v_r,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_conjecture_6,negated_conjecture,
( ~ c_in(c_Pair(v_xaa,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_z,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_6) ).
cnf(cls_Comb_Odiamond__strip__lemmaE_0,axiom,
( c_in(c_Pair(X4,c_Comb_Odiamond__strip__lemmaE__1(X1,X5,X4,X2),X2,X2),c_Transitive__Closure_Ortrancl(X1,X2),tc_prod(X2,X2))
| ~ c_Comb_Odiamond(X1,X2)
| ~ c_in(c_Pair(X3,X4,X2,X2),X1,tc_prod(X2,X2))
| ~ c_in(c_Pair(X3,X5,X2,X2),c_Transitive__Closure_Ortrancl(X1,X2),tc_prod(X2,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Comb_Odiamond__strip__lemmaE_0) ).
cnf(cls_conjecture_3,negated_conjecture,
c_in(c_Pair(v_y,v_xaa,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_2,negated_conjecture,
c_in(c_Pair(v_ya,v_z,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(c_0_10,plain,
( c_in(c_Pair(X5,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))
| ~ c_in(c_Pair(X1,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))
| ~ c_in(c_Pair(X5,X1,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3)) ),
inference(fof_simplification,[status(thm)],[cls_Transitive__Closure_Ortrancl__trans_0]) ).
cnf(c_0_11,negated_conjecture,
( c_in(c_Pair(X1,v_x(X1),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_y,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_5]) ).
cnf(c_0_12,plain,
( c_in(c_Pair(X5,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))
| ~ c_in(c_Pair(X1,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))
| ~ c_in(c_Pair(X5,X1,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3)) ),
c_0_10 ).
cnf(c_0_13,negated_conjecture,
( c_in(c_Pair(X1,v_x(X1),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_y,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
c_0_11 ).
cnf(c_0_14,plain,
( c_in(X1,c_Transitive__Closure_Ortrancl(X2,X3),tc_prod(X3,X3))
| ~ c_in(X1,X2,tc_prod(X3,X3)) ),
inference(fof_simplification,[status(thm)],[cls_Transitive__Closure_Or__into__rtrancl_0]) ).
cnf(c_0_15,plain,
( c_in(c_Pair(X5,c_Comb_Odiamond__strip__lemmaE__1(X1,X5,X4,X2),X2,X2),X1,tc_prod(X2,X2))
| ~ c_Comb_Odiamond(X1,X2)
| ~ c_in(c_Pair(X3,X4,X2,X2),X1,tc_prod(X2,X2))
| ~ c_in(c_Pair(X3,X5,X2,X2),c_Transitive__Closure_Ortrancl(X1,X2),tc_prod(X2,X2)) ),
inference(fof_simplification,[status(thm)],[cls_Comb_Odiamond__strip__lemmaE_1]) ).
cnf(c_0_16,negated_conjecture,
( c_in(c_Pair(v_ya,v_x(X1),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_y,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).
cnf(c_0_17,negated_conjecture,
( c_in(c_Pair(X1,X2,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_x(X1),X2,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_y,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( c_in(X1,c_Transitive__Closure_Ortrancl(X2,X3),tc_prod(X3,X3))
| ~ c_in(X1,X2,tc_prod(X3,X3)) ),
c_0_14 ).
cnf(c_0_19,plain,
( c_in(c_Pair(X5,c_Comb_Odiamond__strip__lemmaE__1(X1,X5,X4,X2),X2,X2),X1,tc_prod(X2,X2))
| ~ c_Comb_Odiamond(X1,X2)
| ~ c_in(c_Pair(X3,X4,X2,X2),X1,tc_prod(X2,X2))
| ~ c_in(c_Pair(X3,X5,X2,X2),c_Transitive__Closure_Ortrancl(X1,X2),tc_prod(X2,X2)) ),
c_0_15 ).
cnf(c_0_20,negated_conjecture,
( c_in(c_Pair(v_ya,v_x(X1),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_y,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
c_0_16 ).
cnf(c_0_21,negated_conjecture,
c_Comb_Odiamond(v_r,t_a),
cls_conjecture_0 ).
cnf(c_0_22,negated_conjecture,
( ~ c_in(c_Pair(v_xaa,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_z,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_6]) ).
cnf(c_0_23,negated_conjecture,
( c_in(c_Pair(X1,X2,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_y,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_x(X1),X2,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( c_in(c_Pair(v_x(X1),c_Comb_Odiamond__strip__lemmaE__1(v_r,v_x(X1),X2,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_y,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_ya,X2,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_25,plain,
( c_in(c_Pair(X4,c_Comb_Odiamond__strip__lemmaE__1(X1,X5,X4,X2),X2,X2),c_Transitive__Closure_Ortrancl(X1,X2),tc_prod(X2,X2))
| ~ c_Comb_Odiamond(X1,X2)
| ~ c_in(c_Pair(X3,X4,X2,X2),X1,tc_prod(X2,X2))
| ~ c_in(c_Pair(X3,X5,X2,X2),c_Transitive__Closure_Ortrancl(X1,X2),tc_prod(X2,X2)) ),
inference(fof_simplification,[status(thm)],[cls_Comb_Odiamond__strip__lemmaE_0]) ).
cnf(c_0_26,negated_conjecture,
( ~ c_in(c_Pair(v_xaa,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_z,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
c_0_22 ).
cnf(c_0_27,negated_conjecture,
( c_in(c_Pair(X1,c_Comb_Odiamond__strip__lemmaE__1(v_r,v_x(X1),X2,t_a),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_y,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_ya,X2,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
c_in(c_Pair(v_y,v_xaa,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)),
cls_conjecture_3 ).
cnf(c_0_29,plain,
( c_in(c_Pair(X4,c_Comb_Odiamond__strip__lemmaE__1(X1,X5,X4,X2),X2,X2),c_Transitive__Closure_Ortrancl(X1,X2),tc_prod(X2,X2))
| ~ c_Comb_Odiamond(X1,X2)
| ~ c_in(c_Pair(X3,X4,X2,X2),X1,tc_prod(X2,X2))
| ~ c_in(c_Pair(X3,X5,X2,X2),c_Transitive__Closure_Ortrancl(X1,X2),tc_prod(X2,X2)) ),
c_0_25 ).
cnf(c_0_30,negated_conjecture,
( ~ c_in(c_Pair(v_z,c_Comb_Odiamond__strip__lemmaE__1(v_r,v_x(v_xaa),X1,t_a),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_ya,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_31,negated_conjecture,
( c_in(c_Pair(X1,c_Comb_Odiamond__strip__lemmaE__1(v_r,v_x(X2),X1,t_a),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_y,X2,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_ya,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_20]),c_0_21])]) ).
cnf(c_0_32,negated_conjecture,
c_in(c_Pair(v_ya,v_z,t_a,t_a),v_r,tc_prod(t_a,t_a)),
cls_conjecture_2 ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13 % Problem : COL121-1 : TPTP v8.2.0. Released v3.2.0.
% 0.09/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n018.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sat May 18 13:24:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.49 Running first-order model finding
% 0.22/0.49 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/benchmark/theBenchmark.p
% 30.41/4.38 # Version: 3.1.0
% 30.41/4.38 # Preprocessing class: FMLMSMSMSSSNFFN.
% 30.41/4.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 30.41/4.38 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 30.41/4.38 # Starting new_bool_3 with 300s (1) cores
% 30.41/4.38 # Starting new_bool_1 with 300s (1) cores
% 30.41/4.38 # Starting sh5l with 300s (1) cores
% 30.41/4.38 # new_bool_3 with pid 28201 completed with status 0
% 30.41/4.38 # Result found by new_bool_3
% 30.41/4.38 # Preprocessing class: FMLMSMSMSSSNFFN.
% 30.41/4.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 30.41/4.38 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 30.41/4.38 # Starting new_bool_3 with 300s (1) cores
% 30.41/4.38 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 30.41/4.38 # Search class: FHHSF-FFMS32-SFFFFFNN
% 30.41/4.38 # partial match(1): FGHSF-FFMS32-SFFFFFNN
% 30.41/4.38 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 30.41/4.38 # Starting G-E--_301_C18_F1_URBAN_S0Y with 181s (1) cores
% 30.41/4.38 # G-E--_301_C18_F1_URBAN_S0Y with pid 28204 completed with status 0
% 30.41/4.38 # Result found by G-E--_301_C18_F1_URBAN_S0Y
% 30.41/4.38 # Preprocessing class: FMLMSMSMSSSNFFN.
% 30.41/4.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 30.41/4.38 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 30.41/4.38 # Starting new_bool_3 with 300s (1) cores
% 30.41/4.38 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 30.41/4.38 # Search class: FHHSF-FFMS32-SFFFFFNN
% 30.41/4.38 # partial match(1): FGHSF-FFMS32-SFFFFFNN
% 30.41/4.38 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 30.41/4.38 # Starting G-E--_301_C18_F1_URBAN_S0Y with 181s (1) cores
% 30.41/4.38 # Preprocessing time : 0.047 s
% 30.41/4.38
% 30.41/4.38 # Proof found!
% 30.41/4.38 # SZS status Unsatisfiable
% 30.41/4.38 # SZS output start CNFRefutation
% See solution above
% 30.41/4.38 # Parsed axioms : 1375
% 30.41/4.38 # Removed by relevancy pruning/SinE : 1361
% 30.41/4.38 # Initial clauses : 14
% 30.41/4.38 # Removed in clause preprocessing : 0
% 30.41/4.38 # Initial clauses in saturation : 14
% 30.41/4.38 # Processed clauses : 6233
% 30.41/4.38 # ...of these trivial : 43
% 30.41/4.38 # ...subsumed : 3805
% 30.41/4.38 # ...remaining for further processing : 2385
% 30.41/4.38 # Other redundant clauses eliminated : 0
% 30.41/4.38 # Clauses deleted for lack of memory : 0
% 30.41/4.38 # Backward-subsumed : 125
% 30.41/4.38 # Backward-rewritten : 0
% 30.41/4.38 # Generated clauses : 104030
% 30.41/4.38 # ...of the previous two non-redundant : 101106
% 30.41/4.38 # ...aggressively subsumed : 0
% 30.41/4.38 # Contextual simplify-reflections : 69
% 30.41/4.38 # Paramodulations : 104028
% 30.41/4.38 # Factorizations : 0
% 30.41/4.38 # NegExts : 0
% 30.41/4.38 # Equation resolutions : 2
% 30.41/4.38 # Disequality decompositions : 0
% 30.41/4.38 # Total rewrite steps : 14611
% 30.41/4.38 # ...of those cached : 14557
% 30.41/4.38 # Propositional unsat checks : 0
% 30.41/4.38 # Propositional check models : 0
% 30.41/4.38 # Propositional check unsatisfiable : 0
% 30.41/4.38 # Propositional clauses : 0
% 30.41/4.38 # Propositional clauses after purity: 0
% 30.41/4.38 # Propositional unsat core size : 0
% 30.41/4.38 # Propositional preprocessing time : 0.000
% 30.41/4.38 # Propositional encoding time : 0.000
% 30.41/4.38 # Propositional solver time : 0.000
% 30.41/4.38 # Success case prop preproc time : 0.000
% 30.41/4.38 # Success case prop encoding time : 0.000
% 30.41/4.38 # Success case prop solver time : 0.000
% 30.41/4.38 # Current number of processed clauses : 2260
% 30.41/4.38 # Positive orientable unit clauses : 49
% 30.41/4.38 # Positive unorientable unit clauses: 0
% 30.41/4.38 # Negative unit clauses : 17
% 30.41/4.38 # Non-unit-clauses : 2194
% 30.41/4.38 # Current number of unprocessed clauses: 94687
% 30.41/4.38 # ...number of literals in the above : 400505
% 30.41/4.38 # Current number of archived formulas : 0
% 30.41/4.38 # Current number of archived clauses : 125
% 30.41/4.38 # Clause-clause subsumption calls (NU) : 1634385
% 30.41/4.38 # Rec. Clause-clause subsumption calls : 870953
% 30.41/4.38 # Non-unit clause-clause subsumptions : 1555
% 30.41/4.38 # Unit Clause-clause subsumption calls : 13119
% 30.41/4.38 # Rewrite failures with RHS unbound : 0
% 30.41/4.38 # BW rewrite match attempts : 564
% 30.41/4.38 # BW rewrite match successes : 2
% 30.41/4.38 # Condensation attempts : 0
% 30.41/4.38 # Condensation successes : 0
% 30.41/4.38 # Termbank termtop insertions : 4445557
% 30.41/4.38 # Search garbage collected termcells : 2713
% 30.41/4.38
% 30.41/4.38 # -------------------------------------------------
% 30.41/4.38 # User time : 3.674 s
% 30.41/4.38 # System time : 0.093 s
% 30.41/4.38 # Total time : 3.767 s
% 30.41/4.38 # Maximum resident set size: 2876 pages
% 30.41/4.38
% 30.41/4.38 # -------------------------------------------------
% 30.41/4.38 # User time : 3.697 s
% 30.41/4.38 # System time : 0.094 s
% 30.41/4.38 # Total time : 3.791 s
% 30.41/4.38 # Maximum resident set size: 2416 pages
% 30.41/4.38 % E---3.1 exiting
%------------------------------------------------------------------------------