TSTP Solution File: NUM673^4 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : NUM673^4 : TPTP v8.2.0. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Jun 24 12:36:36 EDT 2024
% Result : Theorem 0.74s 0.70s
% Output : CNFRefutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of formulae : 45 ( 33 unt; 0 typ; 0 def)
% Number of atoms : 164 ( 48 equ; 0 cnn)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 317 ( 43 ~; 17 |; 7 &; 209 @)
% ( 0 <=>; 41 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 21 ( 18 usr; 7 con; 0-3 aty)
% Number of variables : 99 ( 72 ^ 27 !; 0 ?; 99 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
is_of: $i > ( $i > $o ) > $o ).
thf(decl_23,type,
all_of: ( $i > $o ) > ( $i > $o ) > $o ).
thf(decl_25,type,
in: $i > $i > $o ).
thf(decl_61,type,
imp: $o > $o > $o ).
thf(decl_62,type,
d_not: $o > $o ).
thf(decl_71,type,
non: $i > ( $i > $o ) > $i > $o ).
thf(decl_72,type,
l_some: $i > ( $i > $o ) > $o ).
thf(decl_77,type,
e_is: $i > $i > $i > $o ).
thf(decl_123,type,
nat: $i ).
thf(decl_124,type,
n_is: $i > $i > $o ).
thf(decl_127,type,
n_some: ( $i > $o ) > $o ).
thf(decl_142,type,
n_pl: $i > $i > $i ).
thf(decl_147,type,
diffprop: $i > $i > $i > $o ).
thf(decl_148,type,
d_29_ii: $i > $i > $o ).
thf(decl_222,type,
esk66_0: $i ).
thf(decl_223,type,
esk67_0: $i ).
thf(decl_224,type,
esk68_0: $i ).
thf(decl_225,type,
esk69_0: $i ).
thf(def_d_not,axiom,
( d_not
= ( ^ [X76: $o] : ( imp @ X76 @ ~ $true ) ) ),
file('/export/starexec/sandbox/tmp/tmp.eRqHIuCHgx/E---3.1_19847.p',def_d_not) ).
thf(def_imp,axiom,
( imp
= ( ^ [X74: $o,X75: $o] :
( X74
=> X75 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.eRqHIuCHgx/E---3.1_19847.p',def_imp) ).
thf(def_all_of,axiom,
( all_of
= ( ^ [X3: $i > $o,X2: $i > $o] :
! [X4: $i] :
( ( is_of @ X4 @ X3 )
=> ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.eRqHIuCHgx/E---3.1_19847.p',def_all_of) ).
thf(def_is_of,axiom,
( is_of
= ( ^ [X1: $i,X2: $i > $o] : ( X2 @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.eRqHIuCHgx/E---3.1_19847.p',def_is_of) ).
thf(def_non,axiom,
( non
= ( ^ [X1: $i,X2: $i > $o,X4: $i] : ( d_not @ ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.eRqHIuCHgx/E---3.1_19847.p',def_non) ).
thf(def_l_some,axiom,
( l_some
= ( ^ [X1: $i,X2: $i > $o] :
( d_not
@ ( all_of
@ ^ [X4: $i] : ( in @ X4 @ X1 )
@ ( non @ X1 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.eRqHIuCHgx/E---3.1_19847.p',def_l_some) ).
thf(def_e_is,axiom,
( e_is
= ( ^ [X1: $i,X101: $i,X102: $i] : ( X101 = X102 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.eRqHIuCHgx/E---3.1_19847.p',def_e_is) ).
thf(def_diffprop,axiom,
( diffprop
= ( ^ [X1: $i,X207: $i,X4: $i] : ( n_is @ X1 @ ( n_pl @ X207 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.eRqHIuCHgx/E---3.1_19847.p',def_diffprop) ).
thf(def_n_is,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.eRqHIuCHgx/E---3.1_19847.p',def_n_is) ).
thf(def_d_29_ii,axiom,
( d_29_ii
= ( ^ [X1: $i,X210: $i] : ( n_some @ ( diffprop @ X1 @ X210 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.eRqHIuCHgx/E---3.1_19847.p',def_d_29_ii) ).
thf(def_n_some,axiom,
( n_some
= ( ^ [Z0: $i > $o] :
( ! [X447: $i] :
( ( in @ X447 @ nat )
=> ( ( Z0 @ X447 )
=> ~ $true ) )
=> ~ $true ) ) ),
file('/export/starexec/sandbox/tmp/tmp.eRqHIuCHgx/E---3.1_19847.p',def_n_some) ).
thf(satz19d,conjecture,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X273: $i] : ( in @ X273 @ nat )
@ ^ [X274: $i] :
( all_of
@ ^ [X4: $i] : ( in @ X4 @ nat )
@ ^ [X4: $i] :
( ( d_29_ii @ X1 @ X274 )
=> ( d_29_ii @ ( n_pl @ X4 @ X1 ) @ ( n_pl @ X4 @ X274 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.eRqHIuCHgx/E---3.1_19847.p',satz19d) ).
thf(satz5,axiom,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X194: $i] : ( in @ X194 @ nat )
@ ^ [X195: $i] :
( all_of
@ ^ [X4: $i] : ( in @ X4 @ nat )
@ ^ [X4: $i] : ( n_is @ ( n_pl @ ( n_pl @ X1 @ X195 ) @ X4 ) @ ( n_pl @ X1 @ ( n_pl @ X195 @ X4 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.eRqHIuCHgx/E---3.1_19847.p',satz5) ).
thf(c_0_13,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_not]) ).
thf(c_0_14,plain,
( imp
= ( ^ [Z0: $o,Z1: $o] :
( Z0
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_imp]) ).
thf(c_0_15,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_all_of]) ).
thf(c_0_16,plain,
( is_of
= ( ^ [Z0: $i,Z1: $i > $o] : ( Z1 @ Z0 ) ) ),
inference(fof_simplification,[status(thm)],[def_is_of]) ).
thf(c_0_17,plain,
( non
= ( ^ [Z0: $i,Z1: $i > $o,Z2: $i] :
( ( Z1 @ Z2 )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_non]) ).
thf(c_0_18,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_19,plain,
( l_some
= ( ^ [Z0: $i,Z1: $i > $o] :
( ! [X420: $i] :
( ( in @ X420 @ Z0 )
=> ( ( Z1 @ X420 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_l_some]) ).
thf(c_0_20,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_21,plain,
( non
= ( ^ [Z0: $i,Z1: $i > $o,Z2: $i] :
( ( Z1 @ Z2 )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_22,plain,
( e_is
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( Z1 = Z2 ) ) ),
inference(fof_simplification,[status(thm)],[def_e_is]) ).
thf(c_0_23,plain,
( l_some
= ( ^ [Z0: $i,Z1: $i > $o] :
( ! [X420: $i] :
( ( in @ X420 @ Z0 )
=> ( ( Z1 @ X420 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_19,c_0_20]),c_0_18]),c_0_21]) ).
thf(c_0_24,plain,
( diffprop
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_diffprop]) ).
thf(c_0_25,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
inference(apply_def,[status(thm)],[def_n_is,c_0_22]) ).
thf(c_0_26,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] :
( ! [X458: $i] :
( ( in @ X458 @ nat )
=> ( ( Z0
= ( n_pl @ Z1 @ X458 ) )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_29_ii]) ).
thf(c_0_27,axiom,
( n_some
= ( ^ [Z0: $i > $o] :
( ! [X447: $i] :
( ( in @ X447 @ nat )
=> ( ( Z0 @ X447 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[def_n_some,c_0_23]) ).
thf(c_0_28,plain,
( diffprop
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_24,c_0_25]) ).
thf(c_0_29,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] :
( ! [X458: $i] :
( ( in @ X458 @ nat )
=> ( ( Z0
= ( n_pl @ Z1 @ X458 ) )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
thf(c_0_30,negated_conjecture,
~ ! [X723: $i] :
( ( in @ X723 @ nat )
=> ! [X722: $i] :
( ( in @ X722 @ nat )
=> ! [X721: $i] :
( ( in @ X721 @ nat )
=> ( ( ! [X719: $i] :
( ( in @ X719 @ nat )
=> ( ( X723
= ( n_pl @ X722 @ X719 ) )
=> ~ $true ) )
=> ~ $true )
=> ( ! [X720: $i] :
( ( in @ X720 @ nat )
=> ( ( ( n_pl @ X721 @ X723 )
= ( n_pl @ ( n_pl @ X721 @ X722 ) @ X720 ) )
=> ~ $true ) )
=> ~ $true ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz19d])]),c_0_20]),c_0_29]) ).
thf(c_0_31,negated_conjecture,
! [X1365: $i] :
( ( in @ esk66_0 @ nat )
& ( in @ esk67_0 @ nat )
& ( in @ esk68_0 @ nat )
& ( ( in @ esk69_0 @ nat )
| ~ $true )
& ( ( esk66_0
= ( n_pl @ esk67_0 @ esk69_0 ) )
| ~ $true )
& ( $true
| ~ $true )
& ( ~ ( in @ X1365 @ nat )
| ( ( n_pl @ esk68_0 @ esk66_0 )
!= ( n_pl @ ( n_pl @ esk68_0 @ esk67_0 ) @ X1365 ) )
| ~ $true )
& $true ),
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_30])])])])])]) ).
thf(c_0_32,plain,
! [X573: $i] :
( ( in @ X573 @ nat )
=> ! [X572: $i] :
( ( in @ X572 @ nat )
=> ! [X571: $i] :
( ( in @ X571 @ nat )
=> ( ( n_pl @ ( n_pl @ X573 @ X572 ) @ X571 )
= ( n_pl @ X573 @ ( n_pl @ X572 @ X571 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz5]),c_0_20]),c_0_25]) ).
thf(c_0_33,negated_conjecture,
! [X1: $i] :
( ~ ( in @ X1 @ nat )
| ( ( n_pl @ esk68_0 @ esk66_0 )
!= ( n_pl @ ( n_pl @ esk68_0 @ esk67_0 ) @ X1 ) )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_34,plain,
! [X1201: $i,X1202: $i,X1203: $i] :
( ~ ( in @ X1201 @ nat )
| ~ ( in @ X1202 @ nat )
| ~ ( in @ X1203 @ nat )
| ( ( n_pl @ ( n_pl @ X1201 @ X1202 ) @ X1203 )
= ( n_pl @ X1201 @ ( n_pl @ X1202 @ X1203 ) ) ) ),
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_35,negated_conjecture,
! [X1: $i] :
( ( ( n_pl @ esk68_0 @ esk66_0 )
!= ( n_pl @ ( n_pl @ esk68_0 @ esk67_0 ) @ X1 ) )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[c_0_33]) ).
thf(c_0_36,plain,
! [X1: $i,X4: $i,X5: $i] :
( ( ( n_pl @ ( n_pl @ X1 @ X4 ) @ X5 )
= ( n_pl @ X1 @ ( n_pl @ X4 @ X5 ) ) )
| ~ ( in @ X1 @ nat )
| ~ ( in @ X4 @ nat )
| ~ ( in @ X5 @ nat ) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
thf(c_0_37,negated_conjecture,
in @ esk67_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_38,negated_conjecture,
in @ esk68_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_39,negated_conjecture,
( ( esk66_0
= ( n_pl @ esk67_0 @ esk69_0 ) )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_40,negated_conjecture,
( ( in @ esk69_0 @ nat )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_41,negated_conjecture,
! [X1: $i] :
( ( ( n_pl @ esk68_0 @ ( n_pl @ esk67_0 @ X1 ) )
!= ( n_pl @ esk68_0 @ esk66_0 ) )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38])]) ).
thf(c_0_42,negated_conjecture,
( esk66_0
= ( n_pl @ esk67_0 @ esk69_0 ) ),
inference(cn,[status(thm)],[c_0_39]) ).
thf(c_0_43,negated_conjecture,
in @ esk69_0 @ nat,
inference(cn,[status(thm)],[c_0_40]) ).
thf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM673^4 : TPTP v8.2.0. Released v7.1.0.
% 0.07/0.12 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat Jun 22 19:27:54 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.20/0.52 Running higher-order theorem proving
% 0.20/0.52 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.eRqHIuCHgx/E---3.1_19847.p
% 0.74/0.64 # Type mismatch in argument #1 of indeq @ ($not @ db(4)) @ ($db_lam @ db(0) @ ($db_lam @ db(0) @ ($@_var @ db(6) @ db(1) @ db(0)))) @ db(3) @ (d_11_i @ ($not @ db(4)) @ ($db_lam @ db(0) @ ($db_lam @ db(0) @ ($@_var @ db(6) @ db(1) @ db(0)))) @ db(3) @ db(2) @ db(1)) @ db(0): expected $i but got $o
% 0.74/0.64 eprover: Type error
% 0.74/0.70 # Version: 3.2.0-ho
% 0.74/0.70 # Preprocessing class: HSLMSMSSLLLCHSA.
% 0.74/0.70 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.74/0.70 # Starting lpo1_fix with 900s (3) cores
% 0.74/0.70 # Starting full_lambda_9 with 300s (1) cores
% 0.74/0.70 # Starting almost_fo_4 with 300s (1) cores
% 0.74/0.70 # Starting new_ho_9 with 300s (1) cores
% 0.74/0.70 # Starting pre_casc_4 with 300s (1) cores
% 0.74/0.70 # Starting ho_unfolding_6 with 300s (1) cores
% 0.74/0.70 # almost_fo_4 with pid 19928 completed with status 0
% 0.74/0.70 # Result found by almost_fo_4
% 0.74/0.70 # Preprocessing class: HSLMSMSSLLLCHSA.
% 0.74/0.70 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.74/0.70 # Starting lpo1_fix with 900s (3) cores
% 0.74/0.70 # Starting full_lambda_9 with 300s (1) cores
% 0.74/0.70 # Starting almost_fo_4 with 300s (1) cores
% 0.74/0.70 # No SInE strategy applied
% 0.74/0.70 # Search class: HGHSM-FSLM32-DHSMMSBN
% 0.74/0.70 # partial match(1): HGHSM-FSLM32-MHSMMSBN
% 0.74/0.70 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.74/0.70 # Starting full_lambda_5 with 28s (1) cores
% 0.74/0.70 # full_lambda_5 with pid 19934 completed with status 0
% 0.74/0.70 # Result found by full_lambda_5
% 0.74/0.70 # Preprocessing class: HSLMSMSSLLLCHSA.
% 0.74/0.70 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.74/0.70 # Starting lpo1_fix with 900s (3) cores
% 0.74/0.70 # Starting full_lambda_9 with 300s (1) cores
% 0.74/0.70 # Starting almost_fo_4 with 300s (1) cores
% 0.74/0.70 # No SInE strategy applied
% 0.74/0.70 # Search class: HGHSM-FSLM32-DHSMMSBN
% 0.74/0.70 # partial match(1): HGHSM-FSLM32-MHSMMSBN
% 0.74/0.70 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.74/0.70 # Starting full_lambda_5 with 28s (1) cores
% 0.74/0.70 # Preprocessing time : 0.010 s
% 0.74/0.70 # Presaturation interreduction done
% 0.74/0.70
% 0.74/0.70 # Proof found!
% 0.74/0.70 # SZS status Theorem
% 0.74/0.70 # SZS output start CNFRefutation
% See solution above
% 0.74/0.70 # Parsed axioms : 372
% 0.74/0.70 # Removed by relevancy pruning/SinE : 0
% 0.74/0.70 # Initial clauses : 800
% 0.74/0.70 # Removed in clause preprocessing : 481
% 0.74/0.70 # Initial clauses in saturation : 319
% 0.74/0.70 # Processed clauses : 586
% 0.74/0.70 # ...of these trivial : 5
% 0.74/0.70 # ...subsumed : 54
% 0.74/0.70 # ...remaining for further processing : 527
% 0.74/0.70 # Other redundant clauses eliminated : 112
% 0.74/0.70 # Clauses deleted for lack of memory : 0
% 0.74/0.70 # Backward-subsumed : 3
% 0.74/0.70 # Backward-rewritten : 0
% 0.74/0.70 # Generated clauses : 1165
% 0.74/0.70 # ...of the previous two non-redundant : 1112
% 0.74/0.70 # ...aggressively subsumed : 0
% 0.74/0.70 # Contextual simplify-reflections : 13
% 0.74/0.70 # Paramodulations : 1029
% 0.74/0.70 # Factorizations : 2
% 0.74/0.70 # NegExts : 0
% 0.74/0.70 # Equation resolutions : 115
% 0.74/0.70 # Disequality decompositions : 0
% 0.74/0.70 # Total rewrite steps : 170
% 0.74/0.70 # ...of those cached : 135
% 0.74/0.70 # Propositional unsat checks : 0
% 0.74/0.70 # Propositional check models : 0
% 0.74/0.70 # Propositional check unsatisfiable : 0
% 0.74/0.70 # Propositional clauses : 0
% 0.74/0.70 # Propositional clauses after purity: 0
% 0.74/0.70 # Propositional unsat core size : 0
% 0.74/0.70 # Propositional preprocessing time : 0.000
% 0.74/0.70 # Propositional encoding time : 0.000
% 0.74/0.70 # Propositional solver time : 0.000
% 0.74/0.70 # Success case prop preproc time : 0.000
% 0.74/0.70 # Success case prop encoding time : 0.000
% 0.74/0.70 # Success case prop solver time : 0.000
% 0.74/0.70 # Current number of processed clauses : 184
% 0.74/0.70 # Positive orientable unit clauses : 59
% 0.74/0.70 # Positive unorientable unit clauses: 6
% 0.74/0.70 # Negative unit clauses : 15
% 0.74/0.70 # Non-unit-clauses : 104
% 0.74/0.70 # Current number of unprocessed clauses: 1118
% 0.74/0.70 # ...number of literals in the above : 3359
% 0.74/0.70 # Current number of archived formulas : 0
% 0.74/0.70 # Current number of archived clauses : 282
% 0.74/0.70 # Clause-clause subsumption calls (NU) : 23083
% 0.74/0.70 # Rec. Clause-clause subsumption calls : 3178
% 0.74/0.70 # Non-unit clause-clause subsumptions : 63
% 0.74/0.70 # Unit Clause-clause subsumption calls : 516
% 0.74/0.70 # Rewrite failures with RHS unbound : 2
% 0.74/0.70 # BW rewrite match attempts : 68
% 0.74/0.70 # BW rewrite match successes : 24
% 0.74/0.70 # Condensation attempts : 0
% 0.74/0.70 # Condensation successes : 0
% 0.74/0.70 # Termbank termtop insertions : 112058
% 0.74/0.70 # Search garbage collected termcells : 29129
% 0.74/0.70
% 0.74/0.70 # -------------------------------------------------
% 0.74/0.70 # User time : 0.138 s
% 0.74/0.70 # System time : 0.019 s
% 0.74/0.70 # Total time : 0.157 s
% 0.74/0.70 # Maximum resident set size: 6228 pages
% 0.74/0.70
% 0.74/0.70 # -------------------------------------------------
% 0.74/0.70 # User time : 0.146 s
% 0.74/0.70 # System time : 0.023 s
% 0.74/0.70 # Total time : 0.169 s
% 0.74/0.70 # Maximum resident set size: 2292 pages
% 0.74/0.70 % E---3.1 exiting
% 0.74/0.70 % E exiting
%------------------------------------------------------------------------------