%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ALG258^2 : TPTP v9.3.1. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:46 AM UTC 2026
% Result : Theorem 0.20s 0.33s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 24 unt; 0 typ; 0 def)
% Number of atoms : 75 ( 61 equ; 0 cnn)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 362 ( 7 ~; 3 |; 6 &; 316 @)
% ( 6 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 17 usr; 11 con; 0-2 aty)
% Number of variables : 121 ( 14 ^; 107 !; 0 ?; 121 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
term: $tType ).
thf(decl_sort2,type,
subst: $tType ).
thf(decl_23,type,
one: term ).
thf(decl_25,type,
lam: term > term ).
thf(decl_26,type,
sub: term > subst > term ).
thf(decl_27,type,
id: subst ).
thf(decl_28,type,
sh: subst ).
thf(decl_29,type,
push: term > subst > subst ).
thf(decl_30,type,
comp: subst > subst > subst ).
thf(decl_54,type,
hoaslaminj: $o ).
thf(decl_92,type,
hoaslaminj_lthm: $o ).
thf(decl_93,type,
axvarcons: $o ).
thf(decl_94,type,
hoaslam: subst > ( subst > term > term ) > term ).
thf(decl_99,type,
laminj: $o ).
thf(decl_137,type,
axshiftcons: $o ).
thf(decl_145,type,
esk1_0: subst > term > term ).
thf(decl_146,type,
esk2_0: subst > term > term ).
thf(decl_147,type,
esk3_0: subst ).
thf(decl_148,type,
esk4_0: term ).
thf(hoaslaminj,axiom,
( hoaslaminj
<=> ! [X12: subst > term > term] :
( ! [X3: subst,X1: term,X4: subst] :
( ( sub @ ( X12 @ X3 @ X1 ) @ X4 )
= ( X12 @ ( comp @ X3 @ X4 ) @ ( sub @ X1 @ X4 ) ) )
=> ! [X13: subst > term > term] :
( ! [X3: subst,X1: term,X4: subst] :
( ( sub @ ( X13 @ X3 @ X1 ) @ X4 )
= ( X13 @ ( comp @ X3 @ X4 ) @ ( sub @ X1 @ X4 ) ) )
=> ( ( ( hoaslam @ id
@ ^ [X3: subst,X1: term] : ( X12 @ X3 @ X1 ) )
= ( hoaslam @ id
@ ^ [X3: subst,X1: term] : ( X13 @ X3 @ X1 ) ) )
=> ! [X3: subst,X1: term] :
( ( X12 @ X3 @ X1 )
= ( X13 @ X3 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.qq82LIRGeA/E---3.1_643084.p',hoaslaminj) ).
thf(thm,conjecture,
hoaslaminj_lthm,
file('/export/starexec/sandbox/tmp/tmp.qq82LIRGeA/E---3.1_643084.p',thm) ).
thf(hoaslaminj_lthm,axiom,
( hoaslaminj_lthm
<=> ( axvarcons
=> ( axshiftcons
=> ( laminj
=> hoaslaminj ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.qq82LIRGeA/E---3.1_643084.p',hoaslaminj_lthm) ).
thf(axvarcons,axiom,
( axvarcons
<=> ! [X1: term,X3: subst] :
( ( sub @ one @ ( push @ X1 @ X3 ) )
= X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.qq82LIRGeA/E---3.1_643084.p',axvarcons) ).
thf(axshiftcons,axiom,
( axshiftcons
<=> ! [X1: term,X3: subst] :
( ( comp @ sh @ ( push @ X1 @ X3 ) )
= X3 ) ),
file('/export/starexec/sandbox/tmp/tmp.qq82LIRGeA/E---3.1_643084.p',axshiftcons) ).
thf(laminj,axiom,
( laminj
<=> ! [X1: term,X2: term] :
( ( ( lam @ X1 )
= ( lam @ X2 ) )
=> ( X1 = X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.qq82LIRGeA/E---3.1_643084.p',laminj) ).
thf(hoaslam,axiom,
( hoaslam
= ( ^ [X3: subst,X12: subst > term > term] : ( lam @ ( X12 @ sh @ one ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.qq82LIRGeA/E---3.1_643084.p',hoaslam) ).
thf(c_0_7,plain,
( hoaslaminj
<=> ! [X12: subst > term > term] :
( ! [X3: subst,X1: term,X4: subst] :
( ( sub @ ( X12 @ X3 @ X1 ) @ X4 )
= ( X12 @ ( comp @ X3 @ X4 ) @ ( sub @ X1 @ X4 ) ) )
=> ! [X13: subst > term > term] :
( ! [X3: subst,X1: term,X4: subst] :
( ( sub @ ( X13 @ X3 @ X1 ) @ X4 )
= ( X13 @ ( comp @ X3 @ X4 ) @ ( sub @ X1 @ X4 ) ) )
=> ( ( ( hoaslam @ id
@ ^ [Z0: subst,Z1: term] : ( X12 @ Z0 @ Z1 ) )
= ( hoaslam @ id
@ ^ [Z0: subst,Z1: term] : ( X13 @ Z0 @ Z1 ) ) )
=> ! [X3: subst,X1: term] :
( ( X12 @ X3 @ X1 )
= ( X13 @ X3 @ X1 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[hoaslaminj]) ).
thf(c_0_8,negated_conjecture,
~ hoaslaminj_lthm,
inference(assume_negation,[status(cth)],[thm]) ).
thf(c_0_9,axiom,
( hoaslaminj_lthm
= ( ! [X1897: term,X1898: subst] :
( ( sub @ one @ ( push @ X1897 @ X1898 ) )
= X1897 )
=> ( ! [X1899: term,X1900: subst] :
( ( comp @ sh @ ( push @ X1899 @ X1900 ) )
= X1900 )
=> ( ! [X1901: term,X1902: term] :
( ( ( lam @ X1901 )
= ( lam @ X1902 ) )
=> ( X1901 = X1902 ) )
=> ! [X1903: subst > term > term] :
( ! [X1904: subst,X1905: term,X1906: subst] :
( ( sub @ ( X1903 @ X1904 @ X1905 ) @ X1906 )
= ( X1903 @ ( comp @ X1904 @ X1906 ) @ ( sub @ X1905 @ X1906 ) ) )
=> ! [X1907: subst > term > term] :
( ! [X1908: subst,X1909: term,X1910: subst] :
( ( sub @ ( X1907 @ X1908 @ X1909 ) @ X1910 )
= ( X1907 @ ( comp @ X1908 @ X1910 ) @ ( sub @ X1909 @ X1910 ) ) )
=> ( ( ( hoaslam @ id
@ ^ [Z0: subst,Z1: term] : ( X1903 @ Z0 @ Z1 ) )
= ( hoaslam @ id
@ ^ [Z0: subst,Z1: term] : ( X1907 @ Z0 @ Z1 ) ) )
=> ! [X1911: subst,X1912: term] :
( ( X1903 @ X1911 @ X1912 )
= ( X1907 @ X1911 @ X1912 ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[hoaslaminj_lthm,axvarcons]),axshiftcons]),laminj]),c_0_7]) ).
thf(c_0_10,plain,
! [X3393: subst,X3394: subst > term > term] :
( ( hoaslam @ X3393 @ X3394 )
= ( lam @ ( X3394 @ sh @ one ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[hoaslam])]) ).
thf(c_0_11,negated_conjecture,
~ ( ! [X3373: term,X3374: subst] :
( ( sub @ one @ ( push @ X3373 @ X3374 ) )
= X3373 )
=> ( ! [X3375: term,X3376: subst] :
( ( comp @ sh @ ( push @ X3375 @ X3376 ) )
= X3376 )
=> ( ! [X3377: term,X3378: term] :
( ( ( lam @ X3377 )
= ( lam @ X3378 ) )
=> ( X3377 = X3378 ) )
=> ! [X3379: subst > term > term] :
( ! [X3380: subst,X3381: term,X3382: subst] :
( ( sub @ ( X3379 @ X3380 @ X3381 ) @ X3382 )
= ( X3379 @ ( comp @ X3380 @ X3382 ) @ ( sub @ X3381 @ X3382 ) ) )
=> ! [X3383: subst > term > term] :
( ! [X3384: subst,X3385: term,X3386: subst] :
( ( sub @ ( X3383 @ X3384 @ X3385 ) @ X3386 )
= ( X3383 @ ( comp @ X3384 @ X3386 ) @ ( sub @ X3385 @ X3386 ) ) )
=> ( ( ( hoaslam @ id @ X3379 )
= ( hoaslam @ id @ X3383 ) )
=> ! [X3387: subst,X3388: term] :
( ( X3379 @ X3387 @ X3388 )
= ( X3383 @ X3387 @ X3388 ) ) ) ) ) ) ) ),
inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[c_0_8,c_0_9])]) ).
thf(c_0_12,plain,
! [X3399: subst,X3400: subst > term > term] :
( ( hoaslam @ X3399 @ X3400 )
= ( lam @ ( X3400 @ sh @ one ) ) ),
inference(variable_rename,[status(thm)],[c_0_10]) ).
thf(c_0_13,negated_conjecture,
! [X3401: term,X3402: subst,X3403: term,X3404: subst,X3405: term,X3406: term,X3408: subst,X3409: term,X3410: subst,X3412: subst,X3413: term,X3414: subst] :
( ( ( sub @ one @ ( push @ X3401 @ X3402 ) )
= X3401 )
& ( ( comp @ sh @ ( push @ X3403 @ X3404 ) )
= X3404 )
& ( ( ( lam @ X3405 )
!= ( lam @ X3406 ) )
| ( X3405 = X3406 ) )
& ( ( sub @ ( esk1_0 @ X3408 @ X3409 ) @ X3410 )
= ( esk1_0 @ ( comp @ X3408 @ X3410 ) @ ( sub @ X3409 @ X3410 ) ) )
& ( ( sub @ ( esk2_0 @ X3412 @ X3413 ) @ X3414 )
= ( esk2_0 @ ( comp @ X3412 @ X3414 ) @ ( sub @ X3413 @ X3414 ) ) )
& ( ( hoaslam @ id @ esk1_0 )
= ( hoaslam @ id @ esk2_0 ) )
& ( ( esk1_0 @ esk3_0 @ esk4_0 )
!= ( esk2_0 @ esk3_0 @ esk4_0 ) ) ),
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_11])])])])]) ).
thf(c_0_14,plain,
! [X3: subst,X12: subst > term > term] :
( ( hoaslam @ X3 @ X12 )
= ( lam @ ( X12 @ sh @ one ) ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_15,negated_conjecture,
( ( hoaslam @ id @ esk1_0 )
= ( hoaslam @ id @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_16,plain,
! [X3: subst,X4: subst,X12: subst > term > term] :
( ( hoaslam @ X3 @ X12 )
= ( hoaslam @ X4 @ X12 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_14]) ).
thf(c_0_17,negated_conjecture,
! [X3: subst] :
( ( hoaslam @ X3 @ esk1_0 )
= ( hoaslam @ id @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_18,negated_conjecture,
! [X3: subst,X4: subst] :
( ( hoaslam @ X3 @ esk1_0 )
= ( hoaslam @ X4 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_19,negated_conjecture,
! [X1: term,X2: term] :
( ( X1 = X2 )
| ( ( lam @ X1 )
!= ( lam @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_20,negated_conjecture,
! [X3: subst] :
( ( hoaslam @ X3 @ esk1_0 )
= ( lam @ ( esk2_0 @ sh @ one ) ) ),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
thf(c_0_21,negated_conjecture,
! [X1: term,X3: subst,X4: subst] :
( ( sub @ ( esk1_0 @ X3 @ X1 ) @ X4 )
= ( esk1_0 @ ( comp @ X3 @ X4 ) @ ( sub @ X1 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_22,negated_conjecture,
! [X3: subst,X1: term] :
( ( sub @ one @ ( push @ X1 @ X3 ) )
= X1 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_23,negated_conjecture,
! [X3: subst,X1: term] :
( ( ( esk2_0 @ sh @ one )
= X1 )
| ( ( hoaslam @ X3 @ esk1_0 )
!= ( lam @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_24,negated_conjecture,
( ( lam @ ( esk1_0 @ sh @ one ) )
= ( lam @ ( esk2_0 @ sh @ one ) ) ),
inference(spm,[status(thm)],[c_0_14,c_0_20]) ).
thf(c_0_25,negated_conjecture,
! [X1: term,X3: subst,X4: subst] :
( ( sub @ ( esk2_0 @ X3 @ X1 ) @ X4 )
= ( esk2_0 @ ( comp @ X3 @ X4 ) @ ( sub @ X1 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_26,negated_conjecture,
! [X1: term,X3: subst,X4: subst] :
( ( esk1_0 @ ( comp @ X3 @ ( push @ X1 @ X4 ) ) @ X1 )
= ( sub @ ( esk1_0 @ X3 @ one ) @ ( push @ X1 @ X4 ) ) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_27,negated_conjecture,
! [X1: term,X3: subst] :
( ( comp @ sh @ ( push @ X1 @ X3 ) )
= X3 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_28,negated_conjecture,
( ( esk1_0 @ sh @ one )
= ( esk2_0 @ sh @ one ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_20]) ).
thf(c_0_29,negated_conjecture,
! [X1: term,X3: subst,X4: subst] :
( ( esk2_0 @ ( comp @ X3 @ ( push @ X1 @ X4 ) ) @ X1 )
= ( sub @ ( esk2_0 @ X3 @ one ) @ ( push @ X1 @ X4 ) ) ),
inference(spm,[status(thm)],[c_0_25,c_0_22]) ).
thf(c_0_30,negated_conjecture,
! [X3: subst,X1: term] :
( ( sub @ ( esk2_0 @ sh @ one ) @ ( push @ X1 @ X3 ) )
= ( esk1_0 @ X3 @ X1 ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
thf(c_0_31,negated_conjecture,
( ( esk1_0 @ esk3_0 @ esk4_0 )
!= ( esk2_0 @ esk3_0 @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_32,negated_conjecture,
! [X3: subst,X1: term] :
( ( esk1_0 @ X3 @ X1 )
= ( esk2_0 @ X3 @ X1 ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_27]),c_0_30]) ).
thf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ALG258^2 : TPTP v9.3.1. Bugfixed v5.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n017.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 17:29:18 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.20/0.27 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.qq82LIRGeA/E---3.1_643084.p
% 0.20/0.33 % Version: 3.5.1-ho
% 0.20/0.33 % Preprocessing class: HSMMSLSSLLLNHFA.
% 0.20/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.33 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.20/0.33 % Starting post_as_ho1 with 300s (1) cores
% 0.20/0.33 % Starting post_as_ho5 with 300s (1) cores
% 0.20/0.33 % Starting post_as_ho10 with 300s (1) cores
% 0.20/0.33 % post_as_ho1 with pid 643134 completed with status 0
% 0.20/0.33 % Result found by post_as_ho1
% 0.20/0.33 % Preprocessing class: HSMMSLSSLLLNHFA.
% 0.20/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.33 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.20/0.33 % Starting post_as_ho1 with 300s (1) cores
% 0.20/0.33 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.33 % No SInE strategy applied
% 0.20/0.33 % Search class: HHUPM-FFSF32-SHFMMFNN
% 0.20/0.33 % partial match(1): HHUPS-FFSF32-SHFMMFNN
% 0.20/0.33 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.33 % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.33 % SubtermCWHack with pid 643142 completed with status 0
% 0.20/0.33 % Result found by SubtermCWHack
% 0.20/0.33 % Preprocessing class: HSMMSLSSLLLNHFA.
% 0.20/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.33 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.20/0.33 % Starting post_as_ho1 with 300s (1) cores
% 0.20/0.33 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.33 % No SInE strategy applied
% 0.20/0.33 % Search class: HHUPM-FFSF32-SHFMMFNN
% 0.20/0.33 % partial match(1): HHUPS-FFSF32-SHFMMFNN
% 0.20/0.33 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.33 % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.33 % Preprocessing time : 0.001 s
% 0.20/0.33
% 0.20/0.33 % Proof found!
% 0.20/0.33 % SZS status Theorem
% 0.20/0.33 % SZS output start CNFRefutation
% See solution above
% 0.20/0.33 % Parsed axioms : 238
% 0.20/0.33 % Removed by relevancy pruning/SinE : 0
% 0.20/0.33 % Initial clauses : 133
% 0.20/0.33 % Removed in clause preprocessing : 124
% 0.20/0.33 % Initial clauses in saturation : 9
% 0.20/0.33 % Processed clauses : 67
% 0.20/0.33 % ...of these trivial : 0
% 0.20/0.33 % ...subsumed : 42
% 0.20/0.33 % ...remaining for further processing : 25
% 0.20/0.33 % Other redundant clauses eliminated : 0
% 0.20/0.33 % Clauses deleted for lack of memory : 0
% 0.20/0.33 % Backward-subsumed : 1
% 0.20/0.33 % Backward-rewritten : 9
% 0.20/0.33 % Generated clauses : 97
% 0.20/0.33 % ...of the previous two non-redundant : 96
% 0.20/0.33 % ...aggressively subsumed : 0
% 0.20/0.33 % Contextual simplify-reflections : 0
% 0.20/0.33 % Paramodulations : 96
% 0.20/0.33 % Factorizations : 0
% 0.20/0.33 % NegExts : 0
% 0.20/0.33 % Equation resolutions : 1
% 0.20/0.33 % Disequality decompositions : 0
% 0.20/0.33 % Total rewrite steps : 26
% 0.20/0.33 % ...of those cached : 10
% 0.20/0.33 % Propositional unsat checks : 0
% 0.20/0.33 % Propositional check models : 0
% 0.20/0.33 % Propositional check unsatisfiable : 0
% 0.20/0.33 % Propositional clauses : 0
% 0.20/0.33 % Propositional clauses after purity: 0
% 0.20/0.33 % Propositional unsat core size : 0
% 0.20/0.33 % Propositional preprocessing time : 0.000
% 0.20/0.33 % Propositional encoding time : 0.000
% 0.20/0.33 % Propositional solver time : 0.000
% 0.20/0.33 % Success case prop preproc time : 0.000
% 0.20/0.33 % Success case prop encoding time : 0.000
% 0.20/0.33 % Success case prop solver time : 0.000
% 0.20/0.33 % Current number of processed clauses : 15
% 0.20/0.33 % Positive orientable unit clauses : 6
% 0.20/0.33 % Positive unorientable unit clauses: 6
% 0.20/0.33 % Negative unit clauses : 0
% 0.20/0.33 % Non-unit-clauses : 3
% 0.20/0.33 % Current number of unprocessed clauses: 27
% 0.20/0.33 % ...number of literals in the above : 44
% 0.20/0.33 % Current number of archived formulas : 0
% 0.20/0.33 % Current number of archived clauses : 10
% 0.20/0.33 % Clause-clause subsumption calls (NU) : 14
% 0.20/0.33 % Rec. Clause-clause subsumption calls : 14
% 0.20/0.33 % Non-unit clause-clause subsumptions : 9
% 0.20/0.33 % Unit Clause-clause subsumption calls : 3
% 0.20/0.33 % Rewrite failures with RHS unbound : 117
% 0.20/0.33 % BW rewrite match attempts : 29
% 0.20/0.33 % BW rewrite match successes : 26
% 0.20/0.33 % Condensation attempts : 0
% 0.20/0.33 % Condensation successes : 0
% 0.20/0.33 % Termbank termtop insertions : 27670
% 0.20/0.33 % Search garbage collected termcells : 1829
% 0.20/0.33
% 0.20/0.33 % -------------------------------------------------
% 0.20/0.33 % User time : 0.029 s
% 0.20/0.33 % System time : 0.007 s
% 0.20/0.33 % Total time : 0.036 s
% 0.20/0.33 % Maximum resident set size: 7564 pages
% 0.20/0.33
% 0.20/0.33 % -------------------------------------------------
% 0.20/0.33 % User time : 0.038 s
% 0.20/0.33 % System time : 0.012 s
% 0.20/0.33 % Total time : 0.049 s
% 0.20/0.33 % Maximum resident set size: 4864 pages
% 0.20/0.33 % E exiting
%------------------------------------------------------------------------------