TSTP Solution File: MGT065-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : MGT065-1 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 00:39:50 EDT 2024
% Result : Unsatisfiable 0.23s 0.52s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 23
% Syntax : Number of clauses : 81 ( 38 unt; 8 nHn; 77 RR)
% Number of literals : 169 ( 28 equ; 82 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 12 con; 0-2 aty)
% Number of variables : 80 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(definition_smaller_8,axiom,
( smaller(X2,X1)
| ~ greater(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001-0.ax',definition_smaller_8) ).
cnf(definition_1_41,axiom,
( has_immunity(X1,X2)
| ~ has_endowment(X1)
| ~ smaller_or_equal(age(X1,X2),eta) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_1_41) ).
cnf(definition_smaller_or_equal_2,axiom,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001-0.ax',definition_smaller_or_equal_2) ).
cnf(theorem_11_73,negated_conjecture,
greater(eta,zero),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_11_73) ).
cnf(assumption_15_55,axiom,
( dissimilar(X1,X2,X3)
| ~ organization(X1)
| age(X1,X2) != zero
| ~ greater(age(X1,X3),sigma) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_15_55) ).
cnf(assumption_17_57,axiom,
( hazard_of_mortality(X1,X2) = very_low
| ~ organization(X1)
| ~ has_immunity(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_17_57) ).
cnf(theorem_11_76,negated_conjecture,
smaller_or_equal(age(sk2,sk4),eta),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_11_76) ).
cnf(theorem_11_69,negated_conjecture,
has_endowment(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_11_69) ).
cnf(theorem_11_70,negated_conjecture,
age(sk2,sk3) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_11_70) ).
cnf(theorem_11_67,negated_conjecture,
organization(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_11_67) ).
cnf(assumption_13_54,axiom,
( is_aligned(X1,X2)
| ~ organization(X1)
| age(X1,X2) != zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_13_54) ).
cnf(meaning_postulate_greater_transitive_10,axiom,
( greater(X1,X3)
| ~ greater(X1,X2)
| ~ greater(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT001-0.ax',meaning_postulate_greater_transitive_10) ).
cnf(theorem_11_80,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/sandbox2/benchmark/theBenchmark.p',theorem_11_80) ).
cnf(definition_1_42,axiom,
( ~ has_endowment(X1)
| ~ greater(age(X1,X2),eta)
| ~ has_immunity(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_1_42) ).
cnf(assumption_17_59,axiom,
( has_immunity(X1,X2)
| is_aligned(X1,X2)
| hazard_of_mortality(X1,X2) = mod1
| ~ organization(X1)
| ~ positional_advantage(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_17_59) ).
cnf(assumption_17_61,axiom,
( has_immunity(X1,X2)
| is_aligned(X1,X2)
| positional_advantage(X1,X2)
| hazard_of_mortality(X1,X2) = high
| ~ organization(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_17_61) ).
cnf(definition_2_49,axiom,
( ~ dissimilar(X1,X2,X3)
| ~ is_aligned(X1,X2)
| ~ is_aligned(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_2_49) ).
cnf(theorem_11_77,negated_conjecture,
greater(age(sk2,sk5),sigma),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_11_77) ).
cnf(assumption_18e_66,axiom,
greater(mod2,low),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_18e_66) ).
cnf(theorem_11_79,negated_conjecture,
greater(age(sk2,sk5),eta),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_11_79) ).
cnf(assumption_18c_64,axiom,
greater(low,very_low),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_18c_64) ).
cnf(assumption_18d_65,axiom,
greater(high,mod2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_18d_65) ).
cnf(assumption_18b_63,axiom,
greater(mod1,low),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_18b_63) ).
cnf(c_0_23,plain,
( smaller(X2,X1)
| ~ greater(X1,X2) ),
inference(fof_simplification,[status(thm)],[definition_smaller_8]) ).
cnf(c_0_24,plain,
( has_immunity(X1,X2)
| ~ has_endowment(X1)
| ~ smaller_or_equal(age(X1,X2),eta) ),
inference(fof_simplification,[status(thm)],[definition_1_41]) ).
cnf(c_0_25,plain,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
inference(fof_simplification,[status(thm)],[definition_smaller_or_equal_2]) ).
cnf(c_0_26,plain,
( smaller(X2,X1)
| ~ greater(X1,X2) ),
c_0_23 ).
cnf(c_0_27,negated_conjecture,
greater(eta,zero),
theorem_11_73 ).
cnf(c_0_28,plain,
( dissimilar(X1,X2,X3)
| ~ organization(X1)
| age(X1,X2) != zero
| ~ greater(age(X1,X3),sigma) ),
inference(fof_simplification,[status(thm)],[assumption_15_55]) ).
cnf(c_0_29,plain,
( hazard_of_mortality(X1,X2) = very_low
| ~ organization(X1)
| ~ has_immunity(X1,X2) ),
inference(fof_simplification,[status(thm)],[assumption_17_57]) ).
cnf(c_0_30,plain,
( has_immunity(X1,X2)
| ~ has_endowment(X1)
| ~ smaller_or_equal(age(X1,X2),eta) ),
c_0_24 ).
cnf(c_0_31,negated_conjecture,
smaller_or_equal(age(sk2,sk4),eta),
theorem_11_76 ).
cnf(c_0_32,negated_conjecture,
has_endowment(sk2),
theorem_11_69 ).
cnf(c_0_33,negated_conjecture,
age(sk2,sk3) = zero,
theorem_11_70 ).
cnf(c_0_34,plain,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
c_0_25 ).
cnf(c_0_35,negated_conjecture,
smaller(zero,eta),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_36,plain,
( dissimilar(X1,X2,X3)
| ~ organization(X1)
| age(X1,X2) != zero
| ~ greater(age(X1,X3),sigma) ),
c_0_28 ).
cnf(c_0_37,negated_conjecture,
organization(sk2),
theorem_11_67 ).
cnf(c_0_38,plain,
( is_aligned(X1,X2)
| ~ organization(X1)
| age(X1,X2) != zero ),
inference(fof_simplification,[status(thm)],[assumption_13_54]) ).
cnf(c_0_39,plain,
( greater(X1,X3)
| ~ greater(X1,X2)
| ~ greater(X2,X3) ),
inference(fof_simplification,[status(thm)],[meaning_postulate_greater_transitive_10]) ).
cnf(c_0_40,negated_conjecture,
( ~ greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk4))
| hazard_of_mortality(sk2,sk4) != hazard_of_mortality(sk2,sk3) ),
inference(fof_simplification,[status(thm)],[theorem_11_80]) ).
cnf(c_0_41,plain,
( hazard_of_mortality(X1,X2) = very_low
| ~ organization(X1)
| ~ has_immunity(X1,X2) ),
c_0_29 ).
cnf(c_0_42,negated_conjecture,
has_immunity(sk2,sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_43,negated_conjecture,
( has_immunity(sk2,sk3)
| ~ smaller_or_equal(zero,eta) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_33]),c_0_32])]) ).
cnf(c_0_44,negated_conjecture,
smaller_or_equal(zero,eta),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_45,plain,
( ~ has_endowment(X1)
| ~ greater(age(X1,X2),eta)
| ~ has_immunity(X1,X2) ),
inference(fof_simplification,[status(thm)],[definition_1_42]) ).
cnf(c_0_46,plain,
( has_immunity(X1,X2)
| is_aligned(X1,X2)
| hazard_of_mortality(X1,X2) = mod1
| ~ organization(X1)
| ~ positional_advantage(X1,X2) ),
inference(fof_simplification,[status(thm)],[assumption_17_59]) ).
cnf(c_0_47,plain,
( has_immunity(X1,X2)
| is_aligned(X1,X2)
| positional_advantage(X1,X2)
| hazard_of_mortality(X1,X2) = high
| ~ organization(X1) ),
inference(fof_simplification,[status(thm)],[assumption_17_61]) ).
cnf(c_0_48,plain,
( ~ dissimilar(X1,X2,X3)
| ~ is_aligned(X1,X2)
| ~ is_aligned(X1,X3) ),
inference(fof_simplification,[status(thm)],[definition_2_49]) ).
cnf(c_0_49,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_36,c_0_33]),c_0_37])]) ).
cnf(c_0_50,negated_conjecture,
greater(age(sk2,sk5),sigma),
theorem_11_77 ).
cnf(c_0_51,plain,
( is_aligned(X1,X2)
| ~ organization(X1)
| age(X1,X2) != zero ),
c_0_38 ).
cnf(c_0_52,plain,
( greater(X1,X3)
| ~ greater(X1,X2)
| ~ greater(X2,X3) ),
c_0_39 ).
cnf(c_0_53,axiom,
greater(mod2,low),
assumption_18e_66 ).
cnf(c_0_54,negated_conjecture,
( ~ greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk4))
| hazard_of_mortality(sk2,sk4) != hazard_of_mortality(sk2,sk3) ),
c_0_40 ).
cnf(c_0_55,negated_conjecture,
hazard_of_mortality(sk2,sk4) = very_low,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_37])]) ).
cnf(c_0_56,negated_conjecture,
has_immunity(sk2,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_57,plain,
( ~ has_endowment(X1)
| ~ greater(age(X1,X2),eta)
| ~ has_immunity(X1,X2) ),
c_0_45 ).
cnf(c_0_58,negated_conjecture,
greater(age(sk2,sk5),eta),
theorem_11_79 ).
cnf(c_0_59,plain,
( has_immunity(X1,X2)
| is_aligned(X1,X2)
| hazard_of_mortality(X1,X2) = mod1
| ~ organization(X1)
| ~ positional_advantage(X1,X2) ),
c_0_46 ).
cnf(c_0_60,plain,
( has_immunity(X1,X2)
| is_aligned(X1,X2)
| positional_advantage(X1,X2)
| hazard_of_mortality(X1,X2) = high
| ~ organization(X1) ),
c_0_47 ).
cnf(c_0_61,plain,
( ~ dissimilar(X1,X2,X3)
| ~ is_aligned(X1,X2)
| ~ is_aligned(X1,X3) ),
c_0_48 ).
cnf(c_0_62,negated_conjecture,
dissimilar(sk2,sk3,sk5),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_63,negated_conjecture,
is_aligned(sk2,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_33]),c_0_37])]) ).
cnf(c_0_64,axiom,
greater(low,very_low),
assumption_18c_64 ).
cnf(c_0_65,plain,
( greater(X1,low)
| ~ greater(X1,mod2) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_66,axiom,
greater(high,mod2),
assumption_18d_65 ).
cnf(c_0_67,negated_conjecture,
( hazard_of_mortality(sk2,sk3) != very_low
| ~ greater(hazard_of_mortality(sk2,sk5),very_low) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55]),c_0_55]) ).
cnf(c_0_68,negated_conjecture,
hazard_of_mortality(sk2,sk3) = very_low,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_56]),c_0_37])]) ).
cnf(c_0_69,negated_conjecture,
~ has_immunity(sk2,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_32])]) ).
cnf(c_0_70,plain,
( hazard_of_mortality(X1,X2) = high
| hazard_of_mortality(X1,X2) = mod1
| is_aligned(X1,X2)
| has_immunity(X1,X2)
| ~ organization(X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_71,negated_conjecture,
~ is_aligned(sk2,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63])]) ).
cnf(c_0_72,plain,
( greater(X1,very_low)
| ~ greater(X1,low) ),
inference(spm,[status(thm)],[c_0_52,c_0_64]) ).
cnf(c_0_73,plain,
greater(high,low),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_74,negated_conjecture,
~ greater(hazard_of_mortality(sk2,sk5),very_low),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68])]) ).
cnf(c_0_75,negated_conjecture,
( hazard_of_mortality(sk2,sk5) = mod1
| hazard_of_mortality(sk2,sk5) = high ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_37])]),c_0_71]) ).
cnf(c_0_76,plain,
greater(high,very_low),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_77,axiom,
greater(mod1,low),
assumption_18b_63 ).
cnf(c_0_78,negated_conjecture,
hazard_of_mortality(sk2,sk5) = mod1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76])]) ).
cnf(c_0_79,plain,
greater(mod1,very_low),
inference(spm,[status(thm)],[c_0_72,c_0_77]) ).
cnf(c_0_80,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_78]),c_0_79])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : MGT065-1 : TPTP v8.2.0. Released v2.4.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n003.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Sat May 18 23:57:38 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.23/0.49 Running first-order theorem proving
% 0.23/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
% 0.23/0.52 # Version: 3.1.0
% 0.23/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.23/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.23/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.52 # Starting sh5l with 300s (1) cores
% 0.23/0.52 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 26161 completed with status 0
% 0.23/0.52 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.23/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.23/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.23/0.52 # No SInE strategy applied
% 0.23/0.52 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.23/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 811s (1) cores
% 0.23/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.23/0.52 # Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.23/0.52 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.23/0.52 # Starting G----_Z1014__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 0.23/0.52 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 26168 completed with status 0
% 0.23/0.52 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.23/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.23/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.23/0.52 # No SInE strategy applied
% 0.23/0.52 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.23/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 811s (1) cores
% 0.23/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.23/0.52 # Preprocessing time : 0.001 s
% 0.23/0.52 # Presaturation interreduction done
% 0.23/0.52
% 0.23/0.52 # Proof found!
% 0.23/0.52 # SZS status Unsatisfiable
% 0.23/0.52 # SZS output start CNFRefutation
% See solution above
% 0.23/0.52 # Parsed axioms : 52
% 0.23/0.52 # Removed by relevancy pruning/SinE : 0
% 0.23/0.52 # Initial clauses : 52
% 0.23/0.52 # Removed in clause preprocessing : 3
% 0.23/0.52 # Initial clauses in saturation : 49
% 0.23/0.52 # Processed clauses : 251
% 0.23/0.52 # ...of these trivial : 0
% 0.23/0.52 # ...subsumed : 18
% 0.23/0.52 # ...remaining for further processing : 233
% 0.23/0.52 # Other redundant clauses eliminated : 2
% 0.23/0.52 # Clauses deleted for lack of memory : 0
% 0.23/0.52 # Backward-subsumed : 0
% 0.23/0.52 # Backward-rewritten : 14
% 0.23/0.52 # Generated clauses : 310
% 0.23/0.52 # ...of the previous two non-redundant : 242
% 0.23/0.52 # ...aggressively subsumed : 0
% 0.23/0.52 # Contextual simplify-reflections : 1
% 0.23/0.52 # Paramodulations : 305
% 0.23/0.52 # Factorizations : 3
% 0.23/0.52 # NegExts : 0
% 0.23/0.52 # Equation resolutions : 2
% 0.23/0.52 # Disequality decompositions : 0
% 0.23/0.52 # Total rewrite steps : 112
% 0.23/0.52 # ...of those cached : 69
% 0.23/0.52 # Propositional unsat checks : 0
% 0.23/0.52 # Propositional check models : 0
% 0.23/0.52 # Propositional check unsatisfiable : 0
% 0.23/0.52 # Propositional clauses : 0
% 0.23/0.52 # Propositional clauses after purity: 0
% 0.23/0.52 # Propositional unsat core size : 0
% 0.23/0.52 # Propositional preprocessing time : 0.000
% 0.23/0.52 # Propositional encoding time : 0.000
% 0.23/0.52 # Propositional solver time : 0.000
% 0.23/0.52 # Success case prop preproc time : 0.000
% 0.23/0.52 # Success case prop encoding time : 0.000
% 0.23/0.52 # Success case prop solver time : 0.000
% 0.23/0.52 # Current number of processed clauses : 168
% 0.23/0.52 # Positive orientable unit clauses : 79
% 0.23/0.52 # Positive unorientable unit clauses: 0
% 0.23/0.52 # Negative unit clauses : 18
% 0.23/0.52 # Non-unit-clauses : 71
% 0.23/0.52 # Current number of unprocessed clauses: 82
% 0.23/0.52 # ...number of literals in the above : 246
% 0.23/0.52 # Current number of archived formulas : 0
% 0.23/0.52 # Current number of archived clauses : 63
% 0.23/0.52 # Clause-clause subsumption calls (NU) : 1440
% 0.23/0.52 # Rec. Clause-clause subsumption calls : 1031
% 0.23/0.52 # Non-unit clause-clause subsumptions : 16
% 0.23/0.52 # Unit Clause-clause subsumption calls : 1100
% 0.23/0.52 # Rewrite failures with RHS unbound : 0
% 0.23/0.52 # BW rewrite match attempts : 13
% 0.23/0.52 # BW rewrite match successes : 4
% 0.23/0.52 # Condensation attempts : 0
% 0.23/0.52 # Condensation successes : 0
% 0.23/0.52 # Termbank termtop insertions : 4315
% 0.23/0.52 # Search garbage collected termcells : 80
% 0.23/0.52
% 0.23/0.52 # -------------------------------------------------
% 0.23/0.52 # User time : 0.013 s
% 0.23/0.52 # System time : 0.004 s
% 0.23/0.52 # Total time : 0.017 s
% 0.23/0.52 # Maximum resident set size: 1752 pages
% 0.23/0.52
% 0.23/0.52 # -------------------------------------------------
% 0.23/0.52 # User time : 0.070 s
% 0.23/0.52 # System time : 0.011 s
% 0.23/0.52 # Total time : 0.081 s
% 0.23/0.52 # Maximum resident set size: 1764 pages
% 0.23/0.52 % E---3.1 exiting
% 0.23/0.52 % E exiting
%------------------------------------------------------------------------------