%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PUZ008-3 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:01:21 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.43s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 12
% Syntax : Number of clauses : 51 ( 27 unt; 0 nHn; 40 RR)
% Number of literals : 111 ( 0 equ; 63 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 98 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(great_eq_recursive,axiom,
( ~ greater_or_equal(X1,X2)
| greater_or_equal(s(X1),s(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',great_eq_recursive) ).
cnf(great_eq_base,axiom,
greater_or_equal(X1,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',great_eq_base) ).
cnf(same_or_more_missionaries_is_safe,axiom,
( ~ greater_or_equal(X1,X2)
| safe(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',same_or_more_missionaries_is_safe) ).
cnf(missionary_and_cannibal_west_to_east,axiom,
( ~ safe(s(X3),s(X4))
| ~ safe(X1,X2)
| ~ achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4)))
| achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',missionary_and_cannibal_west_to_east) ).
cnf(missionary_east_to_west,axiom,
( ~ safe(X3,X4)
| ~ safe(s(X1),X2)
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(X4)))
| achievable(west(m(s(X1)),c(X2)),boatonwest,east(m(X3),c(X4))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',missionary_east_to_west) ).
cnf(start_on_west_bank,hypothesis,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',start_on_west_bank) ).
cnf(two_cannibals_west_to_east,axiom,
( ~ safe(X3,s(s(X4)))
| ~ safe(X1,X2)
| ~ achievable(west(m(X1),c(s(s(X2)))),boatonwest,east(m(X3),c(X4)))
| achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(s(X4))))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_cannibals_west_to_east) ).
cnf(no_missionaries_is_safe,axiom,
safe(n0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_missionaries_is_safe) ).
cnf(cannibal_east_to_west,axiom,
( ~ safe(X3,X4)
| ~ safe(X1,s(X2))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(X4))))
| achievable(west(m(X1),c(s(X2))),boatonwest,east(m(X3),c(X4))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cannibal_east_to_west) ).
cnf(two_missionaries_west_to_east,axiom,
( ~ safe(s(s(X3)),X4)
| ~ safe(X1,X2)
| ~ achievable(west(m(s(s(X1))),c(X2)),boatonwest,east(m(X3),c(X4)))
| achievable(west(m(X1),c(X2)),boatoneast,east(m(s(s(X3))),c(X4))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_missionaries_west_to_east) ).
cnf(missionary_and_cannibal_east_to_west,axiom,
( ~ safe(X3,X4)
| ~ safe(s(X1),s(X2))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4))))
| achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',missionary_and_cannibal_east_to_west) ).
cnf(prove_can_get_to_east_bank,negated_conjecture,
~ achievable(west(m(n0),c(n0)),X1,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_can_get_to_east_bank) ).
cnf(c_0_12,plain,
( ~ greater_or_equal(X1,X2)
| greater_or_equal(s(X1),s(X2)) ),
inference(fof_simplification,[status(thm)],[great_eq_recursive]) ).
cnf(c_0_13,plain,
( ~ greater_or_equal(X1,X2)
| greater_or_equal(s(X1),s(X2)) ),
c_0_12 ).
cnf(c_0_14,axiom,
greater_or_equal(X1,n0),
great_eq_base ).
cnf(c_0_15,plain,
( ~ greater_or_equal(X1,X2)
| safe(X1,X2) ),
inference(fof_simplification,[status(thm)],[same_or_more_missionaries_is_safe]) ).
cnf(c_0_16,plain,
greater_or_equal(s(X1),s(n0)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( ~ safe(s(X3),s(X4))
| ~ safe(X1,X2)
| ~ achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4)))
| achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4)))) ),
inference(fof_simplification,[status(thm)],[missionary_and_cannibal_west_to_east]) ).
cnf(c_0_18,plain,
( ~ greater_or_equal(X1,X2)
| safe(X1,X2) ),
c_0_15 ).
cnf(c_0_19,plain,
greater_or_equal(s(s(X1)),s(s(n0))),
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_20,plain,
( ~ safe(X3,X4)
| ~ safe(s(X1),X2)
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(X4)))
| achievable(west(m(s(X1)),c(X2)),boatonwest,east(m(X3),c(X4))) ),
inference(fof_simplification,[status(thm)],[missionary_east_to_west]) ).
cnf(c_0_21,plain,
( ~ safe(s(X3),s(X4))
| ~ safe(X1,X2)
| ~ achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4)))
| achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4)))) ),
c_0_17 ).
cnf(c_0_22,hypothesis,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
start_on_west_bank ).
cnf(c_0_23,plain,
safe(s(X1),s(n0)),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_24,plain,
safe(s(s(X1)),s(s(n0))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( ~ safe(X3,s(s(X4)))
| ~ safe(X1,X2)
| ~ achievable(west(m(X1),c(s(s(X2)))),boatonwest,east(m(X3),c(X4)))
| achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(s(X4))))) ),
inference(fof_simplification,[status(thm)],[two_cannibals_west_to_east]) ).
cnf(c_0_26,plain,
( ~ safe(X3,X4)
| ~ safe(s(X1),X2)
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(X4)))
| achievable(west(m(s(X1)),c(X2)),boatonwest,east(m(X3),c(X4))) ),
c_0_20 ).
cnf(c_0_27,hypothesis,
achievable(west(m(s(s(n0))),c(s(s(n0)))),boatoneast,east(m(s(n0)),c(s(n0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_28,axiom,
safe(n0,X1),
no_missionaries_is_safe ).
cnf(c_0_29,plain,
( ~ safe(X3,X4)
| ~ safe(X1,s(X2))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(X4))))
| achievable(west(m(X1),c(s(X2))),boatonwest,east(m(X3),c(X4))) ),
inference(fof_simplification,[status(thm)],[cannibal_east_to_west]) ).
cnf(c_0_30,plain,
( ~ safe(X3,s(s(X4)))
| ~ safe(X1,X2)
| ~ achievable(west(m(X1),c(s(s(X2)))),boatonwest,east(m(X3),c(X4)))
| achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(s(X4))))) ),
c_0_25 ).
cnf(c_0_31,hypothesis,
achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_24]),c_0_28])]) ).
cnf(c_0_32,plain,
safe(X1,n0),
inference(spm,[status(thm)],[c_0_18,c_0_14]) ).
cnf(c_0_33,plain,
( ~ safe(s(s(X3)),X4)
| ~ safe(X1,X2)
| ~ achievable(west(m(s(s(X1))),c(X2)),boatonwest,east(m(X3),c(X4)))
| achievable(west(m(X1),c(X2)),boatoneast,east(m(s(s(X3))),c(X4))) ),
inference(fof_simplification,[status(thm)],[two_missionaries_west_to_east]) ).
cnf(c_0_34,plain,
( ~ safe(X3,X4)
| ~ safe(X1,s(X2))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(X4))))
| achievable(west(m(X1),c(s(X2))),boatonwest,east(m(X3),c(X4))) ),
c_0_29 ).
cnf(c_0_35,hypothesis,
achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0)))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_28]),c_0_32])]) ).
cnf(c_0_36,plain,
( ~ safe(X3,X4)
| ~ safe(s(X1),s(X2))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4))))
| achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4))) ),
inference(fof_simplification,[status(thm)],[missionary_and_cannibal_east_to_west]) ).
cnf(c_0_37,plain,
( ~ safe(s(s(X3)),X4)
| ~ safe(X1,X2)
| ~ achievable(west(m(s(s(X1))),c(X2)),boatonwest,east(m(X3),c(X4)))
| achievable(west(m(X1),c(X2)),boatoneast,east(m(s(s(X3))),c(X4))) ),
c_0_33 ).
cnf(c_0_38,hypothesis,
achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_23]),c_0_28])]) ).
cnf(c_0_39,plain,
( ~ safe(X3,X4)
| ~ safe(s(X1),s(X2))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4))))
| achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4))) ),
c_0_36 ).
cnf(c_0_40,hypothesis,
achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_24]),c_0_23])]) ).
cnf(c_0_41,hypothesis,
achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_24]),c_0_23])]) ).
cnf(c_0_42,hypothesis,
achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_41]),c_0_23]),c_0_28])]) ).
cnf(c_0_43,hypothesis,
achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_42]),c_0_28]),c_0_32])]) ).
cnf(c_0_44,hypothesis,
achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_43]),c_0_24]),c_0_28])]) ).
cnf(c_0_45,plain,
greater_or_equal(s(s(s(X1))),s(s(s(n0)))),
inference(spm,[status(thm)],[c_0_13,c_0_19]) ).
cnf(c_0_46,negated_conjecture,
~ achievable(west(m(n0),c(n0)),X1,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
inference(fof_simplification,[status(thm)],[prove_can_get_to_east_bank]) ).
cnf(c_0_47,hypothesis,
achievable(west(m(n0),c(s(s(n0)))),boatonwest,east(m(s(s(s(n0)))),c(s(n0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_44]),c_0_28]),c_0_23])]) ).
cnf(c_0_48,plain,
safe(s(s(s(X1))),s(s(s(n0)))),
inference(spm,[status(thm)],[c_0_18,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
~ achievable(west(m(n0),c(n0)),X1,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
c_0_46 ).
cnf(c_0_50,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_47]),c_0_48]),c_0_32])]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PUZ008-3 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.36 % Computer : n013.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 03:44:21 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.13/0.43 % Version: 3.5.1
% 0.13/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.43 % Starting sh5l with 300s (1) cores
% 0.13/0.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4069039 completed with status 0
% 0.13/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.43 % No SInE strategy applied
% 0.13/0.43 % Search class: FHUNS-FFMF21-MFFFFFNN
% 0.13/0.43 % partial match(1): FHUNS-FFSF21-MFFFFFNN
% 0.13/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.43 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.13/0.43 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 0.13/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.43 % new_bool_3 with pid 4069051 completed with status 0
% 0.13/0.43 % Result found by new_bool_3
% 0.13/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.43 % No SInE strategy applied
% 0.13/0.43 % Search class: FHUNS-FFMF21-MFFFFFNN
% 0.13/0.43 % partial match(1): FHUNS-FFSF21-MFFFFFNN
% 0.13/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.43 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.13/0.43 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 0.13/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.43 % Preprocessing time : 0.001 s
% 0.13/0.43 % Presaturation interreduction done
% 0.13/0.43
% 0.13/0.43 % Proof found!
% 0.13/0.43 % SZS status Unsatisfiable
% 0.13/0.43 % SZS output start CNFRefutation
% See solution above
% 0.13/0.43 % Parsed axioms : 16
% 0.13/0.43 % Removed by relevancy pruning/SinE : 0
% 0.13/0.43 % Initial clauses : 16
% 0.13/0.43 % Removed in clause preprocessing : 0
% 0.13/0.43 % Initial clauses in saturation : 16
% 0.13/0.43 % Processed clauses : 67
% 0.13/0.43 % ...of these trivial : 1
% 0.13/0.43 % ...subsumed : 3
% 0.13/0.43 % ...remaining for further processing : 63
% 0.13/0.43 % Other redundant clauses eliminated : 0
% 0.13/0.43 % Clauses deleted for lack of memory : 0
% 0.13/0.43 % Backward-subsumed : 0
% 0.13/0.43 % Backward-rewritten : 0
% 0.13/0.43 % Generated clauses : 61
% 0.13/0.43 % ...of the previous two non-redundant : 47
% 0.13/0.43 % ...aggressively subsumed : 0
% 0.13/0.43 % Contextual simplify-reflections : 0
% 0.13/0.43 % Paramodulations : 61
% 0.13/0.43 % Factorizations : 0
% 0.13/0.43 % NegExts : 0
% 0.13/0.43 % Equation resolutions : 0
% 0.13/0.43 % Disequality decompositions : 0
% 0.13/0.43 % Total rewrite steps : 87
% 0.13/0.43 % ...of those cached : 63
% 0.13/0.43 % Propositional unsat checks : 0
% 0.13/0.43 % Propositional check models : 0
% 0.13/0.43 % Propositional check unsatisfiable : 0
% 0.13/0.43 % Propositional clauses : 0
% 0.13/0.43 % Propositional clauses after purity: 0
% 0.13/0.43 % Propositional unsat core size : 0
% 0.13/0.43 % Propositional preprocessing time : 0.000
% 0.13/0.43 % Propositional encoding time : 0.000
% 0.13/0.43 % Propositional solver time : 0.000
% 0.13/0.43 % Success case prop preproc time : 0.000
% 0.13/0.43 % Success case prop encoding time : 0.000
% 0.13/0.43 % Success case prop solver time : 0.000
% 0.13/0.43 % Current number of processed clauses : 47
% 0.13/0.43 % Positive orientable unit clauses : 29
% 0.13/0.43 % Positive unorientable unit clauses: 0
% 0.13/0.43 % Negative unit clauses : 1
% 0.13/0.43 % Non-unit-clauses : 17
% 0.13/0.43 % Current number of unprocessed clauses: 12
% 0.13/0.43 % ...number of literals in the above : 21
% 0.13/0.43 % Current number of archived formulas : 0
% 0.13/0.43 % Current number of archived clauses : 16
% 0.13/0.43 % Clause-clause subsumption calls (NU) : 316
% 0.13/0.43 % Rec. Clause-clause subsumption calls : 168
% 0.13/0.43 % Non-unit clause-clause subsumptions : 3
% 0.13/0.43 % Unit Clause-clause subsumption calls : 15
% 0.13/0.43 % Rewrite failures with RHS unbound : 0
% 0.13/0.43 % BW rewrite match attempts : 130
% 0.13/0.43 % BW rewrite match successes : 0
% 0.13/0.43 % Condensation attempts : 0
% 0.13/0.43 % Condensation successes : 0
% 0.13/0.43 % Termbank termtop insertions : 3975
% 0.13/0.43 % Search garbage collected termcells : 69
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.007 s
% 0.13/0.43 % System time : 0.004 s
% 0.13/0.43 % Total time : 0.011 s
% 0.13/0.43 % Maximum resident set size: 3652 pages
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.037 s
% 0.13/0.43 % System time : 0.019 s
% 0.13/0.43 % Total time : 0.056 s
% 0.13/0.43 % Maximum resident set size: 4864 pages
% 0.13/0.43 % E exiting
%------------------------------------------------------------------------------