TSTP Solution File: ITP133^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP133^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 May 20 22:16:28 EDT 2024
% Result : Theorem 1.04s 0.64s
% Output : CNFRefutation 1.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 20
% Syntax : Number of formulae : 60 ( 19 unt; 12 typ; 0 def)
% Number of atoms : 110 ( 63 equ; 0 cnn)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 334 ( 51 ~; 45 |; 8 &; 221 @)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 60 ( 15 ^ 45 !; 0 ?; 60 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_sort2,type,
set_nat: $tType ).
thf(decl_22,type,
one_one_nat: nat ).
thf(decl_23,type,
times_times_nat: nat > nat > nat ).
thf(decl_24,type,
zero_zero_nat: nat ).
thf(decl_25,type,
groups1842438620at_nat: ( nat > nat ) > set_nat > nat ).
thf(decl_30,type,
ord_less_eq_nat: nat > nat > $o ).
thf(decl_35,type,
set_ord_atMost_nat: nat > set_nat ).
thf(decl_39,type,
p: nat > nat ).
thf(decl_40,type,
esk1_0: nat ).
thf(decl_41,type,
esk2_0: nat ).
thf(decl_127,type,
esk88_0: nat ).
thf(conj_0,conjecture,
( ( ! [X6: nat] :
( ( ( p @ X6 )
!= zero_zero_nat )
=> ( ( ord_less_eq_nat @ one_one_nat @ X6 )
& ( ord_less_eq_nat @ X6 @ zero_zero_nat ) ) )
& ( ( groups1842438620at_nat
@ ^ [X6: nat] : ( times_times_nat @ ( p @ X6 ) @ X6 )
@ ( set_ord_atMost_nat @ zero_zero_nat ) )
= zero_zero_nat ) )
<=> ( p
= ( ^ [X6: nat] : zero_zero_nat ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(fact_0_sum_Oneutral__const,axiom,
! [X1: set_nat] :
( ( groups1842438620at_nat
@ ^ [X2: nat] : zero_zero_nat
@ X1 )
= zero_zero_nat ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_sum_Oneutral__const) ).
thf(fact_143_mult_Ocommute,axiom,
( times_times_nat
= ( ^ [X176: nat,X177: nat] : ( times_times_nat @ X177 @ X176 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_143_mult_Ocommute) ).
thf(fact_25_le__antisym,axiom,
! [X10: nat,X4: nat] :
( ( ord_less_eq_nat @ X10 @ X4 )
=> ( ( ord_less_eq_nat @ X4 @ X10 )
=> ( X10 = X4 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_25_le__antisym) ).
thf(fact_16_bot__nat__0_Oextremum,axiom,
! [X21: nat] : ( ord_less_eq_nat @ zero_zero_nat @ X21 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_16_bot__nat__0_Oextremum) ).
thf(fact_75_not__one__le__zero,axiom,
~ ( ord_less_eq_nat @ one_one_nat @ zero_zero_nat ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_75_not__one__le__zero) ).
thf(fact_66_mult__nonneg__nonpos2,axiom,
! [X21: nat,X23: nat] :
( ( ord_less_eq_nat @ zero_zero_nat @ X21 )
=> ( ( ord_less_eq_nat @ X23 @ zero_zero_nat )
=> ( ord_less_eq_nat @ ( times_times_nat @ X23 @ X21 ) @ zero_zero_nat ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_66_mult__nonneg__nonpos2) ).
thf(fact_45_bot__nat__0_Oextremum__uniqueI,axiom,
! [X21: nat] :
( ( ord_less_eq_nat @ X21 @ zero_zero_nat )
=> ( X21 = zero_zero_nat ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_45_bot__nat__0_Oextremum__uniqueI) ).
thf(c_0_8,negated_conjecture,
~ ( ( ! [X6: nat] :
( ( ( p @ X6 )
!= zero_zero_nat )
=> ( ( ord_less_eq_nat @ one_one_nat @ X6 )
& ( ord_less_eq_nat @ X6 @ zero_zero_nat ) ) )
& ( ( groups1842438620at_nat
@ ^ [Z0: nat] : ( times_times_nat @ ( p @ Z0 ) @ Z0 )
@ ( set_ord_atMost_nat @ zero_zero_nat ) )
= zero_zero_nat ) )
<=> ! [X834: nat] :
( ( p @ X834 )
= zero_zero_nat ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])])]) ).
thf(c_0_9,plain,
! [X1: set_nat] :
( ( groups1842438620at_nat
@ ^ [Z0: nat] : zero_zero_nat
@ X1 )
= zero_zero_nat ),
inference(fof_simplification,[status(thm)],[fact_0_sum_Oneutral__const]) ).
thf(c_0_10,negated_conjecture,
! [X873: nat,X874: nat] :
( ( ( ( p @ esk1_0 )
!= zero_zero_nat )
| ( ( groups1842438620at_nat
@ ^ [Z0: nat] : ( times_times_nat @ ( p @ Z0 ) @ Z0 )
@ ( set_ord_atMost_nat @ zero_zero_nat ) )
!= zero_zero_nat )
| ( ( p @ esk2_0 )
!= zero_zero_nat ) )
& ( ~ ( ord_less_eq_nat @ one_one_nat @ esk1_0 )
| ~ ( ord_less_eq_nat @ esk1_0 @ zero_zero_nat )
| ( ( groups1842438620at_nat
@ ^ [Z0: nat] : ( times_times_nat @ ( p @ Z0 ) @ Z0 )
@ ( set_ord_atMost_nat @ zero_zero_nat ) )
!= zero_zero_nat )
| ( ( p @ esk2_0 )
!= zero_zero_nat ) )
& ( ( ord_less_eq_nat @ one_one_nat @ X873 )
| ( ( p @ X873 )
= zero_zero_nat )
| ( ( p @ X874 )
= zero_zero_nat ) )
& ( ( ord_less_eq_nat @ X873 @ zero_zero_nat )
| ( ( p @ X873 )
= zero_zero_nat )
| ( ( p @ X874 )
= zero_zero_nat ) )
& ( ( ( groups1842438620at_nat
@ ^ [Z0: nat] : ( times_times_nat @ ( p @ Z0 ) @ Z0 )
@ ( set_ord_atMost_nat @ zero_zero_nat ) )
= zero_zero_nat )
| ( ( p @ X874 )
= zero_zero_nat ) ) ),
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_8])])])])])]) ).
thf(c_0_11,plain,
! [X884: set_nat] :
( ( groups1842438620at_nat
@ ^ [Z0: nat] : zero_zero_nat
@ X884 )
= zero_zero_nat ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
thf(c_0_12,plain,
! [X837: nat,X838: nat] :
( ( times_times_nat @ X837 @ X838 )
= ( times_times_nat @ X838 @ X837 ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_143_mult_Ocommute])]) ).
thf(c_0_13,negated_conjecture,
( ( ( p @ esk1_0 )
!= zero_zero_nat )
| ( ( groups1842438620at_nat
@ ^ [Z0: nat] : ( times_times_nat @ ( p @ Z0 ) @ Z0 )
@ ( set_ord_atMost_nat @ zero_zero_nat ) )
!= zero_zero_nat )
| ( ( p @ esk2_0 )
!= zero_zero_nat ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_14,plain,
! [X1: set_nat] :
( ( groups1842438620at_nat
@ ^ [Z0: nat] : zero_zero_nat
@ X1 )
= zero_zero_nat ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_15,plain,
! [X1035: nat,X1036: nat] :
( ( times_times_nat @ X1035 @ X1036 )
= ( times_times_nat @ X1036 @ X1035 ) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
thf(c_0_16,plain,
( ( ( ^ [Z0: nat] : ( times_times_nat @ ( p @ Z0 ) @ Z0 ) )
!= ( ^ [Z0: nat] : zero_zero_nat ) )
| ( ( p @ esk1_0 )
!= zero_zero_nat )
| ( ( p @ esk2_0 )
!= zero_zero_nat ) ),
inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_13,c_0_14])]) ).
thf(c_0_17,plain,
! [X4: nat,X2: nat] :
( ( times_times_nat @ X2 @ X4 )
= ( times_times_nat @ X4 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_18,negated_conjecture,
! [X2: nat,X4: nat] :
( ( ord_less_eq_nat @ X2 @ zero_zero_nat )
| ( ( p @ X2 )
= zero_zero_nat )
| ( ( p @ X4 )
= zero_zero_nat ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_19,negated_conjecture,
! [X2: nat,X4: nat] :
( ( ord_less_eq_nat @ one_one_nat @ X2 )
| ( ( p @ X2 )
= zero_zero_nat )
| ( ( p @ X4 )
= zero_zero_nat ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_20,plain,
! [X1068: nat,X1069: nat] :
( ~ ( ord_less_eq_nat @ X1068 @ X1069 )
| ~ ( ord_less_eq_nat @ X1069 @ X1068 )
| ( X1068 = X1069 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_25_le__antisym])])]) ).
thf(c_0_21,plain,
( ( ( times_times_nat @ esk88_0 @ ( p @ esk88_0 ) )
!= zero_zero_nat )
| ( ( p @ esk1_0 )
!= zero_zero_nat )
| ( ( p @ esk2_0 )
!= zero_zero_nat ) ),
inference(rw,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_16]),c_0_17]) ).
thf(c_0_22,negated_conjecture,
! [X2: nat] :
( ( ( p @ X2 )
= zero_zero_nat )
| ( ord_less_eq_nat @ X2 @ zero_zero_nat ) ),
inference(condense,[status(thm)],[c_0_18]) ).
thf(c_0_23,plain,
! [X875: nat] : ( ord_less_eq_nat @ zero_zero_nat @ X875 ),
inference(variable_rename,[status(thm)],[fact_16_bot__nat__0_Oextremum]) ).
thf(c_0_24,plain,
~ ( ord_less_eq_nat @ one_one_nat @ zero_zero_nat ),
inference(fof_simplification,[status(thm)],[fact_75_not__one__le__zero]) ).
thf(c_0_25,negated_conjecture,
! [X2: nat] :
( ( ( p @ X2 )
= zero_zero_nat )
| ( ord_less_eq_nat @ one_one_nat @ X2 ) ),
inference(condense,[status(thm)],[c_0_19]) ).
thf(c_0_26,plain,
! [X4: nat,X2: nat] :
( ( X2 = X4 )
| ~ ( ord_less_eq_nat @ X2 @ X4 )
| ~ ( ord_less_eq_nat @ X4 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_27,negated_conjecture,
( ( ord_less_eq_nat @ esk2_0 @ zero_zero_nat )
| ( ( times_times_nat @ esk88_0 @ ( p @ esk88_0 ) )
!= zero_zero_nat )
| ( ( p @ esk1_0 )
!= zero_zero_nat ) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_28,plain,
! [X2: nat] : ( ord_less_eq_nat @ zero_zero_nat @ X2 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_29,plain,
~ ( ord_less_eq_nat @ one_one_nat @ zero_zero_nat ),
inference(fof_nnf,[status(thm)],[c_0_24]) ).
thf(c_0_30,negated_conjecture,
( ( ord_less_eq_nat @ one_one_nat @ esk2_0 )
| ( ( times_times_nat @ esk88_0 @ ( p @ esk88_0 ) )
!= zero_zero_nat )
| ( ( p @ esk1_0 )
!= zero_zero_nat ) ),
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
thf(c_0_31,negated_conjecture,
( ( esk2_0 = zero_zero_nat )
| ( ( times_times_nat @ esk88_0 @ ( p @ esk88_0 ) )
!= zero_zero_nat )
| ( ( p @ esk1_0 )
!= zero_zero_nat ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
thf(c_0_32,plain,
~ ( ord_less_eq_nat @ one_one_nat @ zero_zero_nat ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_33,negated_conjecture,
( ( ( times_times_nat @ esk88_0 @ ( p @ esk88_0 ) )
!= zero_zero_nat )
| ( ( p @ esk1_0 )
!= zero_zero_nat ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
thf(c_0_34,plain,
! [X1002: nat,X1003: nat] :
( ~ ( ord_less_eq_nat @ zero_zero_nat @ X1002 )
| ~ ( ord_less_eq_nat @ X1003 @ zero_zero_nat )
| ( ord_less_eq_nat @ ( times_times_nat @ X1003 @ X1002 ) @ zero_zero_nat ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_66_mult__nonneg__nonpos2])])]) ).
thf(c_0_35,negated_conjecture,
( ( ord_less_eq_nat @ esk1_0 @ zero_zero_nat )
| ( ( times_times_nat @ esk88_0 @ ( p @ esk88_0 ) )
!= zero_zero_nat ) ),
inference(spm,[status(thm)],[c_0_33,c_0_22]) ).
thf(c_0_36,plain,
! [X877: nat] :
( ~ ( ord_less_eq_nat @ X877 @ zero_zero_nat )
| ( X877 = zero_zero_nat ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_45_bot__nat__0_Oextremum__uniqueI])])]) ).
thf(c_0_37,plain,
! [X2: nat,X4: nat] :
( ( ord_less_eq_nat @ ( times_times_nat @ X4 @ X2 ) @ zero_zero_nat )
| ~ ( ord_less_eq_nat @ zero_zero_nat @ X2 )
| ~ ( ord_less_eq_nat @ X4 @ zero_zero_nat ) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
thf(c_0_38,negated_conjecture,
( ( esk1_0 = zero_zero_nat )
| ( ( times_times_nat @ esk88_0 @ ( p @ esk88_0 ) )
!= zero_zero_nat ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_35]),c_0_28])]) ).
thf(c_0_39,plain,
! [X2: nat] :
( ( X2 = zero_zero_nat )
| ~ ( ord_less_eq_nat @ X2 @ zero_zero_nat ) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
thf(c_0_40,plain,
! [X4: nat,X2: nat] :
( ( ord_less_eq_nat @ ( times_times_nat @ X2 @ X4 ) @ zero_zero_nat )
| ~ ( ord_less_eq_nat @ X2 @ zero_zero_nat ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_28])]) ).
thf(c_0_41,negated_conjecture,
( ( ( times_times_nat @ esk88_0 @ ( p @ esk88_0 ) )
!= zero_zero_nat )
| ( ( p @ zero_zero_nat )
!= zero_zero_nat ) ),
inference(spm,[status(thm)],[c_0_33,c_0_38]) ).
thf(c_0_42,plain,
! [X4: nat,X2: nat] :
( ( ( times_times_nat @ X2 @ X4 )
= zero_zero_nat )
| ~ ( ord_less_eq_nat @ X2 @ zero_zero_nat ) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
thf(c_0_43,negated_conjecture,
( ( times_times_nat @ esk88_0 @ ( p @ esk88_0 ) )
!= zero_zero_nat ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_25]),c_0_32]) ).
thf(c_0_44,plain,
! [X2: nat,X4: nat] :
( ( ( times_times_nat @ X2 @ X4 )
= zero_zero_nat )
| ~ ( ord_less_eq_nat @ X4 @ zero_zero_nat ) ),
inference(spm,[status(thm)],[c_0_42,c_0_17]) ).
thf(c_0_45,negated_conjecture,
~ ( ord_less_eq_nat @ ( p @ esk88_0 ) @ zero_zero_nat ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
thf(c_0_46,negated_conjecture,
~ ( ord_less_eq_nat @ esk88_0 @ zero_zero_nat ),
inference(spm,[status(thm)],[c_0_43,c_0_42]) ).
thf(c_0_47,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_22]),c_0_28])]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : ITP133^1 : TPTP v8.2.0. Released v7.5.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n019.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Sat May 18 17:15:08 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.23/0.50 Running higher-order theorem proving
% 0.23/0.50 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/benchmark/theBenchmark.p
% 1.04/0.64 # Version: 3.1.0-ho
% 1.04/0.64 # Preprocessing class: HSLSSMSSSSLNHSA.
% 1.04/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.04/0.64 # Starting pre_casc_6 with 1200s (4) cores
% 1.04/0.64 # Starting sh4 with 600s (2) cores
% 1.04/0.64 # Starting pre_casc_4 with 300s (1) cores
% 1.04/0.64 # Starting full_lambda_7 with 300s (1) cores
% 1.04/0.64 # pre_casc_4 with pid 18846 completed with status 0
% 1.04/0.64 # Result found by pre_casc_4
% 1.04/0.64 # Preprocessing class: HSLSSMSSSSLNHSA.
% 1.04/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.04/0.64 # Starting pre_casc_6 with 1200s (4) cores
% 1.04/0.64 # Starting sh4 with 600s (2) cores
% 1.04/0.64 # Starting pre_casc_4 with 300s (1) cores
% 1.04/0.64 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 1.04/0.64 # Search class: HGHSM-FSLS32-DHSFFSBC
% 1.04/0.64 # partial match(1): HGHSM-FSLM32-DHSFFSBC
% 1.04/0.64 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.04/0.64 # Starting lpo8_lambda_fix with 163s (1) cores
% 1.04/0.64 # lpo8_lambda_fix with pid 18853 completed with status 0
% 1.04/0.64 # Result found by lpo8_lambda_fix
% 1.04/0.64 # Preprocessing class: HSLSSMSSSSLNHSA.
% 1.04/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.04/0.64 # Starting pre_casc_6 with 1200s (4) cores
% 1.04/0.64 # Starting sh4 with 600s (2) cores
% 1.04/0.64 # Starting pre_casc_4 with 300s (1) cores
% 1.04/0.64 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 1.04/0.64 # Search class: HGHSM-FSLS32-DHSFFSBC
% 1.04/0.64 # partial match(1): HGHSM-FSLM32-DHSFFSBC
% 1.04/0.64 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.04/0.64 # Starting lpo8_lambda_fix with 163s (1) cores
% 1.04/0.64 # Preprocessing time : 0.015 s
% 1.04/0.64 # Presaturation interreduction done
% 1.04/0.64
% 1.04/0.64 # Proof found!
% 1.04/0.64 # SZS status Theorem
% 1.04/0.64 # SZS output start CNFRefutation
% See solution above
% 1.04/0.64 # Parsed axioms : 283
% 1.04/0.64 # Removed by relevancy pruning/SinE : 48
% 1.04/0.64 # Initial clauses : 485
% 1.04/0.64 # Removed in clause preprocessing : 21
% 1.04/0.64 # Initial clauses in saturation : 464
% 1.04/0.64 # Processed clauses : 627
% 1.04/0.64 # ...of these trivial : 22
% 1.04/0.64 # ...subsumed : 209
% 1.04/0.64 # ...remaining for further processing : 396
% 1.04/0.64 # Other redundant clauses eliminated : 95
% 1.04/0.64 # Clauses deleted for lack of memory : 0
% 1.04/0.64 # Backward-subsumed : 9
% 1.04/0.64 # Backward-rewritten : 3
% 1.04/0.64 # Generated clauses : 577
% 1.04/0.64 # ...of the previous two non-redundant : 398
% 1.04/0.64 # ...aggressively subsumed : 0
% 1.04/0.64 # Contextual simplify-reflections : 0
% 1.04/0.64 # Paramodulations : 460
% 1.04/0.64 # Factorizations : 2
% 1.04/0.64 # NegExts : 1
% 1.04/0.64 # Equation resolutions : 96
% 1.04/0.64 # Disequality decompositions : 0
% 1.04/0.64 # Total rewrite steps : 264
% 1.04/0.64 # ...of those cached : 206
% 1.04/0.64 # Propositional unsat checks : 0
% 1.04/0.64 # Propositional check models : 0
% 1.04/0.64 # Propositional check unsatisfiable : 0
% 1.04/0.64 # Propositional clauses : 0
% 1.04/0.64 # Propositional clauses after purity: 0
% 1.04/0.64 # Propositional unsat core size : 0
% 1.04/0.64 # Propositional preprocessing time : 0.000
% 1.04/0.64 # Propositional encoding time : 0.000
% 1.04/0.64 # Propositional solver time : 0.000
% 1.04/0.64 # Success case prop preproc time : 0.000
% 1.04/0.64 # Success case prop encoding time : 0.000
% 1.04/0.64 # Success case prop solver time : 0.000
% 1.04/0.64 # Current number of processed clauses : 79
% 1.04/0.64 # Positive orientable unit clauses : 19
% 1.04/0.64 # Positive unorientable unit clauses: 4
% 1.04/0.64 # Negative unit clauses : 8
% 1.04/0.64 # Non-unit-clauses : 48
% 1.04/0.64 # Current number of unprocessed clauses: 458
% 1.04/0.64 # ...number of literals in the above : 1194
% 1.04/0.64 # Current number of archived formulas : 0
% 1.04/0.64 # Current number of archived clauses : 235
% 1.04/0.64 # Clause-clause subsumption calls (NU) : 7690
% 1.04/0.64 # Rec. Clause-clause subsumption calls : 3555
% 1.04/0.64 # Non-unit clause-clause subsumptions : 189
% 1.04/0.64 # Unit Clause-clause subsumption calls : 236
% 1.04/0.64 # Rewrite failures with RHS unbound : 0
% 1.04/0.64 # BW rewrite match attempts : 58
% 1.04/0.64 # BW rewrite match successes : 41
% 1.04/0.64 # Condensation attempts : 627
% 1.04/0.64 # Condensation successes : 16
% 1.04/0.64 # Termbank termtop insertions : 54462
% 1.04/0.64 # Search garbage collected termcells : 9897
% 1.04/0.64
% 1.04/0.64 # -------------------------------------------------
% 1.04/0.64 # User time : 0.095 s
% 1.04/0.64 # System time : 0.016 s
% 1.04/0.64 # Total time : 0.111 s
% 1.04/0.64 # Maximum resident set size: 3880 pages
% 1.04/0.64
% 1.04/0.64 # -------------------------------------------------
% 1.04/0.64 # User time : 0.105 s
% 1.04/0.64 # System time : 0.018 s
% 1.04/0.64 # Total time : 0.123 s
% 1.04/0.64 # Maximum resident set size: 2216 pages
% 1.04/0.64 % E---3.1 exiting
% 1.04/0.64 % E exiting
%------------------------------------------------------------------------------