%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : AGT033^1 : TPTP v9.3.1. Bugfixed v5.4.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 : Wed Sep 30 07:44:29 AM UTC 2026
% Result : Theorem 0.25s 0.27s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of formulae : 49 ( 33 unt; 0 typ; 0 def)
% Number of atoms : 111 ( 23 equ; 0 cnn)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 226 ( 38 ~; 20 |; 0 &; 165 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 47 ( 47 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 17 usr; 4 con; 0-3 aty)
% Number of variables : 112 ( 54 ^; 55 !; 3 ?; 112 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mu: $tType ).
thf(decl_25,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_26,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_28,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_32,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_34,type,
mexists_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_38,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_39,type,
mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_41,type,
msymmetric: ( $i > $i > $o ) > $o ).
thf(decl_42,type,
mserial: ( $i > $i > $o ) > $o ).
thf(decl_50,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_54,type,
a1: $i > $i > $o ).
thf(decl_58,type,
piotr: mu ).
thf(decl_61,type,
beer: mu ).
thf(decl_62,type,
likes: mu > mu > $i > $o ).
thf(decl_64,type,
possibly_likes: mu > mu > $i > $o ).
thf(decl_72,type,
esk6_1: $i > $i ).
thf(decl_75,type,
esk9_0: $i ).
thf(msymmetric,axiom,
( msymmetric
= ( ^ [X13: $i > $i > $o] :
! [X15: $i,X16: $i] :
( ( X13 @ X15 @ X16 )
=> ( X13 @ X16 @ X15 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.CyjeB9SVA5/E---3.1_2411940.p',msymmetric) ).
thf(mserial,axiom,
( mserial
= ( ^ [X13: $i > $i > $o] :
! [X15: $i] :
? [X16: $i] : ( X13 @ X15 @ X16 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.CyjeB9SVA5/E---3.1_2411940.p',mserial) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.CyjeB9SVA5/E---3.1_2411940.p',mimplies) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.CyjeB9SVA5/E---3.1_2411940.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.CyjeB9SVA5/E---3.1_2411940.p',mor) ).
thf(mdia,axiom,
( mdia
= ( ^ [X13: $i > $i > $o,X6: $i > $o] : ( mnot @ ( mbox @ X13 @ ( mnot @ X6 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.CyjeB9SVA5/E---3.1_2411940.p',mdia) ).
thf(mbox,axiom,
( mbox
= ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( X13 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.CyjeB9SVA5/E---3.1_2411940.p',mbox) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.CyjeB9SVA5/E---3.1_2411940.p',mvalid) ).
thf(axioms_B_a1,axiom,
msymmetric @ a1,
file('/export/starexec/sandbox2/tmp/tmp.CyjeB9SVA5/E---3.1_2411940.p',axioms_B_a1) ).
thf(axioms_D_a1,axiom,
mserial @ a1,
file('/export/starexec/sandbox2/tmp/tmp.CyjeB9SVA5/E---3.1_2411940.p',axioms_D_a1) ).
thf(mforall_ind,axiom,
( mforall_ind
= ( ^ [X8: mu > $i > $o,X3: $i] :
! [X1: mu] : ( X8 @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.CyjeB9SVA5/E---3.1_2411940.p',mforall_ind) ).
thf(axiom_a2_3,axiom,
mvalid @ ( mbox @ a1 @ ( likes @ piotr @ beer ) ),
file('/export/starexec/sandbox2/tmp/tmp.CyjeB9SVA5/E---3.1_2411940.p',axiom_a2_3) ).
thf(mexists_ind,axiom,
( mexists_ind
= ( ^ [X11: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [X1: mu] : ( mnot @ ( X11 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.CyjeB9SVA5/E---3.1_2411940.p',mexists_ind) ).
thf(axiom_user_communication_3,axiom,
( mvalid
@ ( mforall_ind
@ ^ [X1: mu] :
( mforall_ind
@ ^ [X2: mu] : ( mimplies @ ( mdia @ a1 @ ( likes @ X1 @ X2 ) ) @ ( possibly_likes @ X1 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.CyjeB9SVA5/E---3.1_2411940.p',axiom_user_communication_3) ).
thf(conj,conjecture,
( mvalid
@ ( mexists_ind
@ ^ [X1: mu] :
( mexists_ind
@ ^ [X2: mu] : ( possibly_likes @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.CyjeB9SVA5/E---3.1_2411940.p',conj) ).
thf(c_0_15,plain,
( msymmetric
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i,X16: $i] :
( ( Z0 @ X15 @ X16 )
=> ( Z0 @ X16 @ X15 ) ) ) ),
inference(fof_simplification,[status(thm)],[msymmetric]) ).
thf(c_0_16,plain,
( mserial
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i] :
? [X16: $i] : ( Z0 @ X15 @ X16 ) ) ),
inference(fof_simplification,[status(thm)],[mserial]) ).
thf(c_0_17,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_18,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_19,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_20,plain,
( mdia
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
~ ! [X24: $i] :
( ~ ( Z0 @ Z2 @ X24 )
| ~ ( Z1 @ X24 ) ) ) ),
inference(fof_simplification,[status(thm)],[mdia]) ).
thf(c_0_21,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X14: $i] :
( ~ ( Z0 @ Z2 @ X14 )
| ( Z1 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_22,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_23,plain,
! [X81: $i,X82: $i] :
( ( a1 @ X81 @ X82 )
=> ( a1 @ X82 @ X81 ) ),
inference(apply_def,[status(thm)],[axioms_B_a1,c_0_15]) ).
thf(c_0_24,plain,
! [X87: $i] :
? [X88: $i] : ( a1 @ X87 @ X88 ),
inference(apply_def,[status(thm)],[axioms_D_a1,c_0_16]) ).
thf(c_0_25,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
thf(c_0_26,plain,
( mforall_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
! [X1: mu] : ( Z0 @ X1 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_ind]) ).
thf(c_0_27,plain,
( mdia
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
~ ! [X24: $i] :
( ~ ( Z0 @ Z2 @ X24 )
| ~ ( Z1 @ X24 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_20,c_0_18]),c_0_21]) ).
thf(c_0_28,plain,
! [X42: $i,X41: $i] :
( ~ ( a1 @ X42 @ X41 )
| ( likes @ piotr @ beer @ X41 ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom_a2_3,c_0_21]),c_0_22])]) ).
thf(c_0_29,plain,
! [X194: $i,X195: $i] :
( ~ ( a1 @ X194 @ X195 )
| ( a1 @ X195 @ X194 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).
thf(c_0_30,plain,
! [X200: $i] : ( a1 @ X200 @ ( esk6_1 @ X200 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_24])]) ).
thf(c_0_31,plain,
( mexists_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
~ ! [X22: mu] :
~ ( Z0 @ X22 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mexists_ind]) ).
thf(c_0_32,plain,
! [X72: $i,X71: mu,X70: mu] :
( ~ ~ ! [X69: $i] :
( ~ ( a1 @ X72 @ X69 )
| ~ ( likes @ X71 @ X70 @ X69 ) )
| ( possibly_likes @ X71 @ X70 @ X72 ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_user_communication_3]),c_0_25]),c_0_26]),c_0_27]),c_0_22])]) ).
thf(c_0_33,plain,
! [X154: $i,X155: $i] :
( ~ ( a1 @ X154 @ X155 )
| ( likes @ piotr @ beer @ X155 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_28])]) ).
thf(c_0_34,plain,
! [X3: $i,X14: $i] :
( ( a1 @ X14 @ X3 )
| ~ ( a1 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_35,plain,
! [X3: $i] : ( a1 @ X3 @ ( esk6_1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
thf(c_0_36,negated_conjecture,
~ ( mvalid
@ ( mexists_ind
@ ^ [X1: mu] :
( mexists_ind
@ ^ [X2: mu] : ( possibly_likes @ X1 @ X2 ) ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(c_0_37,plain,
( mexists_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
~ ! [X22: mu] :
~ ( Z0 @ X22 @ Z1 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_31,c_0_18]),c_0_26]) ).
thf(c_0_38,plain,
! [X182: $i,X183: mu,X184: mu,X185: $i] :
( ~ ( a1 @ X182 @ X185 )
| ~ ( likes @ X183 @ X184 @ X185 )
| ( possibly_likes @ X183 @ X184 @ X182 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])])]) ).
thf(c_0_39,plain,
! [X3: $i,X14: $i] :
( ( likes @ piotr @ beer @ X14 )
| ~ ( a1 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
thf(c_0_40,plain,
! [X3: $i] : ( a1 @ ( esk6_1 @ X3 ) @ X3 ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
thf(c_0_41,negated_conjecture,
~ ! [X137: $i] :
~ ! [X136: mu] :
~ ~ ! [X135: mu] :
~ ( possibly_likes @ X136 @ X135 @ X137 ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_36]),c_0_37]),c_0_22])]) ).
thf(c_0_42,plain,
! [X3: $i,X2: mu,X1: mu,X14: $i] :
( ( possibly_likes @ X1 @ X2 @ X3 )
| ~ ( a1 @ X3 @ X14 )
| ~ ( likes @ X1 @ X2 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
thf(c_0_43,plain,
! [X3: $i] : ( likes @ piotr @ beer @ X3 ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
thf(c_0_44,negated_conjecture,
! [X249: mu,X250: mu] :
~ ( possibly_likes @ X249 @ X250 @ esk9_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_41])])])]) ).
thf(c_0_45,plain,
! [X3: $i,X14: $i] :
( ( possibly_likes @ piotr @ beer @ X3 )
| ~ ( a1 @ X3 @ X14 ) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
thf(c_0_46,negated_conjecture,
! [X1: mu,X2: mu] :
~ ( possibly_likes @ X1 @ X2 @ esk9_0 ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
thf(c_0_47,plain,
! [X3: $i] : ( possibly_likes @ piotr @ beer @ X3 ),
inference(spm,[status(thm)],[c_0_45,c_0_35]) ).
thf(c_0_48,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_46,c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : AGT033^1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.16 % Computer : n013.cluster.edu
% 0.06/0.16 % Model : x86_64 x86_64
% 0.06/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.16 % Memory : 8046.5625MB
% 0.06/0.16 % OS : Linux 6.8.0-71-generic
% 0.06/0.16 % CPULimit : 300
% 0.06/0.16 % WCLimit : 300
% 0.06/0.16 % DateTime : Tue Sep 29 17:29:57 UTC 2026
% 0.06/0.16 % CPUTime :
% 0.06/0.16 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.21 Running higher-order theorem proving
% 0.06/0.23 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --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.CyjeB9SVA5/E---3.1_2411940.p
% 0.25/0.27 % Version: 3.5.1-ho
% 0.25/0.27 % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.25/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.27 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.25/0.27 % Starting post_as_ho3 with 300s (1) cores
% 0.25/0.27 % Starting new_ho_12 with 300s (1) cores
% 0.25/0.27 % Starting new_bool_2 with 300s (1) cores
% 0.25/0.27 % new_ho_10_cnf2 with pid 2411953 completed with status 0
% 0.25/0.27 % Result found by new_ho_10_cnf2
% 0.25/0.27 % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.25/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.27 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.25/0.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.27 % No SInE strategy applied
% 0.25/0.27 % Search class: HGUNM-FFMF32-SHSSMFNN
% 0.25/0.27 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.27 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.27 % Starting new_ho_10_cnf2 with 151s (1) cores
% 0.25/0.27 % Starting sh5l with 136s (1) cores
% 0.25/0.27 % Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.25/0.27 % Starting lpo1_def_fix with 136s (1) cores
% 0.25/0.27 % sh5l with pid 2411962 completed with status 0
% 0.25/0.27 % Result found by sh5l
% 0.25/0.27 % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.25/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.27 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.25/0.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.27 % No SInE strategy applied
% 0.25/0.27 % Search class: HGUNM-FFMF32-SHSSMFNN
% 0.25/0.27 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.27 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.27 % Starting new_ho_10_cnf2 with 151s (1) cores
% 0.25/0.27 % Starting sh5l with 136s (1) cores
% 0.25/0.27 % Preprocessing time : 0.002 s
% 0.25/0.27 % Presaturation interreduction done
% 0.25/0.27
% 0.25/0.27 % Proof found!
% 0.25/0.27 % SZS status Theorem
% 0.25/0.27 % SZS output start CNFRefutation
% See solution above
% 0.25/0.27 % Parsed axioms : 118
% 0.25/0.27 % Removed by relevancy pruning/SinE : 0
% 0.25/0.27 % Initial clauses : 91
% 0.25/0.27 % Removed in clause preprocessing : 45
% 0.25/0.27 % Initial clauses in saturation : 46
% 0.25/0.27 % Processed clauses : 102
% 0.25/0.27 % ...of these trivial : 0
% 0.25/0.27 % ...subsumed : 5
% 0.25/0.27 % ...remaining for further processing : 97
% 0.25/0.27 % Other redundant clauses eliminated : 0
% 0.25/0.27 % Clauses deleted for lack of memory : 0
% 0.25/0.27 % Backward-subsumed : 0
% 0.25/0.27 % Backward-rewritten : 11
% 0.25/0.27 % Generated clauses : 116
% 0.25/0.27 % ...of the previous two non-redundant : 107
% 0.25/0.27 % ...aggressively subsumed : 0
% 0.25/0.27 % Contextual simplify-reflections : 0
% 0.25/0.27 % Paramodulations : 116
% 0.25/0.27 % Factorizations : 0
% 0.25/0.27 % NegExts : 0
% 0.25/0.27 % Equation resolutions : 0
% 0.25/0.27 % Disequality decompositions : 0
% 0.25/0.27 % Total rewrite steps : 19
% 0.25/0.27 % ...of those cached : 4
% 0.25/0.27 % Propositional unsat checks : 0
% 0.25/0.27 % Propositional check models : 0
% 0.25/0.27 % Propositional check unsatisfiable : 0
% 0.25/0.27 % Propositional clauses : 0
% 0.25/0.27 % Propositional clauses after purity: 0
% 0.25/0.27 % Propositional unsat core size : 0
% 0.25/0.27 % Propositional preprocessing time : 0.000
% 0.25/0.27 % Propositional encoding time : 0.000
% 0.25/0.27 % Propositional solver time : 0.000
% 0.25/0.27 % Success case prop preproc time : 0.000
% 0.25/0.27 % Success case prop encoding time : 0.000
% 0.25/0.27 % Success case prop solver time : 0.000
% 0.25/0.27 % Current number of processed clauses : 42
% 0.25/0.27 % Positive orientable unit clauses : 16
% 0.25/0.27 % Positive unorientable unit clauses: 0
% 0.25/0.27 % Negative unit clauses : 1
% 0.25/0.27 % Non-unit-clauses : 25
% 0.25/0.27 % Current number of unprocessed clauses: 78
% 0.25/0.27 % ...number of literals in the above : 191
% 0.25/0.27 % Current number of archived formulas : 0
% 0.25/0.27 % Current number of archived clauses : 55
% 0.25/0.27 % Clause-clause subsumption calls (NU) : 162
% 0.25/0.27 % Rec. Clause-clause subsumption calls : 125
% 0.25/0.27 % Non-unit clause-clause subsumptions : 5
% 0.25/0.27 % Unit Clause-clause subsumption calls : 5
% 0.25/0.27 % Rewrite failures with RHS unbound : 0
% 0.25/0.27 % BW rewrite match attempts : 10
% 0.25/0.27 % BW rewrite match successes : 9
% 0.25/0.27 % Condensation attempts : 102
% 0.25/0.27 % Condensation successes : 0
% 0.25/0.27 % Termbank termtop insertions : 11557
% 0.25/0.27 % Search garbage collected termcells : 3237
% 0.25/0.27
% 0.25/0.27 % -------------------------------------------------
% 0.25/0.27 % User time : 0.018 s
% 0.25/0.27 % System time : 0.003 s
% 0.25/0.27 % Total time : 0.021 s
% 0.25/0.27 % Maximum resident set size: 4248 pages
% 0.25/0.27
% 0.25/0.27 % -------------------------------------------------
% 0.25/0.27 % User time : 0.055 s
% 0.25/0.27 % System time : 0.018 s
% 0.25/0.27 % Total time : 0.073 s
% 0.25/0.27 % Maximum resident set size: 4864 pages
% 0.25/0.27 % E exiting
%------------------------------------------------------------------------------