TSTP Solution File: ANA002-4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : ANA002-4 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 17:15:57 EDT 2023
% Result : Unsatisfiable 119.03s 15.48s
% Output : CNFRefutation 119.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 17
% Syntax : Number of clauses : 65 ( 15 unt; 33 nHn; 41 RR)
% Number of literals : 170 ( 0 equ; 59 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 78 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(continuity2,axiom,
( less_than_or_equal(f(X1),n0)
| less_than_or_equal(X2,h(X1))
| ~ less_than_or_equal(X2,X1)
| ~ less_than_or_equal(f(X2),n0)
| ~ less_than_or_equal(lower_bound,X1)
| ~ less_than_or_equal(X1,upper_bound) ),
file('/export/starexec/sandbox2/tmp/tmp.TLrtvmd7B5/E---3.1_2815.p',continuity2) ).
cnf(crossover3_and_g_function2,axiom,
( less_than_or_equal(f(g(X1)),n0)
| less_than_or_equal(l,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.TLrtvmd7B5/E---3.1_2815.p',crossover3_and_g_function2) ).
cnf(crossover1,axiom,
( less_than_or_equal(X1,l)
| ~ less_than_or_equal(X1,upper_bound)
| ~ less_than_or_equal(f(X1),n0) ),
file('/export/starexec/sandbox2/tmp/tmp.TLrtvmd7B5/E---3.1_2815.p',crossover1) ).
cnf(crossover2_and_g_function1,axiom,
( less_than_or_equal(g(X1),upper_bound)
| less_than_or_equal(l,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.TLrtvmd7B5/E---3.1_2815.p',crossover2_and_g_function1) ).
cnf(crossover4_and_g_function3,axiom,
( less_than_or_equal(l,X1)
| ~ less_than_or_equal(g(X1),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.TLrtvmd7B5/E---3.1_2815.p',crossover4_and_g_function3) ).
cnf(lower_mapping,hypothesis,
less_than_or_equal(f(lower_bound),n0),
file('/export/starexec/sandbox2/tmp/tmp.TLrtvmd7B5/E---3.1_2815.p',lower_mapping) ).
cnf(the_interval,hypothesis,
less_than_or_equal(lower_bound,upper_bound),
file('/export/starexec/sandbox2/tmp/tmp.TLrtvmd7B5/E---3.1_2815.p',the_interval) ).
cnf(totality_of_less,axiom,
( less_than_or_equal(X1,X2)
| less_than_or_equal(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.TLrtvmd7B5/E---3.1_2815.p',totality_of_less) ).
cnf(transitivity_of_less,axiom,
( less_than_or_equal(X1,X2)
| ~ less_than_or_equal(X1,X3)
| ~ less_than_or_equal(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.TLrtvmd7B5/E---3.1_2815.p',transitivity_of_less) ).
cnf(continuity1,axiom,
( less_than_or_equal(f(X1),n0)
| ~ less_than_or_equal(X1,h(X1))
| ~ less_than_or_equal(lower_bound,X1)
| ~ less_than_or_equal(X1,upper_bound) ),
file('/export/starexec/sandbox2/tmp/tmp.TLrtvmd7B5/E---3.1_2815.p',continuity1) ).
cnf(continuity4,axiom,
( less_than_or_equal(n0,f(X1))
| less_than_or_equal(k(X1),X2)
| ~ less_than_or_equal(X1,X2)
| ~ less_than_or_equal(n0,f(X2))
| ~ less_than_or_equal(lower_bound,X1)
| ~ less_than_or_equal(X1,upper_bound) ),
file('/export/starexec/sandbox2/tmp/tmp.TLrtvmd7B5/E---3.1_2815.p',continuity4) ).
cnf(prove_there_is_x_which_crosses,negated_conjecture,
( ~ less_than_or_equal(f(l),n0)
| ~ less_than_or_equal(n0,f(l)) ),
file('/export/starexec/sandbox2/tmp/tmp.TLrtvmd7B5/E---3.1_2815.p',prove_there_is_x_which_crosses) ).
cnf(reflexivity_of_less,axiom,
less_than_or_equal(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.TLrtvmd7B5/E---3.1_2815.p',reflexivity_of_less) ).
cnf(interpolation1,axiom,
( less_than_or_equal(X1,X2)
| ~ less_than_or_equal(X1,q(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.TLrtvmd7B5/E---3.1_2815.p',interpolation1) ).
cnf(upper_mapping,hypothesis,
less_than_or_equal(n0,f(upper_bound)),
file('/export/starexec/sandbox2/tmp/tmp.TLrtvmd7B5/E---3.1_2815.p',upper_mapping) ).
cnf(interpolation2,axiom,
( less_than_or_equal(X2,X1)
| ~ less_than_or_equal(q(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.TLrtvmd7B5/E---3.1_2815.p',interpolation2) ).
cnf(continuity3,axiom,
( less_than_or_equal(n0,f(X1))
| ~ less_than_or_equal(k(X1),X1)
| ~ less_than_or_equal(lower_bound,X1)
| ~ less_than_or_equal(X1,upper_bound) ),
file('/export/starexec/sandbox2/tmp/tmp.TLrtvmd7B5/E---3.1_2815.p',continuity3) ).
cnf(c_0_17,axiom,
( less_than_or_equal(f(X1),n0)
| less_than_or_equal(X2,h(X1))
| ~ less_than_or_equal(X2,X1)
| ~ less_than_or_equal(f(X2),n0)
| ~ less_than_or_equal(lower_bound,X1)
| ~ less_than_or_equal(X1,upper_bound) ),
continuity2 ).
cnf(c_0_18,axiom,
( less_than_or_equal(f(g(X1)),n0)
| less_than_or_equal(l,X1) ),
crossover3_and_g_function2 ).
cnf(c_0_19,axiom,
( less_than_or_equal(X1,l)
| ~ less_than_or_equal(X1,upper_bound)
| ~ less_than_or_equal(f(X1),n0) ),
crossover1 ).
cnf(c_0_20,axiom,
( less_than_or_equal(g(X1),upper_bound)
| less_than_or_equal(l,X1) ),
crossover2_and_g_function1 ).
cnf(c_0_21,axiom,
( less_than_or_equal(l,X1)
| ~ less_than_or_equal(g(X1),X1) ),
crossover4_and_g_function3 ).
cnf(c_0_22,hypothesis,
less_than_or_equal(f(lower_bound),n0),
lower_mapping ).
cnf(c_0_23,hypothesis,
less_than_or_equal(lower_bound,upper_bound),
the_interval ).
cnf(c_0_24,plain,
( less_than_or_equal(g(X1),h(X2))
| less_than_or_equal(f(X2),n0)
| less_than_or_equal(l,X1)
| ~ less_than_or_equal(g(X1),X2)
| ~ less_than_or_equal(X2,upper_bound)
| ~ less_than_or_equal(lower_bound,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
( less_than_or_equal(g(X1),l)
| less_than_or_equal(l,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_18]),c_0_20]) ).
cnf(c_0_26,plain,
less_than_or_equal(l,upper_bound),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_27,hypothesis,
less_than_or_equal(lower_bound,l),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_22]),c_0_23])]) ).
cnf(c_0_28,axiom,
( less_than_or_equal(X1,X2)
| less_than_or_equal(X2,X1) ),
totality_of_less ).
cnf(c_0_29,plain,
( less_than_or_equal(g(X1),h(l))
| less_than_or_equal(f(l),n0)
| less_than_or_equal(l,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_30,plain,
( less_than_or_equal(n0,f(X1))
| less_than_or_equal(X1,l)
| ~ less_than_or_equal(X1,upper_bound) ),
inference(spm,[status(thm)],[c_0_19,c_0_28]) ).
cnf(c_0_31,axiom,
( less_than_or_equal(X1,X2)
| ~ less_than_or_equal(X1,X3)
| ~ less_than_or_equal(X3,X2) ),
transitivity_of_less ).
cnf(c_0_32,axiom,
( less_than_or_equal(f(X1),n0)
| ~ less_than_or_equal(X1,h(X1))
| ~ less_than_or_equal(lower_bound,X1)
| ~ less_than_or_equal(X1,upper_bound) ),
continuity1 ).
cnf(c_0_33,plain,
( less_than_or_equal(f(l),n0)
| less_than_or_equal(l,h(l)) ),
inference(spm,[status(thm)],[c_0_21,c_0_29]) ).
cnf(c_0_34,axiom,
( less_than_or_equal(n0,f(X1))
| less_than_or_equal(k(X1),X2)
| ~ less_than_or_equal(X1,X2)
| ~ less_than_or_equal(n0,f(X2))
| ~ less_than_or_equal(lower_bound,X1)
| ~ less_than_or_equal(X1,upper_bound) ),
continuity4 ).
cnf(c_0_35,plain,
( less_than_or_equal(n0,f(X1))
| less_than_or_equal(upper_bound,X1)
| less_than_or_equal(X1,l) ),
inference(spm,[status(thm)],[c_0_30,c_0_28]) ).
cnf(c_0_36,plain,
( less_than_or_equal(X1,X2)
| less_than_or_equal(X3,X1)
| ~ less_than_or_equal(X3,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_28]) ).
cnf(c_0_37,negated_conjecture,
( ~ less_than_or_equal(f(l),n0)
| ~ less_than_or_equal(n0,f(l)) ),
prove_there_is_x_which_crosses ).
cnf(c_0_38,plain,
less_than_or_equal(f(l),n0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_26]),c_0_27])]) ).
cnf(c_0_39,plain,
( less_than_or_equal(n0,f(X1))
| less_than_or_equal(k(X1),X2)
| less_than_or_equal(X2,l)
| less_than_or_equal(upper_bound,X2)
| ~ less_than_or_equal(lower_bound,X1)
| ~ less_than_or_equal(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_40,hypothesis,
( less_than_or_equal(X1,l)
| ~ less_than_or_equal(X1,lower_bound) ),
inference(spm,[status(thm)],[c_0_31,c_0_27]) ).
cnf(c_0_41,axiom,
less_than_or_equal(X1,X1),
reflexivity_of_less ).
cnf(c_0_42,negated_conjecture,
~ less_than_or_equal(n0,f(l)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]) ).
cnf(c_0_43,hypothesis,
( less_than_or_equal(k(l),X1)
| less_than_or_equal(upper_bound,X1)
| less_than_or_equal(X1,l) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]),c_0_42]),c_0_28]) ).
cnf(c_0_44,axiom,
( less_than_or_equal(X1,X2)
| ~ less_than_or_equal(X1,q(X2,X1)) ),
interpolation1 ).
cnf(c_0_45,plain,
( less_than_or_equal(X1,X2)
| less_than_or_equal(X2,X3)
| less_than_or_equal(X3,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_28]) ).
cnf(c_0_46,hypothesis,
( less_than_or_equal(k(l),X1)
| less_than_or_equal(X2,l)
| less_than_or_equal(upper_bound,X2)
| less_than_or_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_43]) ).
cnf(c_0_47,hypothesis,
less_than_or_equal(n0,f(upper_bound)),
upper_mapping ).
cnf(c_0_48,plain,
( less_than_or_equal(q(X1,X2),X3)
| less_than_or_equal(X3,X2)
| less_than_or_equal(X2,X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,axiom,
( less_than_or_equal(X2,X1)
| ~ less_than_or_equal(q(X1,X2),X1) ),
interpolation2 ).
cnf(c_0_50,hypothesis,
( less_than_or_equal(upper_bound,q(X1,X2))
| less_than_or_equal(q(X1,X2),l)
| less_than_or_equal(k(l),X2)
| less_than_or_equal(X2,X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_46]) ).
cnf(c_0_51,hypothesis,
( less_than_or_equal(k(X1),upper_bound)
| less_than_or_equal(n0,f(X1))
| ~ less_than_or_equal(X1,upper_bound)
| ~ less_than_or_equal(lower_bound,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_47]) ).
cnf(c_0_52,plain,
( less_than_or_equal(q(X1,q(X2,X3)),X3)
| less_than_or_equal(q(X2,X3),X1)
| less_than_or_equal(X3,X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_48]) ).
cnf(c_0_53,hypothesis,
( less_than_or_equal(upper_bound,q(l,X1))
| less_than_or_equal(k(l),X1)
| less_than_or_equal(X1,l) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,hypothesis,
( less_than_or_equal(n0,f(l))
| less_than_or_equal(k(l),upper_bound) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_26]),c_0_27])]) ).
cnf(c_0_55,plain,
( less_than_or_equal(q(X1,X2),X2)
| less_than_or_equal(X2,X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_52]) ).
cnf(c_0_56,hypothesis,
( less_than_or_equal(X1,q(l,X2))
| less_than_or_equal(k(l),X2)
| less_than_or_equal(X2,l)
| ~ less_than_or_equal(X1,upper_bound) ),
inference(spm,[status(thm)],[c_0_31,c_0_53]) ).
cnf(c_0_57,hypothesis,
less_than_or_equal(k(l),upper_bound),
inference(sr,[status(thm)],[c_0_54,c_0_42]) ).
cnf(c_0_58,plain,
( less_than_or_equal(X1,X2)
| less_than_or_equal(X3,X1)
| ~ less_than_or_equal(X3,q(X2,X1)) ),
inference(spm,[status(thm)],[c_0_31,c_0_55]) ).
cnf(c_0_59,hypothesis,
( less_than_or_equal(k(l),q(l,X1))
| less_than_or_equal(k(l),X1)
| less_than_or_equal(X1,l) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,hypothesis,
( less_than_or_equal(k(l),X1)
| less_than_or_equal(X1,l) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_61,hypothesis,
( less_than_or_equal(q(X1,k(l)),l)
| less_than_or_equal(k(l),X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_60]) ).
cnf(c_0_62,axiom,
( less_than_or_equal(n0,f(X1))
| ~ less_than_or_equal(k(X1),X1)
| ~ less_than_or_equal(lower_bound,X1)
| ~ less_than_or_equal(X1,upper_bound) ),
continuity3 ).
cnf(c_0_63,hypothesis,
less_than_or_equal(k(l),l),
inference(spm,[status(thm)],[c_0_49,c_0_61]) ).
cnf(c_0_64,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_26]),c_0_27])]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : ANA002-4 : TPTP v8.1.2. Released v1.1.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n016.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 15:40:06 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.TLrtvmd7B5/E---3.1_2815.p
% 119.03/15.48 # Version: 3.1pre001
% 119.03/15.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 119.03/15.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 119.03/15.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 119.03/15.48 # Starting new_bool_3 with 300s (1) cores
% 119.03/15.48 # Starting new_bool_1 with 300s (1) cores
% 119.03/15.48 # Starting sh5l with 300s (1) cores
% 119.03/15.48 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2893 completed with status 0
% 119.03/15.48 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 119.03/15.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 119.03/15.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 119.03/15.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 119.03/15.48 # No SInE strategy applied
% 119.03/15.48 # Search class: FGHNF-FFSS21-SFFFFFNN
% 119.03/15.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 119.03/15.48 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 119.03/15.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 119.03/15.48 # Starting new_bool_3 with 136s (1) cores
% 119.03/15.48 # Starting new_bool_1 with 136s (1) cores
% 119.03/15.48 # Starting sh5l with 136s (1) cores
% 119.03/15.48 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 2897 completed with status 0
% 119.03/15.48 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 119.03/15.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 119.03/15.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 119.03/15.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 119.03/15.48 # No SInE strategy applied
% 119.03/15.48 # Search class: FGHNF-FFSS21-SFFFFFNN
% 119.03/15.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 119.03/15.48 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 119.03/15.48 # Preprocessing time : 0.001 s
% 119.03/15.48 # Presaturation interreduction done
% 119.03/15.48
% 119.03/15.48 # Proof found!
% 119.03/15.48 # SZS status Unsatisfiable
% 119.03/15.48 # SZS output start CNFRefutation
% See solution above
% 119.03/15.48 # Parsed axioms : 17
% 119.03/15.48 # Removed by relevancy pruning/SinE : 0
% 119.03/15.48 # Initial clauses : 17
% 119.03/15.48 # Removed in clause preprocessing : 0
% 119.03/15.48 # Initial clauses in saturation : 17
% 119.03/15.48 # Processed clauses : 18679
% 119.03/15.48 # ...of these trivial : 55
% 119.03/15.48 # ...subsumed : 15845
% 119.03/15.48 # ...remaining for further processing : 2779
% 119.03/15.48 # Other redundant clauses eliminated : 0
% 119.03/15.48 # Clauses deleted for lack of memory : 0
% 119.03/15.48 # Backward-subsumed : 230
% 119.03/15.48 # Backward-rewritten : 142
% 119.03/15.48 # Generated clauses : 960296
% 119.03/15.48 # ...of the previous two non-redundant : 748392
% 119.03/15.48 # ...aggressively subsumed : 0
% 119.03/15.48 # Contextual simplify-reflections : 68
% 119.03/15.48 # Paramodulations : 959558
% 119.03/15.48 # Factorizations : 714
% 119.03/15.48 # NegExts : 0
% 119.03/15.48 # Equation resolutions : 0
% 119.03/15.48 # Total rewrite steps : 224449
% 119.03/15.48 # Propositional unsat checks : 0
% 119.03/15.48 # Propositional check models : 0
% 119.03/15.48 # Propositional check unsatisfiable : 0
% 119.03/15.48 # Propositional clauses : 0
% 119.03/15.48 # Propositional clauses after purity: 0
% 119.03/15.48 # Propositional unsat core size : 0
% 119.03/15.48 # Propositional preprocessing time : 0.000
% 119.03/15.48 # Propositional encoding time : 0.000
% 119.03/15.48 # Propositional solver time : 0.000
% 119.03/15.48 # Success case prop preproc time : 0.000
% 119.03/15.48 # Success case prop encoding time : 0.000
% 119.03/15.48 # Success case prop solver time : 0.000
% 119.03/15.48 # Current number of processed clauses : 2366
% 119.03/15.48 # Positive orientable unit clauses : 13
% 119.03/15.48 # Positive unorientable unit clauses: 0
% 119.03/15.48 # Negative unit clauses : 1
% 119.03/15.48 # Non-unit-clauses : 2352
% 119.03/15.48 # Current number of unprocessed clauses: 728372
% 119.03/15.48 # ...number of literals in the above : 4668414
% 119.03/15.48 # Current number of archived formulas : 0
% 119.03/15.48 # Current number of archived clauses : 413
% 119.03/15.48 # Clause-clause subsumption calls (NU) : 1698808
% 119.03/15.48 # Rec. Clause-clause subsumption calls : 308697
% 119.03/15.48 # Non-unit clause-clause subsumptions : 16139
% 119.03/15.48 # Unit Clause-clause subsumption calls : 1273
% 119.03/15.48 # Rewrite failures with RHS unbound : 0
% 119.03/15.48 # BW rewrite match attempts : 8
% 119.03/15.48 # BW rewrite match successes : 2
% 119.03/15.48 # Condensation attempts : 0
% 119.03/15.48 # Condensation successes : 0
% 119.03/15.48 # Termbank termtop insertions : 18103614
% 119.03/15.48
% 119.03/15.48 # -------------------------------------------------
% 119.03/15.48 # User time : 14.433 s
% 119.03/15.48 # System time : 0.425 s
% 119.03/15.48 # Total time : 14.858 s
% 119.03/15.48 # Maximum resident set size: 1612 pages
% 119.03/15.48
% 119.03/15.48 # -------------------------------------------------
% 119.03/15.48 # User time : 73.557 s
% 119.03/15.48 # System time : 0.845 s
% 119.03/15.48 # Total time : 74.403 s
% 119.03/15.48 # Maximum resident set size: 1688 pages
% 119.03/15.48 % E---3.1 exiting
% 119.03/15.48 % E---3.1 exiting
%------------------------------------------------------------------------------