%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRA028^1 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:49:52 AM UTC 2026
% Result : Theorem 5.75s 1.16s
% Output : CNFRefutation 5.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 2
% Syntax : Number of formulae : 27 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 99 ( 47 equ; 0 cnn)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 434 ( 73 ~; 122 |; 40 &; 189 @)
% ( 6 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 33 ( 12 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 127 ( 127 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 2 usr; 3 con; 0-2 aty)
% Number of variables : 115 ( 8 ^; 87 !; 20 ?; 115 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
epred1_0: ( $o > $o ) > ( $o > $o ) > $o ).
thf(decl_24,type,
epred2_0: ( $o > $o ) > $o ).
thf(ramsey_u_2_4_4,conjecture,
! [X1: ( $o > $o ) > ( $o > $o ) > $o] :
( ! [X2: $o > $o,X3: $o > $o] :
( ( X1 @ X2 @ X3 )
=> ( X1 @ X3 @ X2 ) )
=> ( ? [X4: $o > $o,X5: $o > $o,X6: ( $o > $o ) > $o] :
( ( X6 @ X4 )
& ~ ( X6 @ X5 )
& ( X1 @ X5 @ X4 ) )
| ? [X4: $o > $o,X5: $o > $o,X7: $o > $o,X8: $o > $o,X6: ( $o > $o ) > $o,X9: ( $o > $o ) > $o,X10: ( $o > $o ) > $o] :
( ( X6 @ X4 )
& ~ ( X6 @ X5 )
& ~ ( X6 @ X7 )
& ~ ( X6 @ X8 )
& ~ ( X9 @ X4 )
& ( X9 @ X5 )
& ~ ( X9 @ X7 )
& ~ ( X9 @ X8 )
& ~ ( X10 @ X4 )
& ~ ( X10 @ X5 )
& ( X10 @ X7 )
& ~ ( X10 @ X8 )
& ~ ( X1 @ X5 @ X4 )
& ~ ( X1 @ X7 @ X4 )
& ~ ( X1 @ X7 @ X5 )
& ~ ( X1 @ X8 @ X4 )
& ~ ( X1 @ X8 @ X5 )
& ~ ( X1 @ X8 @ X7 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Zfj0xGSQ60/E---3.1_1151637.p',ramsey_u_2_4_4) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: ( $o > $o ) > ( $o > $o ) > $o] :
( ! [X2: $o > $o,X3: $o > $o] :
( ( X1 @ X2 @ X3 )
=> ( X1 @ X3 @ X2 ) )
=> ( ? [X4: $o > $o,X5: $o > $o,X6: ( $o > $o ) > $o] :
( ( X6 @ X4 )
& ~ ( X6 @ X5 )
& ( X1 @ X5 @ X4 ) )
| ? [X4: $o > $o,X5: $o > $o,X7: $o > $o,X8: $o > $o,X6: ( $o > $o ) > $o,X9: ( $o > $o ) > $o,X10: ( $o > $o ) > $o] :
( ( X6 @ X4 )
& ~ ( X6 @ X5 )
& ~ ( X6 @ X7 )
& ~ ( X6 @ X8 )
& ~ ( X9 @ X4 )
& ( X9 @ X5 )
& ~ ( X9 @ X7 )
& ~ ( X9 @ X8 )
& ~ ( X10 @ X4 )
& ~ ( X10 @ X5 )
& ( X10 @ X7 )
& ~ ( X10 @ X8 )
& ~ ( X1 @ X5 @ X4 )
& ~ ( X1 @ X7 @ X4 )
& ~ ( X1 @ X7 @ X5 )
& ~ ( X1 @ X8 @ X4 )
& ~ ( X1 @ X8 @ X5 )
& ~ ( X1 @ X8 @ X7 ) ) ) ),
inference(assume_negation,[status(cth)],[ramsey_u_2_4_4]) ).
thf(c_0_2,negated_conjecture,
! [X25: $o > $o,X26: $o > $o,X27: $o > $o,X28: $o > $o,X29: ( $o > $o ) > $o,X30: $o > $o,X31: $o > $o,X32: $o > $o,X33: $o > $o,X34: ( $o > $o ) > $o,X35: ( $o > $o ) > $o,X36: ( $o > $o ) > $o] :
( ( ~ ( epred1_0 @ X25 @ X26 )
| ( epred1_0 @ X26 @ X25 ) )
& ( ~ ( X29 @ X27 )
| ( X29 @ X28 )
| ~ ( epred1_0 @ X28 @ X27 ) )
& ( ~ ( X34 @ X30 )
| ( X34 @ X31 )
| ( X34 @ X32 )
| ( X34 @ X33 )
| ( X35 @ X30 )
| ~ ( X35 @ X31 )
| ( X35 @ X32 )
| ( X35 @ X33 )
| ( X36 @ X30 )
| ( X36 @ X31 )
| ~ ( X36 @ X32 )
| ( X36 @ X33 )
| ( epred1_0 @ X31 @ X30 )
| ( epred1_0 @ X32 @ X30 )
| ( epred1_0 @ X32 @ X31 )
| ( epred1_0 @ X33 @ X30 )
| ( epred1_0 @ X33 @ X31 )
| ( epred1_0 @ X33 @ X32 ) ) ),
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_1])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X2: $o > $o,X3: $o > $o,X6: ( $o > $o ) > $o,X9: ( $o > $o ) > $o,X10: ( $o > $o ) > $o,X5: $o > $o,X4: $o > $o] :
( ( X6 @ X3 )
| ( X6 @ X4 )
| ( X6 @ X5 )
| ( X9 @ X2 )
| ( X9 @ X4 )
| ( X9 @ X5 )
| ( X10 @ X2 )
| ( X10 @ X3 )
| ( X10 @ X5 )
| ( epred1_0 @ X3 @ X2 )
| ( epred1_0 @ X4 @ X2 )
| ( epred1_0 @ X4 @ X3 )
| ( epred1_0 @ X5 @ X2 )
| ( epred1_0 @ X5 @ X3 )
| ( epred1_0 @ X5 @ X4 )
| ~ ( X6 @ X2 )
| ~ ( X9 @ X3 )
| ~ ( X10 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X6: ( $o > $o ) > $o,X3: $o > $o,X2: $o > $o] :
( ( X6 @ X3 )
| ~ ( X6 @ X2 )
| ~ ( epred1_0 @ X3 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,plain,
! [X37: $o > $o,X38: $o] :
( ( X37 @ ( epred2_0 @ X37 ) )
| ~ ( X37 @ X38 ) ),
inference(introduce_choice_axiom,[status(thm)],[]) ).
thf(c_0_6,negated_conjecture,
! [X2: $o > $o,X4: $o > $o,X3: $o > $o,X10: ( $o > $o ) > $o,X9: ( $o > $o ) > $o,X6: ( $o > $o ) > $o,X5: $o > $o] :
( ( X6 @ X2 )
| ( X6 @ X3 )
| ( X6 @ X4 )
| ( X9 @ X5 )
| ( X9 @ X3 )
| ( X9 @ X4 )
| ( X10 @ X5 )
| ( X10 @ X2 )
| ( X10 @ X4 )
| ~ ( X10 @ X3 )
| ~ ( X9 @ X2 )
| ~ ( X6 @ X5 ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_3,c_0_4]),c_0_4]),c_0_4]),c_0_4]),c_0_4]),c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X2: $o > $o,X38: $o] :
( ( X2 @ ( epred2_0 @ X2 ) )
| ~ ( X2 @ X38 ) ),
inference(choice_inst,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X3: $o > $o,X5: $o > $o,X9: ( $o > $o ) > $o,X6: ( $o > $o ) > $o,X4: $o > $o,X2: $o > $o] :
( ( X2 = X3 )
| ( X4 = X3 )
| ( X5 = X3 )
| ( X6 @ X4 )
| ( X6 @ X3 )
| ( X6 @ X5 )
| ( X9 @ X2 )
| ( X9 @ X3 )
| ( X9 @ X5 )
| ~ ( X9 @ X4 )
| ~ ( X6 @ X2 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X38: $o] :
( ( epred2_0
@ ^ [Z0: $o] : ( Z0 = X38 ) )
<=> X38 ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X2: $o > $o,X3: $o > $o,X6: ( $o > $o ) > $o,X5: $o > $o,X4: $o > $o] :
( ( X2 = X3 )
| ( X4 = X3 )
| ( X2 = X5 )
| ( X3 = X5 )
| ( X4 = X5 )
| ( X6 @ X2 )
| ( X6 @ X5 )
| ( X6 @ X3 )
| ~ ( X6 @ X4 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_8]) ).
thf(c_0_11,negated_conjecture,
~ ( epred2_0
@ ^ [Z0: $o] : ~ Z0 ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_9])]) ).
thf(c_0_12,negated_conjecture,
! [X3: $o > $o,X2: $o > $o,X4: $o > $o,X5: $o > $o] :
( ( X2 = X3 )
| ( X3 = X4 )
| ( X5 = X4 )
| ( X2 = X4 )
| ( X3 = X5 )
| ( X2 = X5 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_10]) ).
thf(c_0_13,negated_conjecture,
! [X2: $o > $o,X3: $o > $o,X4: $o > $o] :
( ( X2 = $not )
| ( $not = X3 )
| ( X4 = X3 )
| ( X2 = X3 )
| ( X4 = X2 )
| ~ ( epred2_0 @ X4 ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_14,negated_conjecture,
! [X2: $o > $o,X3: $o > $o,X469: $o,X4: $o > $o] :
( ( ( X2 @ X469 )
<=> ~ X469 )
| ( $not = X3 )
| ( X4 = X2 )
| ( X2 = X3 )
| ( X4 = X3 )
| ~ ( epred2_0 @ X4 ) ),
inference(arg_cong,[status(thm)],[c_0_13]) ).
thf(c_0_15,negated_conjecture,
! [X2: $o > $o,X4: $o > $o,X3: $o > $o] :
( ( $not = X2 )
| ( X3 = X2 )
| ( X4 = X2 )
| ( X3 = X4 )
| ( X4 @ ~ $true )
| ~ ( epred2_0 @ X3 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_14]) ).
thf(c_0_16,negated_conjecture,
( epred2_0
@ ^ [Z0: $o] : Z0 ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_9])]) ).
thf(c_0_17,negated_conjecture,
! [X3: $o > $o,X2: $o > $o] :
( ( ( ^ [Z0: $o] : Z0 )
= X2 )
| ( ( ^ [Z0: $o] : Z0 )
= X3 )
| ( $not = X3 )
| ( X2 = X3 )
| ( X2 @ ~ $true ) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_18,negated_conjecture,
! [X1039: $o,X3: $o > $o,X2: $o > $o] :
( ( $not = X3 )
| ( ( ^ [Z0: $o] : Z0 )
= X3 )
| ( X1039
<=> ( X2 @ X1039 ) )
| ( X2 = X3 )
| ( X2 @ ~ $true ) ),
inference(arg_cong,[status(thm)],[c_0_17]) ).
thf(c_0_19,negated_conjecture,
! [X2: $o > $o,X3: $o > $o] :
( ( ( ^ [Z0: $o] : Z0 )
= X2 )
| ( $not = X2 )
| ( X3 = X2 )
| ( X3 @ ~ $true )
| ( X3 @ $true ) ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_18])]) ).
thf(c_0_20,negated_conjecture,
! [X2: $o > $o,X3: $o > $o] :
( ( $not = X2 )
| ( ( ^ [Z0: $o] : Z0 )
= X2 )
| ( X3 = X2 )
| ( X3 @ ( epred2_0 @ X3 ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_19]),c_0_7]) ).
thf(c_0_21,negated_conjecture,
! [X2: $o > $o,X1589: $o,X3: $o > $o] :
( ( $not = X2 )
| ( X1589
<=> ( X2 @ X1589 ) )
| ( X3 = X2 )
| ( X3 @ ( epred2_0 @ X3 ) ) ),
inference(arg_cong,[status(thm)],[c_0_20]) ).
thf(c_0_22,negated_conjecture,
! [X3: $o > $o,X2: $o > $o] :
( ( $not = X2 )
| ( X3 = X2 )
| ( X3 @ ( epred2_0 @ X3 ) )
| ~ ( X2 @ ~ $true ) ),
inference(dynamic_cnf,[status(thm)],[c_0_21]) ).
thf(c_0_23,negated_conjecture,
! [X1607: $o,X3: $o > $o,X2: $o > $o] :
( ( ~ X1607
<=> ( X2 @ X1607 ) )
| ( X3 = X2 )
| ( X3 @ ( epred2_0 @ X3 ) )
| ~ ( X2 @ ~ $true ) ),
inference(arg_cong,[status(thm)],[c_0_22]) ).
thf(c_0_24,negated_conjecture,
! [X2: $o > $o,X3: $o > $o] :
( ( X2 = X3 )
| ( X2 @ ( epred2_0 @ X2 ) )
| ~ ( X3 @ $true )
| ~ ( X3 @ ~ $true ) ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_23])]) ).
thf(c_0_25,negated_conjecture,
! [X2: $o > $o,X1644: $o,X3: $o > $o] :
( ( ( X2 @ X1644 )
<=> ( X3 @ X1644 ) )
| ( X2 @ ( epred2_0 @ X2 ) )
| ~ ( X3 @ $true )
| ~ ( X3 @ ~ $true ) ),
inference(arg_cong,[status(thm)],[c_0_24]) ).
thf(c_0_26,negated_conjecture,
$false,
inference(flex_resolve,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_25])])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRA028^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.17 % Computer : n006.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 18:38:24 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.Zfj0xGSQ60/E---3.1_1151637.p
% 5.75/1.16 % Version: 3.5.1-ho
% 5.75/1.16 % Preprocessing class: HSMSSMSSSSSNHHA.
% 5.75/1.16 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 5.75/1.16 % Starting full_lambda_6 with 900s (3) cores
% 5.75/1.16 % Starting post_as_ho1 with 300s (1) cores
% 5.75/1.16 % Starting lpo6_lambda_fix with 300s (1) cores
% 5.75/1.16 % Starting ho_unfolding_1 with 300s (1) cores
% 5.75/1.16 % Starting new_ho_10_unif with 300s (1) cores
% 5.75/1.16 % Starting ho_unfolding_2 with 300s (1) cores
% 5.75/1.16 % lpo6_lambda_fix with pid 1151672 completed with status 0
% 5.75/1.16 % Result found by lpo6_lambda_fix
% 5.75/1.16 % Preprocessing class: HSMSSMSSSSSNHHA.
% 5.75/1.16 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 5.75/1.16 % Starting full_lambda_6 with 900s (3) cores
% 5.75/1.16 % Starting post_as_ho1 with 300s (1) cores
% 5.75/1.16 % Starting lpo6_lambda_fix with 300s (1) cores
% 5.75/1.16 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = Auto)
% 5.75/1.16 % No SInE strategy applied
% 5.75/1.16 % Search class: HGUNF-FFSF00-SHHFFMBN
% 5.75/1.16 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 5.75/1.16 % Starting SubtermCWHack with 28s (1) cores
% 5.75/1.16 % SubtermCWHack with pid 1151680 completed with status 10
% 5.75/1.16 % Starting lpo6_lambda_fix with 31s (1) cores
% 5.75/1.16 % lpo6_lambda_fix with pid 1151691 completed with status 10
% 5.75/1.16 % Starting ehoh_best_sine with 28s (1) cores
% 5.75/1.16 % ehoh_best_sine with pid 1151728 completed with status 10
% 5.75/1.16 % Starting ehoh_best_nonlift_nonlambdatoforall with 28s (1) cores
% 5.75/1.16 % ehoh_best_nonlift_nonlambdatoforall with pid 1151744 completed with status 10
% 5.75/1.16 % Starting sh2lt with 28s (1) cores
% 5.75/1.16 % sh2lt with pid 1151757 completed with status 10
% 5.75/1.16 % Starting sh2l with 28s (1) cores
% 5.75/1.16 % sh2l with pid 1151772 completed with status 10
% 5.75/1.16 % Starting ehoh_best6_lambda with 129s (1) cores
% 5.75/1.16 % ehoh_best6_lambda with pid 1151782 completed with status 0
% 5.75/1.16 % Result found by ehoh_best6_lambda
% 5.75/1.16 % Preprocessing class: HSMSSMSSSSSNHHA.
% 5.75/1.16 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 5.75/1.16 % Starting full_lambda_6 with 900s (3) cores
% 5.75/1.16 % Starting post_as_ho1 with 300s (1) cores
% 5.75/1.16 % Starting lpo6_lambda_fix with 300s (1) cores
% 5.75/1.16 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = Auto)
% 5.75/1.16 % No SInE strategy applied
% 5.75/1.16 % Search class: HGUNF-FFSF00-SHHFFMBN
% 5.75/1.16 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 5.75/1.16 % Starting SubtermCWHack with 28s (1) cores
% 5.75/1.16 % SubtermCWHack with pid 1151680 completed with status 10
% 5.75/1.16 % Starting lpo6_lambda_fix with 31s (1) cores
% 5.75/1.16 % lpo6_lambda_fix with pid 1151691 completed with status 10
% 5.75/1.16 % Starting ehoh_best_sine with 28s (1) cores
% 5.75/1.16 % ehoh_best_sine with pid 1151728 completed with status 10
% 5.75/1.16 % Starting ehoh_best_nonlift_nonlambdatoforall with 28s (1) cores
% 5.75/1.16 % ehoh_best_nonlift_nonlambdatoforall with pid 1151744 completed with status 10
% 5.75/1.16 % Starting sh2lt with 28s (1) cores
% 5.75/1.16 % sh2lt with pid 1151757 completed with status 10
% 5.75/1.16 % Starting sh2l with 28s (1) cores
% 5.75/1.16 % sh2l with pid 1151772 completed with status 10
% 5.75/1.16 % Starting ehoh_best6_lambda with 129s (1) cores
% 5.75/1.16 % Preprocessing time : 0.001 s
% 5.75/1.16 % Presaturation interreduction done
% 5.75/1.16
% 5.75/1.16 % Proof found!
% 5.75/1.16 % SZS status Theorem
% 5.75/1.16 % SZS output start CNFRefutation
% See solution above
% 5.75/1.16 % Parsed axioms : 1
% 5.75/1.16 % Removed by relevancy pruning/SinE : 0
% 5.75/1.16 % Initial clauses : 3
% 5.75/1.16 % Removed in clause preprocessing : 0
% 5.75/1.16 % Initial clauses in saturation : 3
% 5.75/1.16 % Processed clauses : 769
% 5.75/1.16 % ...of these trivial : 19
% 5.75/1.16 % ...subsumed : 196
% 5.75/1.16 % ...remaining for further processing : 553
% 5.75/1.16 % Other redundant clauses eliminated : 1592
% 5.75/1.16 % Clauses deleted for lack of memory : 0
% 5.75/1.16 % Backward-subsumed : 74
% 5.75/1.16 % Backward-rewritten : 0
% 5.75/1.16 % Generated clauses : 11835
% 5.75/1.16 % ...of the previous two non-redundant : 4367
% 5.75/1.16 % ...aggressively subsumed : 0
% 5.75/1.16 % Contextual simplify-reflections : 16
% 5.75/1.16 % Paramodulations : 8654
% 5.75/1.16 % Factorizations : 463
% 5.75/1.16 % NegExts : 115
% 5.75/1.16 % Equation resolutions : 1592
% 5.75/1.16 % Disequality decompositions : 0
% 5.75/1.16 % Total rewrite steps : 2938
% 5.75/1.16 % ...of those cached : 2937
% 5.75/1.16 % Propositional unsat checks : 0
% 5.75/1.16 % Propositional check models : 0
% 5.75/1.16 % Propositional check unsatisfiable : 0
% 5.75/1.16 % Propositional clauses : 0
% 5.75/1.16 % Propositional clauses after purity: 0
% 5.75/1.16 % Propositional unsat core size : 0
% 5.75/1.16 % Propositional preprocessing time : 0.000
% 5.75/1.16 % Propositional encoding time : 0.000
% 5.75/1.16 % Propositional solver time : 0.000
% 5.75/1.16 % Success case prop preproc time : 0.000
% 5.75/1.16 % Success case prop encoding time : 0.000
% 5.75/1.16 % Success case prop solver time : 0.000
% 5.75/1.16 % Current number of processed clauses : 156
% 5.75/1.16 % Positive orientable unit clauses : 2
% 5.75/1.16 % Positive unorientable unit clauses: 0
% 5.75/1.16 % Negative unit clauses : 1
% 5.75/1.16 % Non-unit-clauses : 153
% 5.75/1.16 % Current number of unprocessed clauses: 3601
% 5.75/1.16 % ...number of literals in the above : 30557
% 5.75/1.16 % Current number of archived formulas : 0
% 5.75/1.16 % Current number of archived clauses : 398
% 5.75/1.16 % Clause-clause subsumption calls (NU) : 13278
% 5.75/1.16 % Rec. Clause-clause subsumption calls : 1267
% 5.75/1.16 % Non-unit clause-clause subsumptions : 285
% 5.75/1.16 % Unit Clause-clause subsumption calls : 7
% 5.75/1.16 % Rewrite failures with RHS unbound : 0
% 5.75/1.16 % BW rewrite match attempts : 1
% 5.75/1.16 % BW rewrite match successes : 1
% 5.75/1.16 % Condensation attempts : 0
% 5.75/1.16 % Condensation successes : 0
% 5.75/1.16 % Termbank termtop insertions : 461405
% 5.75/1.16 % Search garbage collected termcells : 415
% 5.75/1.16
% 5.75/1.16 % -------------------------------------------------
% 5.75/1.16 % User time : 0.859 s
% 5.75/1.16 % System time : 0.036 s
% 5.75/1.16 % Total time : 0.896 s
% 5.75/1.16 % Maximum resident set size: 3592 pages
% 5.75/1.16
% 5.75/1.16 % -------------------------------------------------
% 5.75/1.16 % User time : 0.860 s
% 5.75/1.16 % System time : 0.043 s
% 5.75/1.16 % Total time : 0.902 s
% 5.75/1.16 % Maximum resident set size: 4864 pages
% 5.75/1.16 % E exiting
%------------------------------------------------------------------------------