%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU493^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 : n020.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:26:18 AM UTC 2026
% Result : Theorem 0.33s 0.43s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 47 ( 19 unt; 0 typ; 0 def)
% Number of atoms : 140 ( 30 equ; 0 cnn)
% Maximal formula atoms : 34 ( 2 avg)
% Number of connectives : 421 ( 51 ~; 59 |; 33 &; 263 @)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 28 ( 28 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 69 ( 15 ^; 54 !; 0 ?; 69 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_24,type,
inv: ( $i > $i > $o ) > $i > $i > $o ).
thf(decl_28,type,
refl: ( $i > $i > $o ) > $o ).
thf(decl_32,type,
antisymm: ( $i > $i > $o ) > $o ).
thf(decl_35,type,
trans: ( $i > $i > $o ) > $o ).
thf(decl_39,type,
po: ( $i > $i > $o ) > $o ).
thf(decl_52,type,
epred1_0: $i > $i > $o ).
thf(decl_53,type,
esk1_0: $i ).
thf(decl_54,type,
esk2_0: $i ).
thf(decl_55,type,
esk3_0: $i ).
thf(decl_56,type,
esk4_0: $i ).
thf(decl_57,type,
esk5_0: $i ).
thf(decl_58,type,
esk6_0: $i ).
thf(partial_order,axiom,
( po
= ( ^ [X1: $i > $i > $o] :
( ( refl @ X1 )
& ( antisymm @ X1 )
& ( trans @ X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6HHwgrrF8v/E---3.1_1073717.p',partial_order) ).
thf(reflexive,axiom,
( refl
= ( ^ [X1: $i > $i > $o] :
! [X3: $i] : ( X1 @ X3 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6HHwgrrF8v/E---3.1_1073717.p',reflexive) ).
thf(antisymmetric,axiom,
( antisymm
= ( ^ [X1: $i > $i > $o] :
! [X3: $i,X4: $i] :
( ( ( X1 @ X3 @ X4 )
& ( X1 @ X4 @ X3 ) )
=> ( X3 = X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6HHwgrrF8v/E---3.1_1073717.p',antisymmetric) ).
thf(transitive,axiom,
( trans
= ( ^ [X1: $i > $i > $o] :
! [X3: $i,X4: $i,X6: $i] :
( ( ( X1 @ X3 @ X4 )
& ( X1 @ X4 @ X6 ) )
=> ( X1 @ X3 @ X6 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6HHwgrrF8v/E---3.1_1073717.p',transitive) ).
thf(inverse_of_partial_order_is_partial_order,conjecture,
! [X1: $i > $i > $o] :
( ( po @ X1 )
=> ( po @ ( inv @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6HHwgrrF8v/E---3.1_1073717.p',inverse_of_partial_order_is_partial_order) ).
thf(inverse,axiom,
( inv
= ( ^ [X1: $i > $i > $o,X3: $i,X4: $i] : ( X1 @ X4 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6HHwgrrF8v/E---3.1_1073717.p',inverse) ).
thf(c_0_6,plain,
( po
= ( ^ [Z0: $i > $i > $o] :
( ! [X33: $i] : ( Z0 @ X33 @ X33 )
& ! [X34: $i,X35: $i] :
( ( ( Z0 @ X34 @ X35 )
& ( Z0 @ X35 @ X34 ) )
=> ( X34 = X35 ) )
& ! [X36: $i,X37: $i,X38: $i] :
( ( ( Z0 @ X36 @ X37 )
& ( Z0 @ X37 @ X38 ) )
=> ( Z0 @ X36 @ X38 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[partial_order]) ).
thf(c_0_7,plain,
( refl
= ( ^ [Z0: $i > $i > $o] :
! [X3: $i] : ( Z0 @ X3 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[reflexive]) ).
thf(c_0_8,plain,
( antisymm
= ( ^ [Z0: $i > $i > $o] :
! [X3: $i,X4: $i] :
( ( ( Z0 @ X3 @ X4 )
& ( Z0 @ X4 @ X3 ) )
=> ( X3 = X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[antisymmetric]) ).
thf(c_0_9,plain,
( trans
= ( ^ [Z0: $i > $i > $o] :
! [X3: $i,X4: $i,X6: $i] :
( ( ( Z0 @ X3 @ X4 )
& ( Z0 @ X4 @ X6 ) )
=> ( Z0 @ X3 @ X6 ) ) ) ),
inference(fof_simplification,[status(thm)],[transitive]) ).
thf(c_0_10,negated_conjecture,
~ ! [X1: $i > $i > $o] :
( ( po @ X1 )
=> ( po @ ( inv @ X1 ) ) ),
inference(assume_negation,[status(cth)],[inverse_of_partial_order_is_partial_order]) ).
thf(c_0_11,plain,
( inv
= ( ^ [Z0: $i > $i > $o,Z1: $i,Z2: $i] : ( Z0 @ Z2 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[inverse]) ).
thf(c_0_12,plain,
( po
= ( ^ [Z0: $i > $i > $o] :
( ! [X33: $i] : ( Z0 @ X33 @ X33 )
& ! [X34: $i,X35: $i] :
( ( ( Z0 @ X34 @ X35 )
& ( Z0 @ X35 @ X34 ) )
=> ( X34 = X35 ) )
& ! [X36: $i,X37: $i,X38: $i] :
( ( ( Z0 @ X36 @ X37 )
& ( Z0 @ X37 @ X38 ) )
=> ( Z0 @ X36 @ X38 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9]) ).
thf(c_0_13,negated_conjecture,
~ ! [X1: $i > $i > $o] :
( ( ! [X158: $i] : ( X1 @ X158 @ X158 )
& ! [X159: $i,X160: $i] :
( ( ( X1 @ X159 @ X160 )
& ( X1 @ X160 @ X159 ) )
=> ( X159 = X160 ) )
& ! [X161: $i,X162: $i,X163: $i] :
( ( ( X1 @ X161 @ X162 )
& ( X1 @ X162 @ X163 ) )
=> ( X1 @ X161 @ X163 ) ) )
=> ( ! [X164: $i] : ( X1 @ X164 @ X164 )
& ! [X165: $i,X166: $i] :
( ( ( X1 @ X166 @ X165 )
& ( X1 @ X165 @ X166 ) )
=> ( X165 = X166 ) )
& ! [X167: $i,X168: $i,X169: $i] :
( ( ( X1 @ X168 @ X167 )
& ( X1 @ X169 @ X168 ) )
=> ( X1 @ X169 @ X167 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
thf(c_0_14,negated_conjecture,
! [X171: $i,X172: $i,X173: $i,X174: $i,X175: $i,X176: $i] :
( ( epred1_0 @ X171 @ X171 )
& ( ~ ( epred1_0 @ X172 @ X173 )
| ~ ( epred1_0 @ X173 @ X172 )
| ( X172 = X173 ) )
& ( ~ ( epred1_0 @ X174 @ X175 )
| ~ ( epred1_0 @ X175 @ X176 )
| ( epred1_0 @ X174 @ X176 ) )
& ( ( epred1_0 @ esk5_0 @ esk4_0 )
| ( epred1_0 @ esk3_0 @ esk2_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk6_0 @ esk5_0 )
| ( epred1_0 @ esk3_0 @ esk2_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk6_0 @ esk4_0 )
| ( epred1_0 @ esk3_0 @ esk2_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk5_0 @ esk4_0 )
| ( epred1_0 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk6_0 @ esk5_0 )
| ( epred1_0 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk6_0 @ esk4_0 )
| ( epred1_0 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk5_0 @ esk4_0 )
| ( esk2_0 != esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk6_0 @ esk5_0 )
| ( esk2_0 != esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk6_0 @ esk4_0 )
| ( esk2_0 != esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_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_13])])])])])]) ).
thf(c_0_15,negated_conjecture,
( ( epred1_0 @ esk5_0 @ esk4_0 )
| ( epred1_0 @ esk3_0 @ esk2_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_16,negated_conjecture,
! [X3: $i] : ( epred1_0 @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_17,negated_conjecture,
! [X3: $i,X4: $i,X6: $i] :
( ( epred1_0 @ X3 @ X6 )
| ~ ( epred1_0 @ X3 @ X4 )
| ~ ( epred1_0 @ X4 @ X6 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_18,negated_conjecture,
( ( epred1_0 @ esk5_0 @ esk4_0 )
| ( epred1_0 @ esk3_0 @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
thf(c_0_19,negated_conjecture,
( ( epred1_0 @ esk6_0 @ esk5_0 )
| ( epred1_0 @ esk3_0 @ esk2_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_20,negated_conjecture,
( ( epred1_0 @ esk3_0 @ esk2_0 )
| ~ ( epred1_0 @ esk6_0 @ esk4_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_21,negated_conjecture,
( ( epred1_0 @ esk5_0 @ esk4_0 )
| ( epred1_0 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_22,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ esk3_0 @ esk2_0 )
| ( epred1_0 @ X3 @ esk4_0 )
| ~ ( epred1_0 @ X3 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_23,negated_conjecture,
( ( epred1_0 @ esk6_0 @ esk5_0 )
| ( epred1_0 @ esk3_0 @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_16])]) ).
thf(c_0_24,negated_conjecture,
( ( epred1_0 @ esk3_0 @ esk2_0 )
| ~ ( epred1_0 @ esk6_0 @ esk4_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_16])]) ).
thf(c_0_25,negated_conjecture,
( ( epred1_0 @ esk5_0 @ esk4_0 )
| ( epred1_0 @ esk2_0 @ esk3_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_16])]) ).
thf(c_0_26,negated_conjecture,
( ( epred1_0 @ esk6_0 @ esk5_0 )
| ( epred1_0 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_27,negated_conjecture,
( ( epred1_0 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ esk6_0 @ esk4_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_28,negated_conjecture,
! [X4: $i,X3: $i] :
( ( X3 = X4 )
| ~ ( epred1_0 @ X3 @ X4 )
| ~ ( epred1_0 @ X4 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_29,negated_conjecture,
epred1_0 @ esk3_0 @ esk2_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
thf(c_0_30,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ esk2_0 @ esk3_0 )
| ( epred1_0 @ X3 @ esk4_0 )
| ~ ( epred1_0 @ X3 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_25]) ).
thf(c_0_31,negated_conjecture,
( ( epred1_0 @ esk6_0 @ esk5_0 )
| ( epred1_0 @ esk2_0 @ esk3_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_16])]) ).
thf(c_0_32,negated_conjecture,
( ( epred1_0 @ esk2_0 @ esk3_0 )
| ~ ( epred1_0 @ esk6_0 @ esk4_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_16])]) ).
thf(c_0_33,negated_conjecture,
( ( epred1_0 @ esk5_0 @ esk4_0 )
| ( esk2_0 != esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_34,negated_conjecture,
( ( esk3_0 = esk2_0 )
| ~ ( epred1_0 @ esk2_0 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
thf(c_0_35,negated_conjecture,
epred1_0 @ esk2_0 @ esk3_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
thf(c_0_36,negated_conjecture,
( ~ ( epred1_0 @ esk6_0 @ esk4_0 )
| ( esk2_0 != esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_37,negated_conjecture,
( ( epred1_0 @ esk5_0 @ esk4_0 )
| ( esk3_0 != esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_16])]) ).
thf(c_0_38,negated_conjecture,
esk3_0 = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
thf(c_0_39,negated_conjecture,
( ( epred1_0 @ esk6_0 @ esk5_0 )
| ( esk2_0 != esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_40,negated_conjecture,
( ( esk3_0 != esk2_0 )
| ~ ( epred1_0 @ esk6_0 @ esk4_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_16])]) ).
thf(c_0_41,negated_conjecture,
epred1_0 @ esk5_0 @ esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]) ).
thf(c_0_42,negated_conjecture,
( ( epred1_0 @ esk6_0 @ esk5_0 )
| ( esk3_0 != esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_16])]) ).
thf(c_0_43,negated_conjecture,
~ ( epred1_0 @ esk6_0 @ esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_38])]) ).
thf(c_0_44,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ X3 @ esk4_0 )
| ~ ( epred1_0 @ X3 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_41]) ).
thf(c_0_45,negated_conjecture,
epred1_0 @ esk6_0 @ esk5_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_38])]) ).
thf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU493^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.29 % Computer : n020.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8046.5625MB
% 0.10/0.29 % OS : Linux 6.8.0-71-generic
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Tue Sep 29 13:46:49 UTC 2026
% 0.10/0.29 % CPUTime :
% 0.10/0.29 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.27/0.35 Running higher-order theorem proving
% 0.27/0.39 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.6HHwgrrF8v/E---3.1_1073717.p
% 0.33/0.43 % Version: 3.5.1-ho
% 0.33/0.43 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.33/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.43 % Starting new_ho_9 with 1500s (5) cores
% 0.33/0.43 % Starting post_as_ho1 with 300s (1) cores
% 0.33/0.43 % Starting sh1l with 300s (1) cores
% 0.33/0.43 % Starting post_as_ho10 with 300s (1) cores
% 0.33/0.43 % post_as_ho10 with pid 1073733 completed with status 0
% 0.33/0.43 % Result found by post_as_ho10
% 0.33/0.43 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.33/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.43 % Starting new_ho_9 with 1500s (5) cores
% 0.33/0.43 % Starting post_as_ho1 with 300s (1) cores
% 0.33/0.43 % Starting sh1l with 300s (1) cores
% 0.33/0.43 % Starting post_as_ho10 with 300s (1) cores
% 0.33/0.43 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.33/0.43 % No SInE strategy applied
% 0.33/0.43 % Search class: HGHSF-FFSF00-SHSSMFNN
% 0.33/0.43 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.33/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.33/0.43 % SubtermCWHack with pid 1073734 completed with status 0
% 0.33/0.43 % Result found by SubtermCWHack
% 0.33/0.43 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.33/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.43 % Starting new_ho_9 with 1500s (5) cores
% 0.33/0.43 % Starting post_as_ho1 with 300s (1) cores
% 0.33/0.43 % Starting sh1l with 300s (1) cores
% 0.33/0.43 % Starting post_as_ho10 with 300s (1) cores
% 0.33/0.43 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.33/0.43 % No SInE strategy applied
% 0.33/0.43 % Search class: HGHSF-FFSF00-SHSSMFNN
% 0.33/0.43 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.33/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.33/0.43 % Preprocessing time : 0.001 s
% 0.33/0.43
% 0.33/0.43 % Proof found!
% 0.33/0.43 % SZS status Theorem
% 0.33/0.43 % SZS output start CNFRefutation
% See solution above
% 0.33/0.43 % Parsed axioms : 59
% 0.33/0.43 % Removed by relevancy pruning/SinE : 0
% 0.33/0.43 % Initial clauses : 41
% 0.33/0.43 % Removed in clause preprocessing : 29
% 0.33/0.43 % Initial clauses in saturation : 12
% 0.33/0.43 % Processed clauses : 40
% 0.33/0.43 % ...of these trivial : 0
% 0.33/0.43 % ...subsumed : 5
% 0.33/0.43 % ...remaining for further processing : 35
% 0.33/0.43 % Other redundant clauses eliminated : 0
% 0.33/0.43 % Clauses deleted for lack of memory : 0
% 0.33/0.43 % Backward-subsumed : 0
% 0.33/0.43 % Backward-rewritten : 24
% 0.33/0.43 % Generated clauses : 37
% 0.33/0.43 % ...of the previous two non-redundant : 37
% 0.33/0.43 % ...aggressively subsumed : 0
% 0.33/0.43 % Contextual simplify-reflections : 2
% 0.33/0.43 % Paramodulations : 37
% 0.33/0.43 % Factorizations : 0
% 0.33/0.43 % NegExts : 0
% 0.33/0.43 % Equation resolutions : 0
% 0.33/0.43 % Disequality decompositions : 0
% 0.33/0.43 % Total rewrite steps : 40
% 0.33/0.43 % ...of those cached : 34
% 0.33/0.43 % Propositional unsat checks : 0
% 0.33/0.43 % Propositional check models : 0
% 0.33/0.43 % Propositional check unsatisfiable : 0
% 0.33/0.43 % Propositional clauses : 0
% 0.33/0.43 % Propositional clauses after purity: 0
% 0.33/0.43 % Propositional unsat core size : 0
% 0.33/0.43 % Propositional preprocessing time : 0.000
% 0.33/0.43 % Propositional encoding time : 0.000
% 0.33/0.43 % Propositional solver time : 0.000
% 0.33/0.43 % Success case prop preproc time : 0.000
% 0.33/0.43 % Success case prop encoding time : 0.000
% 0.33/0.43 % Success case prop solver time : 0.000
% 0.33/0.43 % Current number of processed clauses : 11
% 0.33/0.43 % Positive orientable unit clauses : 4
% 0.33/0.43 % Positive unorientable unit clauses: 0
% 0.33/0.43 % Negative unit clauses : 1
% 0.33/0.43 % Non-unit-clauses : 6
% 0.33/0.43 % Current number of unprocessed clauses: 1
% 0.33/0.43 % ...number of literals in the above : 2
% 0.33/0.43 % Current number of archived formulas : 0
% 0.33/0.43 % Current number of archived clauses : 24
% 0.33/0.43 % Clause-clause subsumption calls (NU) : 67
% 0.33/0.43 % Rec. Clause-clause subsumption calls : 52
% 0.33/0.43 % Non-unit clause-clause subsumptions : 7
% 0.33/0.43 % Unit Clause-clause subsumption calls : 6
% 0.33/0.43 % Rewrite failures with RHS unbound : 0
% 0.33/0.43 % BW rewrite match attempts : 3
% 0.33/0.43 % BW rewrite match successes : 3
% 0.33/0.43 % Condensation attempts : 0
% 0.33/0.43 % Condensation successes : 0
% 0.33/0.43 % Termbank termtop insertions : 4170
% 0.33/0.43 % Search garbage collected termcells : 1024
% 0.33/0.43
% 0.33/0.43 % -------------------------------------------------
% 0.33/0.43 % User time : 0.012 s
% 0.33/0.43 % System time : 0.002 s
% 0.33/0.43 % Total time : 0.014 s
% 0.33/0.43 % Maximum resident set size: 3944 pages
% 0.33/0.43
% 0.33/0.43 % -------------------------------------------------
% 0.33/0.43 % User time : 0.015 s
% 0.33/0.43 % System time : 0.005 s
% 0.33/0.43 % Total time : 0.021 s
% 0.33/0.43 % Maximum resident set size: 4864 pages
% 0.33/0.43 % E exiting
%------------------------------------------------------------------------------