TSTP Solution File: SYO314^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO314^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : Tue May 21 08:45:36 EDT 2024
% Result : Theorem 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 10
% Syntax : Number of formulae : 60 ( 21 unt; 9 typ; 0 def)
% Number of atoms : 101 ( 0 equ; 0 cnn)
% Maximal formula atoms : 32 ( 1 avg)
% Number of connectives : 456 ( 94 ~; 126 |; 28 &; 206 @)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 57 ( 57 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 9 usr; 6 con; 0-1 aty)
% Number of variables : 106 ( 0 ^ 90 !; 16 ?; 106 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
z: $i ).
thf(decl_23,type,
epred1_0: $i > $o ).
thf(decl_24,type,
epred2_0: $i > $o ).
thf(decl_25,type,
esk1_0: $i ).
thf(decl_26,type,
esk2_0: $i ).
thf(decl_27,type,
epred3_0: $i > $o ).
thf(decl_28,type,
epred4_0: $i > $o ).
thf(decl_29,type,
esk3_0: $i ).
thf(decl_30,type,
esk4_0: $i ).
thf(cSILLYWFF2,conjecture,
( ? [X1: $i > $o,X2: $i > $o,X3: $i,X4: $i] :
( ( X1 @ X3 )
& ~ ( X1 @ X4 )
& ( X2 @ X4 )
& ~ ( X2 @ z ) )
<=> ? [X1: $i > $o,X2: $i > $o,X3: $i,X4: $i] :
( ~ ( X2 @ z )
& ( X2 @ X4 )
& ( X1 @ X3 )
& ~ ( X1 @ X4 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cSILLYWFF2) ).
thf(c_0_1,negated_conjecture,
~ ( ? [X1: $i > $o,X2: $i > $o,X3: $i,X4: $i] :
( ( X1 @ X3 )
& ~ ( X1 @ X4 )
& ( X2 @ X4 )
& ~ ( X2 @ z ) )
<=> ? [X1: $i > $o,X2: $i > $o,X3: $i,X4: $i] :
( ~ ( X2 @ z )
& ( X2 @ X4 )
& ( X1 @ X3 )
& ~ ( X1 @ X4 ) ) ),
inference(assume_negation,[status(cth)],[cSILLYWFF2]) ).
thf(c_0_2,negated_conjecture,
! [X13: $i > $o,X14: $i > $o,X15: $i,X16: $i,X17: $i > $o,X18: $i > $o,X19: $i,X20: $i] :
( ( ~ ( X13 @ X15 )
| ( X13 @ X16 )
| ~ ( X14 @ X16 )
| ( X14 @ z )
| ( X18 @ z )
| ~ ( X18 @ X20 )
| ~ ( X17 @ X19 )
| ( X17 @ X20 ) )
& ( ~ ( epred4_0 @ z )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred4_0 @ esk4_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred3_0 @ esk3_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ~ ( epred3_0 @ esk4_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ~ ( epred4_0 @ z )
| ~ ( epred1_0 @ esk2_0 ) )
& ( ( epred4_0 @ esk4_0 )
| ~ ( epred1_0 @ esk2_0 ) )
& ( ( epred3_0 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 ) )
& ( ~ ( epred3_0 @ esk4_0 )
| ~ ( epred1_0 @ esk2_0 ) )
& ( ~ ( epred4_0 @ z )
| ( epred2_0 @ esk2_0 ) )
& ( ( epred4_0 @ esk4_0 )
| ( epred2_0 @ esk2_0 ) )
& ( ( epred3_0 @ esk3_0 )
| ( epred2_0 @ esk2_0 ) )
& ( ~ ( epred3_0 @ esk4_0 )
| ( epred2_0 @ esk2_0 ) )
& ( ~ ( epred4_0 @ z )
| ~ ( epred2_0 @ z ) )
& ( ( epred4_0 @ esk4_0 )
| ~ ( epred2_0 @ z ) )
& ( ( epred3_0 @ esk3_0 )
| ~ ( epred2_0 @ z ) )
& ( ~ ( epred3_0 @ esk4_0 )
| ~ ( epred2_0 @ z ) ) ),
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_1])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X1: $i > $o,X2: $i > $o,X3: $i,X4: $i,X5: $i > $o,X6: $i > $o,X7: $i,X8: $i] :
( ( X1 @ X4 )
| ( X2 @ z )
| ( X5 @ z )
| ( X6 @ X7 )
| ~ ( X1 @ X3 )
| ~ ( X2 @ X4 )
| ~ ( X5 @ X7 )
| ~ ( X6 @ X8 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( ( epred3_0 @ esk3_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i > $o,X3: $i,X2: $i > $o,X4: $i,X5: $i > $o,X7: $i] :
( ( epred1_0 @ esk1_0 )
| ( epred3_0 @ X3 )
| ( X1 @ z )
| ( X2 @ z )
| ( X5 @ X4 )
| ~ ( X2 @ X3 )
| ~ ( X1 @ X4 )
| ~ ( X5 @ X7 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_6,negated_conjecture,
( ( epred4_0 @ esk4_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ~ ( epred4_0 @ z ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ~ ( epred3_0 @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i > $o,X2: $i > $o,X3: $i,X4: $i] :
( ( epred1_0 @ esk1_0 )
| ( X1 @ z )
| ( X2 @ X3 )
| ~ ( X1 @ X3 )
| ~ ( X2 @ X4 ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]),c_0_8]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i > $o,X3: $i] :
( ( epred1_0 @ esk1_0 )
| ( X1 @ esk4_0 )
| ~ ( X1 @ X3 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_6]),c_0_7]) ).
thf(c_0_11,negated_conjecture,
( ( epred3_0 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_12,negated_conjecture,
epred1_0 @ esk1_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_4]),c_0_8]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i > $o,X3: $i,X2: $i > $o,X4: $i,X5: $i > $o,X7: $i] :
( ( epred3_0 @ X3 )
| ( X1 @ z )
| ( X2 @ z )
| ( X5 @ X4 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X2 @ X3 )
| ~ ( X1 @ X4 )
| ~ ( X5 @ X7 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_11]) ).
thf(c_0_14,negated_conjecture,
( ( epred4_0 @ esk4_0 )
| ~ ( epred1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_15,negated_conjecture,
( ~ ( epred4_0 @ z )
| ~ ( epred1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_16,negated_conjecture,
( ~ ( epred3_0 @ esk4_0 )
| ~ ( epred1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i > $o,X3: $i,X2: $i > $o,X4: $i,X5: $i > $o,X7: $i] :
( ( epred1_0 @ X3 )
| ( X1 @ z )
| ( X2 @ z )
| ( X5 @ X4 )
| ~ ( X2 @ X3 )
| ~ ( X1 @ X4 )
| ~ ( X5 @ X7 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_12]) ).
thf(c_0_18,negated_conjecture,
( ( epred4_0 @ esk4_0 )
| ( epred2_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_19,negated_conjecture,
( ( epred4_0 @ esk4_0 )
| ~ ( epred2_0 @ z ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_20,negated_conjecture,
! [X1: $i > $o,X2: $i > $o,X3: $i,X4: $i] :
( ( X1 @ z )
| ( X2 @ X3 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X1 @ X3 )
| ~ ( X2 @ X4 ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16]) ).
thf(c_0_21,negated_conjecture,
( ( epred3_0 @ esk3_0 )
| ( epred2_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_22,negated_conjecture,
( ( epred3_0 @ esk3_0 )
| ~ ( epred2_0 @ z ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_23,negated_conjecture,
! [X1: $i > $o,X2: $i > $o,X3: $i,X4: $i] :
( ( epred4_0 @ esk4_0 )
| ( X1 @ z )
| ( X2 @ X3 )
| ~ ( X1 @ X3 )
| ~ ( X2 @ X4 ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20]) ).
thf(c_0_24,negated_conjecture,
! [X1: $i > $o,X2: $i > $o,X3: $i,X4: $i] :
( ( epred3_0 @ esk3_0 )
| ( X1 @ z )
| ( X2 @ X3 )
| ~ ( X1 @ X3 )
| ~ ( X2 @ X4 ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_21]),c_0_22]),c_0_20]) ).
thf(c_0_25,negated_conjecture,
! [X1: $i > $o,X3: $i] :
( ( epred4_0 @ esk4_0 )
| ( X1 @ esk2_0 )
| ~ ( X1 @ X3 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_18]),c_0_19]) ).
thf(c_0_26,negated_conjecture,
( ( epred2_0 @ esk2_0 )
| ~ ( epred4_0 @ z ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_27,negated_conjecture,
( ~ ( epred4_0 @ z )
| ~ ( epred2_0 @ z ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_28,negated_conjecture,
! [X1: $i > $o,X3: $i] :
( ( epred3_0 @ esk3_0 )
| ( X1 @ esk2_0 )
| ~ ( X1 @ X3 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_21]),c_0_22]) ).
thf(c_0_29,negated_conjecture,
epred4_0 @ esk4_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_12]),c_0_14]) ).
thf(c_0_30,negated_conjecture,
! [X1: $i > $o,X2: $i > $o,X3: $i,X4: $i] :
( ( X1 @ z )
| ( X2 @ X3 )
| ~ ( epred4_0 @ z )
| ~ ( X1 @ X3 )
| ~ ( X2 @ X4 ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_26]),c_0_27]),c_0_15]) ).
thf(c_0_31,negated_conjecture,
epred3_0 @ esk3_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_12]),c_0_11]) ).
thf(c_0_32,negated_conjecture,
( ( epred2_0 @ esk2_0 )
| ~ ( epred3_0 @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_33,negated_conjecture,
( ~ ( epred3_0 @ esk4_0 )
| ~ ( epred2_0 @ z ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_34,negated_conjecture,
! [X1: $i > $o,X2: $i > $o,X3: $i,X4: $i] :
( ( epred1_0 @ esk4_0 )
| ( X1 @ z )
| ( X2 @ X3 )
| ~ ( X1 @ X3 )
| ~ ( X2 @ X4 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_29]),c_0_30]) ).
thf(c_0_35,negated_conjecture,
! [X1: $i > $o,X3: $i,X2: $i > $o,X4: $i,X5: $i > $o,X7: $i] :
( ( epred3_0 @ X3 )
| ( X1 @ z )
| ( X2 @ z )
| ( X5 @ X4 )
| ~ ( X2 @ X3 )
| ~ ( X1 @ X4 )
| ~ ( X5 @ X7 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_31]) ).
thf(c_0_36,negated_conjecture,
! [X1: $i > $o,X2: $i > $o,X3: $i,X4: $i] :
( ( X1 @ z )
| ( X2 @ X3 )
| ~ ( epred3_0 @ esk4_0 )
| ~ ( X1 @ X3 )
| ~ ( X2 @ X4 ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_32]),c_0_33]),c_0_16]) ).
thf(c_0_37,negated_conjecture,
! [X1: $i > $o,X3: $i] :
( ( epred4_0 @ z )
| ( epred1_0 @ esk4_0 )
| ( X1 @ esk4_0 )
| ~ ( X1 @ X3 ) ),
inference(spm,[status(thm)],[c_0_34,c_0_29]) ).
thf(c_0_38,negated_conjecture,
! [X1: $i > $o,X2: $i > $o,X3: $i,X4: $i] :
( ( X1 @ z )
| ( X2 @ X3 )
| ~ ( X1 @ X3 )
| ~ ( X2 @ X4 ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_29]),c_0_30]),c_0_36]) ).
thf(c_0_39,negated_conjecture,
( ( epred1_0 @ esk4_0 )
| ( epred4_0 @ z ) ),
inference(spm,[status(thm)],[c_0_37,c_0_12]) ).
thf(c_0_40,negated_conjecture,
! [X1: $i > $o,X3: $i] :
( ( epred4_0 @ z )
| ( X1 @ esk4_0 )
| ~ ( X1 @ X3 ) ),
inference(spm,[status(thm)],[c_0_38,c_0_29]) ).
thf(c_0_41,negated_conjecture,
! [X1: $i > $o,X3: $i] :
( ( epred2_0 @ z )
| ( epred1_0 @ esk4_0 )
| ( X1 @ esk2_0 )
| ~ ( X1 @ X3 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_26]),c_0_39]) ).
thf(c_0_42,negated_conjecture,
( ( epred1_0 @ esk4_0 )
| ~ ( epred1_0 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_15,c_0_39]) ).
thf(c_0_43,negated_conjecture,
! [X1: $i > $o,X3: $i] :
( ( X1 @ esk2_0 )
| ~ ( epred4_0 @ z )
| ~ ( X1 @ X3 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_26]),c_0_27]) ).
thf(c_0_44,negated_conjecture,
( ( epred3_0 @ esk4_0 )
| ( epred4_0 @ z ) ),
inference(spm,[status(thm)],[c_0_40,c_0_31]) ).
thf(c_0_45,negated_conjecture,
! [X1: $i > $o,X3: $i] :
( ( X1 @ esk2_0 )
| ~ ( epred3_0 @ esk4_0 )
| ~ ( X1 @ X3 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_32]),c_0_33]) ).
thf(c_0_46,negated_conjecture,
( ( epred1_0 @ esk4_0 )
| ( epred2_0 @ z ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_12]),c_0_42]) ).
thf(c_0_47,negated_conjecture,
! [X1: $i > $o,X3: $i] :
( ( X1 @ esk2_0 )
| ~ ( X1 @ X3 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
thf(c_0_48,negated_conjecture,
epred1_0 @ esk4_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_46]),c_0_39]) ).
thf(c_0_49,negated_conjecture,
~ ( epred1_0 @ esk2_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_44]),c_0_16]) ).
thf(c_0_50,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYO314^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n002.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 09:22:22 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running higher-order theorem proving
% 0.19/0.47 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
% 0.19/0.51 # Version: 3.1.0-ho
% 0.19/0.51 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.19/0.51 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_9 with 300s (1) cores
% 0.19/0.51 # Starting post_as_ho1 with 300s (1) cores
% 0.19/0.51 # Starting post_as_ho4 with 300s (1) cores
% 0.19/0.51 # Starting post_as_ho2 with 300s (1) cores
% 0.19/0.51 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.19/0.51 # Starting full_lambda_10 with 300s (1) cores
% 0.19/0.51 # Starting new_ho_8 with 300s (1) cores
% 0.19/0.51 # post_as_ho12 with pid 13852 completed with status 0
% 0.19/0.51 # Result found by post_as_ho12
% 0.19/0.51 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.19/0.51 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.19/0.51 # No SInE strategy applied
% 0.19/0.51 # Search class: HGHNF-FFSS00-SSSFFFBN
% 0.19/0.51 # partial match(1): HGHNF-FFSS00-SSSFFFNN
% 0.19/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.51 # new_ho_10 with pid 13863 completed with status 0
% 0.19/0.51 # Result found by new_ho_10
% 0.19/0.51 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.19/0.51 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.19/0.51 # No SInE strategy applied
% 0.19/0.51 # Search class: HGHNF-FFSS00-SSSFFFBN
% 0.19/0.51 # partial match(1): HGHNF-FFSS00-SSSFFFNN
% 0.19/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.51 # Preprocessing time : 0.001 s
% 0.19/0.51 # Presaturation interreduction done
% 0.19/0.51
% 0.19/0.51 # Proof found!
% 0.19/0.51 # SZS status Theorem
% 0.19/0.51 # SZS output start CNFRefutation
% See solution above
% 0.19/0.51 # Parsed axioms : 2
% 0.19/0.51 # Removed by relevancy pruning/SinE : 0
% 0.19/0.51 # Initial clauses : 18
% 0.19/0.51 # Removed in clause preprocessing : 1
% 0.19/0.51 # Initial clauses in saturation : 17
% 0.19/0.51 # Processed clauses : 168
% 0.19/0.51 # ...of these trivial : 0
% 0.19/0.51 # ...subsumed : 61
% 0.19/0.51 # ...remaining for further processing : 107
% 0.19/0.51 # Other redundant clauses eliminated : 0
% 0.19/0.51 # Clauses deleted for lack of memory : 0
% 0.19/0.51 # Backward-subsumed : 44
% 0.19/0.51 # Backward-rewritten : 25
% 0.19/0.51 # Generated clauses : 532
% 0.19/0.51 # ...of the previous two non-redundant : 479
% 0.19/0.51 # ...aggressively subsumed : 0
% 0.19/0.51 # Contextual simplify-reflections : 29
% 0.19/0.51 # Paramodulations : 532
% 0.19/0.51 # Factorizations : 0
% 0.19/0.51 # NegExts : 0
% 0.19/0.51 # Equation resolutions : 0
% 0.19/0.51 # Disequality decompositions : 0
% 0.19/0.51 # Total rewrite steps : 67
% 0.19/0.51 # ...of those cached : 63
% 0.19/0.51 # Propositional unsat checks : 0
% 0.19/0.51 # Propositional check models : 0
% 0.19/0.51 # Propositional check unsatisfiable : 0
% 0.19/0.51 # Propositional clauses : 0
% 0.19/0.51 # Propositional clauses after purity: 0
% 0.19/0.51 # Propositional unsat core size : 0
% 0.19/0.51 # Propositional preprocessing time : 0.000
% 0.19/0.51 # Propositional encoding time : 0.000
% 0.19/0.51 # Propositional solver time : 0.000
% 0.19/0.51 # Success case prop preproc time : 0.000
% 0.19/0.51 # Success case prop encoding time : 0.000
% 0.19/0.51 # Success case prop solver time : 0.000
% 0.19/0.51 # Current number of processed clauses : 21
% 0.19/0.51 # Positive orientable unit clauses : 4
% 0.19/0.51 # Positive unorientable unit clauses: 0
% 0.19/0.51 # Negative unit clauses : 1
% 0.19/0.51 # Non-unit-clauses : 16
% 0.19/0.51 # Current number of unprocessed clauses: 61
% 0.19/0.51 # ...number of literals in the above : 210
% 0.19/0.51 # Current number of archived formulas : 0
% 0.19/0.51 # Current number of archived clauses : 86
% 0.19/0.51 # Clause-clause subsumption calls (NU) : 1118
% 0.19/0.51 # Rec. Clause-clause subsumption calls : 398
% 0.19/0.51 # Non-unit clause-clause subsumptions : 129
% 0.19/0.51 # Unit Clause-clause subsumption calls : 6
% 0.19/0.51 # Rewrite failures with RHS unbound : 0
% 0.19/0.51 # BW rewrite match attempts : 4
% 0.19/0.51 # BW rewrite match successes : 4
% 0.19/0.51 # Condensation attempts : 168
% 0.19/0.51 # Condensation successes : 0
% 0.19/0.51 # Termbank termtop insertions : 24807
% 0.19/0.51 # Search garbage collected termcells : 328
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.025 s
% 0.19/0.51 # System time : 0.001 s
% 0.19/0.51 # Total time : 0.026 s
% 0.19/0.51 # Maximum resident set size: 1724 pages
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.025 s
% 0.19/0.51 # System time : 0.004 s
% 0.19/0.51 # Total time : 0.030 s
% 0.19/0.51 # Maximum resident set size: 1696 pages
% 0.19/0.51 % E---3.1 exiting
% 0.19/0.51 % E exiting
%------------------------------------------------------------------------------