%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN978^4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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 08:41:05 AM UTC 2026
% Result : Theorem 0.08s 0.28s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 49 ( 29 unt; 0 typ; 0 def)
% Number of atoms : 177 ( 24 equ; 0 cnn)
% Maximal formula atoms : 29 ( 3 avg)
% Number of connectives : 372 ( 49 ~; 48 |; 20 &; 234 @)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 40 ( 40 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 17 usr; 5 con; 0-3 aty)
% Number of variables : 96 ( 56 ^; 40 !; 0 ?; 96 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
irel: $i > $i > $o ).
thf(decl_24,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_25,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_26,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_27,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_28,type,
mbox_s4: ( $i > $o ) > $i > $o ).
thf(decl_29,type,
iatom: ( $i > $o ) > $i > $o ).
thf(decl_33,type,
iand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_35,type,
iimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_37,type,
iequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_39,type,
ivalid: ( $i > $o ) > $o ).
thf(decl_43,type,
a: $i > $o ).
thf(decl_44,type,
b: $i > $o ).
thf(decl_45,type,
esk1_0: $i ).
thf(decl_46,type,
esk2_0: $i ).
thf(decl_47,type,
esk3_0: $i ).
thf(decl_48,type,
esk4_0: $i ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X10: $i > $o,X11: $i > $o] : ( mor @ ( mnot @ X10 ) @ X11 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.tBHyciV9QA/E---3.1_1446982.p',mimplies) ).
thf(mnot,axiom,
( mnot
= ( ^ [X4: $i > $o,X5: $i] :
~ ( X4 @ X5 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.tBHyciV9QA/E---3.1_1446982.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X5: $i] :
( ( X6 @ X5 )
| ( X7 @ X5 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.tBHyciV9QA/E---3.1_1446982.p',mor) ).
thf(iand,axiom,
( iand
= ( ^ [X12: $i > $o,X14: $i > $o] : ( mand @ X12 @ X14 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.tBHyciV9QA/E---3.1_1446982.p',iand) ).
thf(mand,axiom,
( mand
= ( ^ [X8: $i > $o,X9: $i > $o,X5: $i] :
( ( X8 @ X5 )
& ( X9 @ X5 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.tBHyciV9QA/E---3.1_1446982.p',mand) ).
thf(iimplies,axiom,
( iimplies
= ( ^ [X12: $i > $o,X14: $i > $o] : ( mimplies @ ( mbox_s4 @ X12 ) @ ( mbox_s4 @ X14 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.tBHyciV9QA/E---3.1_1446982.p',iimplies) ).
thf(mbox_s4,axiom,
( mbox_s4
= ( ^ [X12: $i > $o,X1: $i] :
! [X2: $i] :
( ( irel @ X1 @ X2 )
=> ( X12 @ X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.tBHyciV9QA/E---3.1_1446982.p',mbox_s4) ).
thf(iequiv,axiom,
( iequiv
= ( ^ [X12: $i > $o,X14: $i > $o] : ( iand @ ( iimplies @ X12 @ X14 ) @ ( iimplies @ X14 @ X12 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.tBHyciV9QA/E---3.1_1446982.p',iequiv) ).
thf(prove_this,conjecture,
ivalid @ ( iimplies @ ( iand @ ( iatom @ a ) @ ( iatom @ b ) ) @ ( iequiv @ ( iatom @ a ) @ ( iatom @ b ) ) ),
file('/export/starexec/sandbox/tmp/tmp.tBHyciV9QA/E---3.1_1446982.p',prove_this) ).
thf(iatom,axiom,
( iatom
= ( ^ [X12: $i > $o] : X12 ) ),
file('/export/starexec/sandbox/tmp/tmp.tBHyciV9QA/E---3.1_1446982.p',iatom) ).
thf(ivalid,axiom,
( ivalid
= ( ^ [X15: $i > $o] :
! [X13: $i] : ( X15 @ X13 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.tBHyciV9QA/E---3.1_1446982.p',ivalid) ).
thf(trans_axiom,axiom,
! [X1: $i,X2: $i,X3: $i] :
( ( ( irel @ X1 @ X2 )
& ( irel @ X2 @ X3 ) )
=> ( irel @ X1 @ X3 ) ),
file('/export/starexec/sandbox/tmp/tmp.tBHyciV9QA/E---3.1_1446982.p',trans_axiom) ).
thf(c_0_12,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_13,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_14,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_15,plain,
( iand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[iand]) ).
thf(c_0_16,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
thf(c_0_17,plain,
( iimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ! [X24: $i] :
( ( irel @ Z2 @ X24 )
=> ( Z0 @ X24 ) )
| ! [X25: $i] :
( ( irel @ Z2 @ X25 )
=> ( Z1 @ X25 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[iimplies]) ).
thf(c_0_18,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_12,c_0_13]),c_0_14]) ).
thf(c_0_19,plain,
( mbox_s4
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X2: $i] :
( ( irel @ Z1 @ X2 )
=> ( Z0 @ X2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_s4]) ).
thf(c_0_20,plain,
( iequiv
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( ~ ! [X28: $i] :
( ( irel @ Z2 @ X28 )
=> ( Z0 @ X28 ) )
| ! [X29: $i] :
( ( irel @ Z2 @ X29 )
=> ( Z1 @ X29 ) ) )
& ( ~ ! [X30: $i] :
( ( irel @ Z2 @ X30 )
=> ( Z1 @ X30 ) )
| ! [X31: $i] :
( ( irel @ Z2 @ X31 )
=> ( Z0 @ X31 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[iequiv]) ).
thf(c_0_21,plain,
( iand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_22,plain,
( iimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ! [X24: $i] :
( ( irel @ Z2 @ X24 )
=> ( Z0 @ X24 ) )
| ! [X25: $i] :
( ( irel @ Z2 @ X25 )
=> ( Z1 @ X25 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
thf(c_0_23,negated_conjecture,
~ ( ivalid @ ( iimplies @ ( iand @ ( iatom @ a ) @ ( iatom @ b ) ) @ ( iequiv @ ( iatom @ a ) @ ( iatom @ b ) ) ) ),
inference(assume_negation,[status(cth)],[prove_this]) ).
thf(c_0_24,plain,
( iatom
= ( ^ [Z0: $i > $o] : Z0 ) ),
inference(fof_simplification,[status(thm)],[iatom]) ).
thf(c_0_25,plain,
( iequiv
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( ~ ! [X28: $i] :
( ( irel @ Z2 @ X28 )
=> ( Z0 @ X28 ) )
| ! [X29: $i] :
( ( irel @ Z2 @ X29 )
=> ( Z1 @ X29 ) ) )
& ( ~ ! [X30: $i] :
( ( irel @ Z2 @ X30 )
=> ( Z1 @ X30 ) )
| ! [X31: $i] :
( ( irel @ Z2 @ X31 )
=> ( Z0 @ X31 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
thf(c_0_26,plain,
( ivalid
= ( ^ [Z0: $i > $o] :
! [X13: $i] : ( Z0 @ X13 ) ) ),
inference(fof_simplification,[status(thm)],[ivalid]) ).
thf(c_0_27,negated_conjecture,
~ ! [X43: $i] :
( ~ ! [X41: $i] :
( ( irel @ X43 @ X41 )
=> ( ( a @ X41 )
& ( b @ X41 ) ) )
| ! [X42: $i] :
( ( irel @ X43 @ X42 )
=> ( ( ~ ! [X37: $i] :
( ( irel @ X42 @ X37 )
=> ( a @ X37 ) )
| ! [X38: $i] :
( ( irel @ X42 @ X38 )
=> ( b @ X38 ) ) )
& ( ~ ! [X39: $i] :
( ( irel @ X42 @ X39 )
=> ( b @ X39 ) )
| ! [X40: $i] :
( ( irel @ X42 @ X40 )
=> ( a @ X40 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_23,c_0_24]),c_0_21]),c_0_22]),c_0_25]),c_0_26]) ).
thf(c_0_28,plain,
! [X45: $i,X46: $i,X47: $i] :
( ~ ( irel @ X45 @ X46 )
| ~ ( irel @ X46 @ X47 )
| ( irel @ X45 @ X47 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[trans_axiom])])]) ).
thf(c_0_29,negated_conjecture,
! [X49: $i,X51: $i,X53: $i] :
( ( ( a @ X49 )
| ~ ( irel @ esk1_0 @ X49 ) )
& ( ( b @ X49 )
| ~ ( irel @ esk1_0 @ X49 ) )
& ( irel @ esk1_0 @ esk2_0 )
& ( ~ ( irel @ esk2_0 @ X53 )
| ( b @ X53 )
| ~ ( irel @ esk2_0 @ X51 )
| ( a @ X51 ) )
& ( ( irel @ esk2_0 @ esk4_0 )
| ~ ( irel @ esk2_0 @ X51 )
| ( a @ X51 ) )
& ( ~ ( a @ esk4_0 )
| ~ ( irel @ esk2_0 @ X51 )
| ( a @ X51 ) )
& ( ~ ( irel @ esk2_0 @ X53 )
| ( b @ X53 )
| ( irel @ esk2_0 @ esk3_0 ) )
& ( ( irel @ esk2_0 @ esk4_0 )
| ( irel @ esk2_0 @ esk3_0 ) )
& ( ~ ( a @ esk4_0 )
| ( irel @ esk2_0 @ esk3_0 ) )
& ( ~ ( irel @ esk2_0 @ X53 )
| ( b @ X53 )
| ~ ( b @ esk3_0 ) )
& ( ( irel @ esk2_0 @ esk4_0 )
| ~ ( b @ esk3_0 ) )
& ( ~ ( a @ esk4_0 )
| ~ ( b @ esk3_0 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])])])])]) ).
thf(c_0_30,plain,
! [X1: $i,X2: $i,X3: $i] :
( ( irel @ X1 @ X3 )
| ~ ( irel @ X1 @ X2 )
| ~ ( irel @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_31,negated_conjecture,
( ( irel @ esk2_0 @ esk4_0 )
| ( irel @ esk2_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_32,negated_conjecture,
( ( irel @ esk2_0 @ esk3_0 )
| ~ ( a @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_33,negated_conjecture,
! [X1: $i] :
( ( a @ X1 )
| ~ ( irel @ esk1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_34,negated_conjecture,
! [X1: $i] :
( ( irel @ esk2_0 @ esk3_0 )
| ( irel @ X1 @ esk4_0 )
| ~ ( irel @ X1 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
thf(c_0_35,negated_conjecture,
irel @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_36,negated_conjecture,
( ( irel @ esk2_0 @ esk3_0 )
| ~ ( irel @ esk1_0 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
thf(c_0_37,negated_conjecture,
( ( irel @ esk2_0 @ esk4_0 )
| ~ ( b @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_38,negated_conjecture,
! [X1: $i] :
( ( b @ X1 )
| ~ ( irel @ esk1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_39,negated_conjecture,
irel @ esk2_0 @ esk3_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
thf(c_0_40,negated_conjecture,
( ~ ( a @ esk4_0 )
| ~ ( b @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_41,negated_conjecture,
( ( irel @ esk2_0 @ esk4_0 )
| ~ ( irel @ esk1_0 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
thf(c_0_42,negated_conjecture,
! [X1: $i] :
( ( irel @ X1 @ esk3_0 )
| ~ ( irel @ X1 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_30,c_0_39]) ).
thf(c_0_43,negated_conjecture,
( ~ ( irel @ esk1_0 @ esk3_0 )
| ~ ( a @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_40,c_0_38]) ).
thf(c_0_44,negated_conjecture,
irel @ esk2_0 @ esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_35])]) ).
thf(c_0_45,negated_conjecture,
( ~ ( irel @ esk1_0 @ esk3_0 )
| ~ ( irel @ esk1_0 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_43,c_0_33]) ).
thf(c_0_46,negated_conjecture,
! [X1: $i] :
( ( irel @ X1 @ esk4_0 )
| ~ ( irel @ X1 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_30,c_0_44]) ).
thf(c_0_47,negated_conjecture,
~ ( irel @ esk1_0 @ esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_35])]) ).
thf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_42]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN978^4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.17 % Computer : n001.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Tue Sep 29 16:25:20 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.24 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.tBHyciV9QA/E---3.1_1446982.p
% 0.08/0.28 % Version: 3.5.1-ho
% 0.08/0.28 % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.08/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.28 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.08/0.28 % Starting post_as_ho3 with 300s (1) cores
% 0.08/0.28 % Starting post_as_ho11 with 300s (1) cores
% 0.08/0.28 % Starting full_lambda_8 with 300s (1) cores
% 0.08/0.28 % post_as_ho3 with pid 1446996 completed with status 0
% 0.08/0.28 % Result found by post_as_ho3
% 0.08/0.28 % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.08/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.28 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.08/0.28 % Starting post_as_ho3 with 300s (1) cores
% 0.08/0.28 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.28 % No SInE strategy applied
% 0.08/0.28 % Search class: HGHNF-FFSF00-SHSSMFNN
% 0.08/0.28 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.28 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.28 % SubtermCWHack with pid 1446999 completed with status 0
% 0.08/0.28 % Result found by SubtermCWHack
% 0.08/0.28 % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.08/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.28 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.08/0.28 % Starting post_as_ho3 with 300s (1) cores
% 0.08/0.28 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.28 % No SInE strategy applied
% 0.08/0.28 % Search class: HGHNF-FFSF00-SHSSMFNN
% 0.08/0.28 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.28 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.28 % Preprocessing time : 0.001 s
% 0.08/0.28
% 0.08/0.28 % Proof found!
% 0.08/0.28 % SZS status Theorem
% 0.08/0.28 % SZS output start CNFRefutation
% See solution above
% 0.08/0.28 % Parsed axioms : 44
% 0.08/0.28 % Removed by relevancy pruning/SinE : 0
% 0.08/0.28 % Initial clauses : 36
% 0.08/0.28 % Removed in clause preprocessing : 22
% 0.08/0.28 % Initial clauses in saturation : 14
% 0.08/0.28 % Processed clauses : 37
% 0.08/0.28 % ...of these trivial : 0
% 0.08/0.28 % ...subsumed : 6
% 0.08/0.28 % ...remaining for further processing : 31
% 0.08/0.28 % Other redundant clauses eliminated : 0
% 0.08/0.28 % Clauses deleted for lack of memory : 0
% 0.08/0.28 % Backward-subsumed : 3
% 0.08/0.28 % Backward-rewritten : 9
% 0.08/0.28 % Generated clauses : 43
% 0.08/0.28 % ...of the previous two non-redundant : 33
% 0.08/0.28 % ...aggressively subsumed : 0
% 0.08/0.28 % Contextual simplify-reflections : 3
% 0.08/0.28 % Paramodulations : 43
% 0.08/0.28 % Factorizations : 0
% 0.08/0.28 % NegExts : 0
% 0.08/0.28 % Equation resolutions : 0
% 0.08/0.28 % Disequality decompositions : 0
% 0.08/0.28 % Total rewrite steps : 15
% 0.08/0.28 % ...of those cached : 11
% 0.08/0.28 % Propositional unsat checks : 0
% 0.08/0.28 % Propositional check models : 0
% 0.08/0.28 % Propositional check unsatisfiable : 0
% 0.08/0.28 % Propositional clauses : 0
% 0.08/0.28 % Propositional clauses after purity: 0
% 0.08/0.28 % Propositional unsat core size : 0
% 0.08/0.28 % Propositional preprocessing time : 0.000
% 0.08/0.28 % Propositional encoding time : 0.000
% 0.08/0.28 % Propositional solver time : 0.000
% 0.08/0.28 % Success case prop preproc time : 0.000
% 0.08/0.28 % Success case prop encoding time : 0.000
% 0.08/0.28 % Success case prop solver time : 0.000
% 0.08/0.28 % Current number of processed clauses : 19
% 0.08/0.28 % Positive orientable unit clauses : 4
% 0.08/0.28 % Positive unorientable unit clauses: 0
% 0.08/0.28 % Negative unit clauses : 1
% 0.08/0.28 % Non-unit-clauses : 14
% 0.08/0.28 % Current number of unprocessed clauses: 9
% 0.08/0.28 % ...number of literals in the above : 30
% 0.08/0.28 % Current number of archived formulas : 0
% 0.08/0.28 % Current number of archived clauses : 12
% 0.08/0.28 % Clause-clause subsumption calls (NU) : 29
% 0.08/0.28 % Rec. Clause-clause subsumption calls : 28
% 0.08/0.28 % Non-unit clause-clause subsumptions : 9
% 0.08/0.28 % Unit Clause-clause subsumption calls : 3
% 0.08/0.28 % Rewrite failures with RHS unbound : 0
% 0.08/0.28 % BW rewrite match attempts : 3
% 0.08/0.28 % BW rewrite match successes : 2
% 0.08/0.28 % Condensation attempts : 0
% 0.08/0.28 % Condensation successes : 0
% 0.08/0.28 % Termbank termtop insertions : 2644
% 0.08/0.28 % Search garbage collected termcells : 663
% 0.08/0.28
% 0.08/0.28 % -------------------------------------------------
% 0.08/0.28 % User time : 0.003 s
% 0.08/0.28 % System time : 0.002 s
% 0.08/0.28 % Total time : 0.006 s
% 0.08/0.28 % Maximum resident set size: 3664 pages
% 0.08/0.28
% 0.08/0.28 % -------------------------------------------------
% 0.08/0.28 % User time : 0.005 s
% 0.08/0.28 % System time : 0.008 s
% 0.08/0.28 % Total time : 0.013 s
% 0.08/0.28 % Maximum resident set size: 4864 pages
% 0.08/0.28 % E exiting
%------------------------------------------------------------------------------