TSTP Solution File: MGT061-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : MGT061-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 18:37:19 EDT 2023
% Result : Unsatisfiable 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 24
% Syntax : Number of clauses : 72 ( 31 unt; 12 nHn; 64 RR)
% Number of literals : 153 ( 22 equ; 74 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 79 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(assumption_13_47,axiom,
( is_aligned(X1,X2)
| ~ organization(X1)
| age(X1,X2) != zero ),
file('/export/starexec/sandbox/tmp/tmp.R2jHJe8mzk/E---3.1_31097.p',assumption_13_47) ).
cnf(theorem_7_69,negated_conjecture,
age(sk2,sk3) = zero,
file('/export/starexec/sandbox/tmp/tmp.R2jHJe8mzk/E---3.1_31097.p',theorem_7_69) ).
cnf(theorem_7_66,negated_conjecture,
organization(sk2),
file('/export/starexec/sandbox/tmp/tmp.R2jHJe8mzk/E---3.1_31097.p',theorem_7_66) ).
cnf(definition_smaller_8,axiom,
( smaller(X2,X1)
| ~ greater(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.R2jHJe8mzk/E---3.1_31097.p',definition_smaller_8) ).
cnf(theorem_7_70,negated_conjecture,
greater(sigma,zero),
file('/export/starexec/sandbox/tmp/tmp.R2jHJe8mzk/E---3.1_31097.p',theorem_7_70) ).
cnf(assumption_15_49,axiom,
( greater(age(X1,X3),sigma)
| ~ organization(X1)
| age(X1,X2) != zero
| ~ dissimilar(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.R2jHJe8mzk/E---3.1_31097.p',assumption_15_49) ).
cnf(definition_2_40,axiom,
( organization(X1)
| ~ dissimilar(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.R2jHJe8mzk/E---3.1_31097.p',definition_2_40) ).
cnf(definition_2_44,axiom,
( is_aligned(X1,X3)
| dissimilar(X1,X2,X3)
| ~ organization(X1)
| ~ is_aligned(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.R2jHJe8mzk/E---3.1_31097.p',definition_2_44) ).
cnf(definition_smaller_or_equal_2,axiom,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.R2jHJe8mzk/E---3.1_31097.p',definition_smaller_or_equal_2) ).
cnf(definition_3_50,axiom,
( positional_advantage(X1,X2)
| ~ fragile_position(X1)
| ~ smaller_or_equal(age(X1,X2),sigma) ),
file('/export/starexec/sandbox/tmp/tmp.R2jHJe8mzk/E---3.1_31097.p',definition_3_50) ).
cnf(theorem_7_67,negated_conjecture,
fragile_position(sk2),
file('/export/starexec/sandbox/tmp/tmp.R2jHJe8mzk/E---3.1_31097.p',theorem_7_67) ).
cnf(definition_3_51,axiom,
( ~ fragile_position(X1)
| ~ greater(age(X1,X2),sigma)
| ~ positional_advantage(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.R2jHJe8mzk/E---3.1_31097.p',definition_3_51) ).
cnf(theorem_7_71,negated_conjecture,
smaller_or_equal(age(sk2,sk4),sigma),
file('/export/starexec/sandbox/tmp/tmp.R2jHJe8mzk/E---3.1_31097.p',theorem_7_71) ).
cnf(assumption_17_57,axiom,
( has_immunity(X1,X2)
| hazard_of_mortality(X1,X2) = low
| ~ organization(X1)
| ~ is_aligned(X1,X2)
| ~ positional_advantage(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.R2jHJe8mzk/E---3.1_31097.p',assumption_17_57) ).
cnf(assumption_1_39,axiom,
( has_endowment(X1)
| ~ organization(X1)
| ~ has_immunity(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.R2jHJe8mzk/E---3.1_31097.p',assumption_1_39) ).
cnf(theorem_7_68,negated_conjecture,
~ has_endowment(sk2),
file('/export/starexec/sandbox/tmp/tmp.R2jHJe8mzk/E---3.1_31097.p',theorem_7_68) ).
cnf(assumption_15_48,axiom,
( dissimilar(X1,X2,X3)
| ~ organization(X1)
| age(X1,X2) != zero
| ~ greater(age(X1,X3),sigma) ),
file('/export/starexec/sandbox/tmp/tmp.R2jHJe8mzk/E---3.1_31097.p',assumption_15_48) ).
cnf(theorem_7_73,negated_conjecture,
( ~ greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk4))
| hazard_of_mortality(sk2,sk4) != hazard_of_mortality(sk2,sk3) ),
file('/export/starexec/sandbox/tmp/tmp.R2jHJe8mzk/E---3.1_31097.p',theorem_7_73) ).
cnf(assumption_17_60,axiom,
( has_immunity(X1,X2)
| is_aligned(X1,X2)
| positional_advantage(X1,X2)
| hazard_of_mortality(X1,X2) = high
| ~ organization(X1) ),
file('/export/starexec/sandbox/tmp/tmp.R2jHJe8mzk/E---3.1_31097.p',assumption_17_60) ).
cnf(meaning_postulate_greater_transitive_10,axiom,
( greater(X1,X3)
| ~ greater(X1,X2)
| ~ greater(X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.R2jHJe8mzk/E---3.1_31097.p',meaning_postulate_greater_transitive_10) ).
cnf(assumption_18e_65,axiom,
greater(mod2,low),
file('/export/starexec/sandbox/tmp/tmp.R2jHJe8mzk/E---3.1_31097.p',assumption_18e_65) ).
cnf(theorem_7_72,negated_conjecture,
greater(age(sk2,sk5),sigma),
file('/export/starexec/sandbox/tmp/tmp.R2jHJe8mzk/E---3.1_31097.p',theorem_7_72) ).
cnf(assumption_18d_64,axiom,
greater(high,mod2),
file('/export/starexec/sandbox/tmp/tmp.R2jHJe8mzk/E---3.1_31097.p',assumption_18d_64) ).
cnf(definition_2_42,axiom,
( ~ dissimilar(X1,X2,X3)
| ~ is_aligned(X1,X2)
| ~ is_aligned(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.R2jHJe8mzk/E---3.1_31097.p',definition_2_42) ).
cnf(c_0_24,axiom,
( is_aligned(X1,X2)
| ~ organization(X1)
| age(X1,X2) != zero ),
assumption_13_47 ).
cnf(c_0_25,negated_conjecture,
age(sk2,sk3) = zero,
theorem_7_69 ).
cnf(c_0_26,negated_conjecture,
organization(sk2),
theorem_7_66 ).
cnf(c_0_27,axiom,
( smaller(X2,X1)
| ~ greater(X1,X2) ),
definition_smaller_8 ).
cnf(c_0_28,negated_conjecture,
greater(sigma,zero),
theorem_7_70 ).
cnf(c_0_29,axiom,
( greater(age(X1,X3),sigma)
| ~ organization(X1)
| age(X1,X2) != zero
| ~ dissimilar(X1,X2,X3) ),
assumption_15_49 ).
cnf(c_0_30,axiom,
( organization(X1)
| ~ dissimilar(X1,X2,X3) ),
definition_2_40 ).
cnf(c_0_31,axiom,
( is_aligned(X1,X3)
| dissimilar(X1,X2,X3)
| ~ organization(X1)
| ~ is_aligned(X1,X2) ),
definition_2_44 ).
cnf(c_0_32,negated_conjecture,
is_aligned(sk2,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_33,axiom,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
definition_smaller_or_equal_2 ).
cnf(c_0_34,negated_conjecture,
smaller(zero,sigma),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
( greater(age(X1,X2),sigma)
| age(X1,X3) != zero
| ~ dissimilar(X1,X3,X2) ),
inference(csr,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
( is_aligned(sk2,X1)
| dissimilar(sk2,sk3,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_26])]) ).
cnf(c_0_37,axiom,
( positional_advantage(X1,X2)
| ~ fragile_position(X1)
| ~ smaller_or_equal(age(X1,X2),sigma) ),
definition_3_50 ).
cnf(c_0_38,negated_conjecture,
fragile_position(sk2),
theorem_7_67 ).
cnf(c_0_39,negated_conjecture,
smaller_or_equal(zero,sigma),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,axiom,
( ~ fragile_position(X1)
| ~ greater(age(X1,X2),sigma)
| ~ positional_advantage(X1,X2) ),
definition_3_51 ).
cnf(c_0_41,negated_conjecture,
( is_aligned(sk2,X1)
| greater(age(sk2,X1),sigma) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_25])]) ).
cnf(c_0_42,negated_conjecture,
smaller_or_equal(age(sk2,sk4),sigma),
theorem_7_71 ).
cnf(c_0_43,axiom,
( has_immunity(X1,X2)
| hazard_of_mortality(X1,X2) = low
| ~ organization(X1)
| ~ is_aligned(X1,X2)
| ~ positional_advantage(X1,X2) ),
assumption_17_57 ).
cnf(c_0_44,negated_conjecture,
positional_advantage(sk2,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_25]),c_0_38]),c_0_39])]) ).
cnf(c_0_45,negated_conjecture,
( is_aligned(sk2,X1)
| ~ positional_advantage(sk2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_38])]) ).
cnf(c_0_46,negated_conjecture,
positional_advantage(sk2,sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_42]),c_0_38])]) ).
cnf(c_0_47,axiom,
( has_endowment(X1)
| ~ organization(X1)
| ~ has_immunity(X1,X2) ),
assumption_1_39 ).
cnf(c_0_48,negated_conjecture,
( hazard_of_mortality(sk2,sk3) = low
| has_immunity(sk2,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_32]),c_0_44]),c_0_26])]) ).
cnf(c_0_49,negated_conjecture,
~ has_endowment(sk2),
theorem_7_68 ).
cnf(c_0_50,negated_conjecture,
is_aligned(sk2,sk4),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,axiom,
( dissimilar(X1,X2,X3)
| ~ organization(X1)
| age(X1,X2) != zero
| ~ greater(age(X1,X3),sigma) ),
assumption_15_48 ).
cnf(c_0_52,negated_conjecture,
( ~ greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk4))
| hazard_of_mortality(sk2,sk4) != hazard_of_mortality(sk2,sk3) ),
theorem_7_73 ).
cnf(c_0_53,negated_conjecture,
hazard_of_mortality(sk2,sk3) = low,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_26])]),c_0_49]) ).
cnf(c_0_54,negated_conjecture,
( hazard_of_mortality(sk2,sk4) = low
| has_immunity(sk2,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_50]),c_0_46]),c_0_26])]) ).
cnf(c_0_55,axiom,
( has_immunity(X1,X2)
| is_aligned(X1,X2)
| positional_advantage(X1,X2)
| hazard_of_mortality(X1,X2) = high
| ~ organization(X1) ),
assumption_17_60 ).
cnf(c_0_56,axiom,
( greater(X1,X3)
| ~ greater(X1,X2)
| ~ greater(X2,X3) ),
meaning_postulate_greater_transitive_10 ).
cnf(c_0_57,axiom,
greater(mod2,low),
assumption_18e_65 ).
cnf(c_0_58,negated_conjecture,
( dissimilar(sk2,sk3,X1)
| ~ greater(age(sk2,X1),sigma) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_25]),c_0_26])]) ).
cnf(c_0_59,negated_conjecture,
greater(age(sk2,sk5),sigma),
theorem_7_72 ).
cnf(c_0_60,negated_conjecture,
( hazard_of_mortality(sk2,sk4) != low
| ~ greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk4)) ),
inference(rw,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_61,negated_conjecture,
hazard_of_mortality(sk2,sk4) = low,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_54]),c_0_26])]),c_0_49]) ).
cnf(c_0_62,plain,
( hazard_of_mortality(X1,X2) = high
| positional_advantage(X1,X2)
| is_aligned(X1,X2)
| has_endowment(X1)
| ~ organization(X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_55]) ).
cnf(c_0_63,plain,
( greater(X1,low)
| ~ greater(X1,mod2) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_64,axiom,
greater(high,mod2),
assumption_18d_64 ).
cnf(c_0_65,axiom,
( ~ dissimilar(X1,X2,X3)
| ~ is_aligned(X1,X2)
| ~ is_aligned(X1,X3) ),
definition_2_42 ).
cnf(c_0_66,negated_conjecture,
dissimilar(sk2,sk3,sk5),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_67,negated_conjecture,
~ greater(hazard_of_mortality(sk2,sk5),low),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61]),c_0_61])]) ).
cnf(c_0_68,negated_conjecture,
( hazard_of_mortality(sk2,X1) = high
| is_aligned(sk2,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_62]),c_0_26])]),c_0_49]) ).
cnf(c_0_69,plain,
greater(high,low),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_70,negated_conjecture,
~ is_aligned(sk2,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_32])]) ).
cnf(c_0_71,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69])]),c_0_70]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : MGT061-1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n003.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 : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Oct 3 00:29:03 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.R2jHJe8mzk/E---3.1_31097.p
% 0.21/0.51 # Version: 3.1pre001
% 0.21/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # sh5l with pid 31218 completed with status 0
% 0.21/0.51 # Result found by sh5l
% 0.21/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.51 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.21/0.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 31227 completed with status 0
% 0.21/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.21/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.51 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.21/0.51 # Preprocessing time : 0.002 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Unsatisfiable
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 46
% 0.21/0.51 # Removed by relevancy pruning/SinE : 3
% 0.21/0.51 # Initial clauses : 43
% 0.21/0.51 # Removed in clause preprocessing : 3
% 0.21/0.51 # Initial clauses in saturation : 40
% 0.21/0.51 # Processed clauses : 194
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 14
% 0.21/0.51 # ...remaining for further processing : 180
% 0.21/0.51 # Other redundant clauses eliminated : 1
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 5
% 0.21/0.51 # Backward-rewritten : 8
% 0.21/0.51 # Generated clauses : 245
% 0.21/0.51 # ...of the previous two non-redundant : 179
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 1
% 0.21/0.51 # Paramodulations : 242
% 0.21/0.51 # Factorizations : 2
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 1
% 0.21/0.51 # Total rewrite steps : 116
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 126
% 0.21/0.51 # Positive orientable unit clauses : 48
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 16
% 0.21/0.51 # Non-unit-clauses : 62
% 0.21/0.51 # Current number of unprocessed clauses: 60
% 0.21/0.51 # ...number of literals in the above : 195
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 53
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 530
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 349
% 0.21/0.51 # Non-unit clause-clause subsumptions : 14
% 0.21/0.51 # Unit Clause-clause subsumption calls : 283
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 7
% 0.21/0.51 # BW rewrite match successes : 3
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 3541
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.011 s
% 0.21/0.51 # System time : 0.003 s
% 0.21/0.51 # Total time : 0.015 s
% 0.21/0.51 # Maximum resident set size: 1784 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.012 s
% 0.21/0.51 # System time : 0.006 s
% 0.21/0.51 # Total time : 0.018 s
% 0.21/0.51 # Maximum resident set size: 1708 pages
% 0.21/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------