TSTP Solution File: NUM697^4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM697^4 : TPTP v8.2.0. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 01:15:40 EDT 2024
% Result : Theorem 2.13s 0.87s
% Output : CNFRefutation 2.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 32
% Syntax : Number of formulae : 63 ( 29 unt; 19 typ; 0 def)
% Number of atoms : 158 ( 41 equ; 0 cnn)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 282 ( 30 ~; 16 |; 5 &; 203 @)
% ( 0 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 42 ( 42 >; 0 *; 0 +; 0 <<)
% Number of symbols : 22 ( 19 usr; 6 con; 0-3 aty)
% Number of variables : 68 ( 54 ^ 14 !; 0 ?; 68 :)
% 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_47,type,
ordsucc: $i > $i ).
thf(decl_61,type,
imp: $o > $o > $o ).
thf(decl_62,type,
d_not: $o > $o ).
thf(decl_67,type,
l_or: $o > $o > $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_130,type,
n_1: $i ).
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_151,type,
moreis: $i > $i > $o ).
thf(decl_155,type,
esk1_0: $i ).
thf(decl_156,type,
esk2_0: $i ).
thf(def_d_not,axiom,
( d_not
= ( ^ [X76: $o] : ( imp @ X76 @ ~ $true ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax',def_d_not) ).
thf(def_imp,axiom,
( imp
= ( ^ [X74: $o,X75: $o] :
( X74
=> X75 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax',def_imp) ).
thf(def_d_29_ii,axiom,
( d_29_ii
= ( ^ [X1: $i,X210: $i] : ( n_some @ ( diffprop @ X1 @ X210 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_d_29_ii) ).
thf(def_l_or,axiom,
( l_or
= ( ^ [X83: $o] : ( imp @ ( d_not @ X83 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax',def_l_or) ).
thf(def_e_is,axiom,
( e_is
= ( ^ [X1: $i,X101: $i,X102: $i] : ( X101 = X102 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax',def_e_is) ).
thf(def_moreis,axiom,
( moreis
= ( ^ [X1: $i,X229: $i] : ( l_or @ ( d_29_ii @ X1 @ X229 ) @ ( n_is @ X1 @ X229 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_moreis) ).
thf(def_n_some,axiom,
( n_some
= ( l_some @ nat ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax',def_n_some) ).
thf(def_n_is,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax',def_n_is) ).
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/benchmark/Axioms/NUM007^0.ax',def_all_of) ).
thf(def_is_of,axiom,
( is_of
= ( ^ [X1: $i,X2: $i > $o] : ( X2 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax',def_is_of) ).
thf(satz25a,conjecture,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X325: $i] : ( in @ X325 @ nat )
@ ^ [X326: $i] :
( ( d_29_ii @ X326 @ X1 )
=> ( moreis @ X326 @ ( ordsucc @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz25a) ).
thf(satz4e,axiom,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] : ( n_is @ ( ordsucc @ X1 ) @ ( n_pl @ X1 @ n_1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz4e) ).
thf(satz25,axiom,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X323: $i] : ( in @ X323 @ nat )
@ ^ [X324: $i] :
( ( d_29_ii @ X324 @ X1 )
=> ( moreis @ X324 @ ( n_pl @ X1 @ n_1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz25) ).
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,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] : ( l_some @ nat @ ( diffprop @ Z0 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_d_29_ii]) ).
thf(c_0_16,plain,
( l_or
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ~ $true )
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_l_or]) ).
thf(c_0_17,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_18,plain,
( e_is
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( Z1 = Z2 ) ) ),
inference(fof_simplification,[status(thm)],[def_e_is]) ).
thf(c_0_19,plain,
( moreis
= ( ^ [Z0: $i,Z1: $i] :
( ( ( l_some @ nat @ ( diffprop @ Z0 @ Z1 ) )
=> ~ $true )
=> ( Z0 = Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_moreis]) ).
thf(c_0_20,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] : ( l_some @ nat @ ( diffprop @ Z0 @ Z1 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_15,def_n_some]) ).
thf(c_0_21,plain,
( l_or
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ~ $true )
=> Z1 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_16,c_0_14]),c_0_17]) ).
thf(c_0_22,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
inference(apply_def,[status(thm)],[def_n_is,c_0_18]) ).
thf(c_0_23,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_24,plain,
( is_of
= ( ^ [Z0: $i,Z1: $i > $o] : ( Z1 @ Z0 ) ) ),
inference(fof_simplification,[status(thm)],[def_is_of]) ).
thf(c_0_25,plain,
( moreis
= ( ^ [Z0: $i,Z1: $i] :
( ( ( l_some @ nat @ ( diffprop @ Z0 @ Z1 ) )
=> ~ $true )
=> ( Z0 = Z1 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]) ).
thf(c_0_26,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_23,c_0_24]) ).
thf(c_0_27,negated_conjecture,
~ ! [X418: $i] :
( ( in @ X418 @ nat )
=> ! [X417: $i] :
( ( in @ X417 @ nat )
=> ( ( l_some @ nat @ ( diffprop @ X417 @ X418 ) )
=> ( ( ( l_some @ nat @ ( diffprop @ X417 @ ( ordsucc @ X418 ) ) )
=> ~ $true )
=> ( X417
= ( ordsucc @ X418 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz25a])]),c_0_25]),c_0_20]),c_0_26]) ).
thf(c_0_28,negated_conjecture,
( ( in @ esk1_0 @ nat )
& ( in @ esk2_0 @ nat )
& ( l_some @ nat @ ( diffprop @ esk2_0 @ esk1_0 ) )
& ( ~ ( l_some @ nat @ ( diffprop @ esk2_0 @ ( ordsucc @ esk1_0 ) ) )
| ~ $true )
& ( esk2_0
!= ( ordsucc @ esk1_0 ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])])]) ).
thf(c_0_29,plain,
! [X556: $i] :
( ( in @ X556 @ nat )
=> ( ( ordsucc @ X556 )
= ( n_pl @ X556 @ n_1 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz4e]),c_0_26]),c_0_22]) ).
thf(c_0_30,negated_conjecture,
( ~ ( l_some @ nat @ ( diffprop @ esk2_0 @ ( ordsucc @ esk1_0 ) ) )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_31,plain,
! [X792: $i] :
( ~ ( in @ X792 @ nat )
| ( ( ordsucc @ X792 )
= ( n_pl @ X792 @ n_1 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])]) ).
thf(c_0_32,plain,
! [X548: $i] :
( ( in @ X548 @ nat )
=> ! [X547: $i] :
( ( in @ X547 @ nat )
=> ( ( l_some @ nat @ ( diffprop @ X547 @ X548 ) )
=> ( ( ( l_some @ nat @ ( diffprop @ X547 @ ( n_pl @ X548 @ n_1 ) ) )
=> ~ $true )
=> ( X547
= ( n_pl @ X548 @ n_1 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz25]),c_0_25]),c_0_20]),c_0_26]) ).
thf(c_0_33,negated_conjecture,
~ ( l_some @ nat @ ( diffprop @ esk2_0 @ ( ordsucc @ esk1_0 ) ) ),
inference(cn,[status(thm)],[c_0_30]) ).
thf(c_0_34,plain,
! [X1: $i] :
( ( ( ordsucc @ X1 )
= ( n_pl @ X1 @ n_1 ) )
| ~ ( in @ X1 @ nat ) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_35,negated_conjecture,
in @ esk1_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_36,plain,
! [X777: $i,X778: $i] :
( ( ( l_some @ nat @ ( diffprop @ X778 @ ( n_pl @ X777 @ n_1 ) ) )
| ( X778
= ( n_pl @ X777 @ n_1 ) )
| ~ ( l_some @ nat @ ( diffprop @ X778 @ X777 ) )
| ~ ( in @ X778 @ nat )
| ~ ( in @ X777 @ nat ) )
& ( $true
| ( X778
= ( n_pl @ X777 @ n_1 ) )
| ~ ( l_some @ nat @ ( diffprop @ X778 @ X777 ) )
| ~ ( in @ X778 @ nat )
| ~ ( in @ X777 @ nat ) ) ),
inference(distribute,[status(thm)],[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_37,negated_conjecture,
( esk2_0
!= ( ordsucc @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_38,negated_conjecture,
~ ( l_some @ nat @ ( diffprop @ esk2_0 @ ( n_pl @ esk1_0 @ n_1 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
thf(c_0_39,plain,
! [X1: $i,X4: $i] :
( ( l_some @ nat @ ( diffprop @ X1 @ ( n_pl @ X4 @ n_1 ) ) )
| ( X1
= ( n_pl @ X4 @ n_1 ) )
| ~ ( l_some @ nat @ ( diffprop @ X1 @ X4 ) )
| ~ ( in @ X1 @ nat )
| ~ ( in @ X4 @ nat ) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
thf(c_0_40,negated_conjecture,
l_some @ nat @ ( diffprop @ esk2_0 @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_41,negated_conjecture,
in @ esk2_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_42,negated_conjecture,
( ( n_pl @ esk1_0 @ n_1 )
!= esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_34]),c_0_35])]) ).
thf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_35]),c_0_41])]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM697^4 : TPTP v8.2.0. Released v7.1.0.
% 0.11/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n003.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon May 20 03:41:52 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.18/0.47 Running higher-order theorem proving
% 0.18/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.18/0.55 # Type mismatch in argument #1 of prop2 @ ($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.18/0.55 eprover: Type error
% 0.18/0.57 # Type mismatch in argument #1 of prop2 @ ($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.18/0.57 eprover: Type error
% 0.76/0.59 # Type mismatch in argument #1 of prop2 @ ($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.76/0.59 eprover: Type error
% 0.76/0.59 # 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.76/0.59 eprover: Type error
% 0.82/0.61 # Type mismatch in argument #1 of prop2 @ ($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.82/0.61 eprover: Type error
% 0.82/0.63 # Type mismatch in argument #1 of prop2 @ ($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.82/0.63 eprover: Type error
% 0.86/0.65 # Type mismatch in argument #1 of prop2 @ ($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.86/0.65 eprover: Type error
% 0.86/0.70 # Type mismatch in argument #1 of prop2 @ ($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.86/0.70 eprover: Type error
% 0.86/0.73 # Type mismatch in argument #1 of prop2 @ ($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.86/0.73 eprover: Type error
% 1.00/0.75 # Type mismatch in argument #1 of prop2 @ ($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
% 1.00/0.75 eprover: Type error
% 1.00/0.76 # Type mismatch in argument #1 of prop2 @ ($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
% 1.00/0.76 eprover: Type error
% 1.00/0.79 # Type mismatch in argument #1 of prop2 @ ($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
% 1.00/0.79 eprover: Type error
% 2.13/0.87 # Version: 3.1.0-ho
% 2.13/0.87 # Preprocessing class: HSLMSMSSLLLCHSA.
% 2.13/0.87 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 2.13/0.87 # Starting lpo1_fix with 900s (3) cores
% 2.13/0.87 # Starting full_lambda_9 with 300s (1) cores
% 2.13/0.87 # Starting almost_fo_4 with 300s (1) cores
% 2.13/0.87 # Starting new_ho_9 with 300s (1) cores
% 2.13/0.87 # Starting pre_casc_4 with 300s (1) cores
% 2.13/0.87 # Starting ho_unfolding_6 with 300s (1) cores
% 2.13/0.87 # full_lambda_9 with pid 7546 completed with status 0
% 2.13/0.87 # Result found by full_lambda_9
% 2.13/0.87 # Preprocessing class: HSLMSMSSLLLCHSA.
% 2.13/0.87 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 2.13/0.87 # Starting lpo1_fix with 900s (3) cores
% 2.13/0.87 # Starting full_lambda_9 with 300s (1) cores
% 2.13/0.87 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 2.13/0.87 # Search class: HGHSM-FSLM32-DHSMMSBN
% 2.13/0.87 # partial match(1): HGHSM-FSLM32-MHSMMSBN
% 2.13/0.87 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 2.13/0.87 # Starting full_lambda_5 with 25s (1) cores
% 2.13/0.87 # full_lambda_5 with pid 7552 completed with status 3
% 2.13/0.87 # Starting full_lambda_9 with 31s (1) cores
% 2.13/0.87 # full_lambda_9 with pid 7553 completed with status 3
% 2.13/0.87 # Starting pre_casc_4 with 25s (1) cores
% 2.13/0.87 # pre_casc_4 with pid 7560 completed with status 3
% 2.13/0.87 # Starting pre_casc_3 with 25s (1) cores
% 2.13/0.87 # pre_casc_3 with pid 7561 completed with status 3
% 2.13/0.87 # Starting almost_fo_4 with 25s (1) cores
% 2.13/0.87 # almost_fo_4 with pid 7563 completed with status 3
% 2.13/0.87 # Starting post_as_ho9 with 25s (1) cores
% 2.13/0.87 # post_as_ho9 with pid 7564 completed with status 3
% 2.13/0.87 # Starting new_ho_9 with 25s (1) cores
% 2.13/0.87 # new_ho_9 with pid 7565 completed with status 3
% 2.13/0.87 # Starting ho_unfolding_8 with 25s (1) cores
% 2.13/0.87 # ho_unfolding_8 with pid 7566 completed with status 3
% 2.13/0.87 # Starting lpo1_fix with 25s (1) cores
% 2.13/0.87 # lpo1_fix with pid 7567 completed with status 3
% 2.13/0.87 # Starting post_as_ho5 with 25s (1) cores
% 2.13/0.87 # post_as_ho5 with pid 7568 completed with status 3
% 2.13/0.87 # Starting ho_unfolding_6 with 25s (1) cores
% 2.13/0.87 # ho_unfolding_6 with pid 7569 completed with status 3
% 2.13/0.87 # Starting new_ho_6 with 19s (1) cores
% 2.13/0.87 # new_ho_6 with pid 7570 completed with status 0
% 2.13/0.87 # Result found by new_ho_6
% 2.13/0.87 # Preprocessing class: HSLMSMSSLLLCHSA.
% 2.13/0.87 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 2.13/0.87 # Starting lpo1_fix with 900s (3) cores
% 2.13/0.87 # Starting full_lambda_9 with 300s (1) cores
% 2.13/0.87 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 2.13/0.87 # Search class: HGHSM-FSLM32-DHSMMSBN
% 2.13/0.87 # partial match(1): HGHSM-FSLM32-MHSMMSBN
% 2.13/0.87 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 2.13/0.87 # Starting full_lambda_5 with 25s (1) cores
% 2.13/0.87 # full_lambda_5 with pid 7552 completed with status 3
% 2.13/0.87 # Starting full_lambda_9 with 31s (1) cores
% 2.13/0.87 # full_lambda_9 with pid 7553 completed with status 3
% 2.13/0.87 # Starting pre_casc_4 with 25s (1) cores
% 2.13/0.87 # pre_casc_4 with pid 7560 completed with status 3
% 2.13/0.87 # Starting pre_casc_3 with 25s (1) cores
% 2.13/0.87 # pre_casc_3 with pid 7561 completed with status 3
% 2.13/0.87 # Starting almost_fo_4 with 25s (1) cores
% 2.13/0.87 # almost_fo_4 with pid 7563 completed with status 3
% 2.13/0.87 # Starting post_as_ho9 with 25s (1) cores
% 2.13/0.87 # post_as_ho9 with pid 7564 completed with status 3
% 2.13/0.87 # Starting new_ho_9 with 25s (1) cores
% 2.13/0.87 # new_ho_9 with pid 7565 completed with status 3
% 2.13/0.87 # Starting ho_unfolding_8 with 25s (1) cores
% 2.13/0.87 # ho_unfolding_8 with pid 7566 completed with status 3
% 2.13/0.87 # Starting lpo1_fix with 25s (1) cores
% 2.13/0.87 # lpo1_fix with pid 7567 completed with status 3
% 2.13/0.87 # Starting post_as_ho5 with 25s (1) cores
% 2.13/0.87 # post_as_ho5 with pid 7568 completed with status 3
% 2.13/0.87 # Starting ho_unfolding_6 with 25s (1) cores
% 2.13/0.87 # ho_unfolding_6 with pid 7569 completed with status 3
% 2.13/0.87 # Starting new_ho_6 with 19s (1) cores
% 2.13/0.87 # Preprocessing time : 0.005 s
% 2.13/0.87
% 2.13/0.87 # Proof found!
% 2.13/0.87 # SZS status Theorem
% 2.13/0.87 # SZS output start CNFRefutation
% See solution above
% 2.13/0.87 # Parsed axioms : 402
% 2.13/0.87 # Removed by relevancy pruning/SinE : 231
% 2.13/0.87 # Initial clauses : 423
% 2.13/0.87 # Removed in clause preprocessing : 187
% 2.13/0.87 # Initial clauses in saturation : 236
% 2.13/0.87 # Processed clauses : 720
% 2.13/0.87 # ...of these trivial : 48
% 2.13/0.87 # ...subsumed : 281
% 2.13/0.87 # ...remaining for further processing : 391
% 2.13/0.87 # Other redundant clauses eliminated : 12
% 2.13/0.87 # Clauses deleted for lack of memory : 0
% 2.13/0.87 # Backward-subsumed : 5
% 2.13/0.87 # Backward-rewritten : 10
% 2.13/0.87 # Generated clauses : 1568
% 2.13/0.87 # ...of the previous two non-redundant : 1492
% 2.13/0.87 # ...aggressively subsumed : 0
% 2.13/0.87 # Contextual simplify-reflections : 4
% 2.13/0.87 # Paramodulations : 1447
% 2.13/0.87 # Factorizations : 2
% 2.13/0.87 # NegExts : 0
% 2.13/0.87 # Equation resolutions : 54
% 2.13/0.87 # Disequality decompositions : 0
% 2.13/0.87 # Total rewrite steps : 505
% 2.13/0.87 # ...of those cached : 451
% 2.13/0.87 # Propositional unsat checks : 0
% 2.13/0.87 # Propositional check models : 0
% 2.13/0.87 # Propositional check unsatisfiable : 0
% 2.13/0.87 # Propositional clauses : 0
% 2.13/0.87 # Propositional clauses after purity: 0
% 2.13/0.87 # Propositional unsat core size : 0
% 2.13/0.87 # Propositional preprocessing time : 0.000
% 2.13/0.87 # Propositional encoding time : 0.000
% 2.13/0.87 # Propositional solver time : 0.000
% 2.13/0.87 # Success case prop preproc time : 0.000
% 2.13/0.87 # Success case prop encoding time : 0.000
% 2.13/0.87 # Success case prop solver time : 0.000
% 2.13/0.87 # Current number of processed clauses : 370
% 2.13/0.87 # Positive orientable unit clauses : 77
% 2.13/0.87 # Positive unorientable unit clauses: 18
% 2.13/0.87 # Negative unit clauses : 64
% 2.13/0.87 # Non-unit-clauses : 211
% 2.13/0.87 # Current number of unprocessed clauses: 999
% 2.13/0.87 # ...number of literals in the above : 3454
% 2.13/0.87 # Current number of archived formulas : 0
% 2.13/0.87 # Current number of archived clauses : 15
% 2.13/0.87 # Clause-clause subsumption calls (NU) : 8558
% 2.13/0.87 # Rec. Clause-clause subsumption calls : 5601
% 2.13/0.87 # Non-unit clause-clause subsumptions : 155
% 2.13/0.87 # Unit Clause-clause subsumption calls : 2302
% 2.13/0.87 # Rewrite failures with RHS unbound : 152
% 2.13/0.87 # BW rewrite match attempts : 130
% 2.13/0.87 # BW rewrite match successes : 20
% 2.13/0.87 # Condensation attempts : 720
% 2.13/0.87 # Condensation successes : 0
% 2.13/0.87 # Termbank termtop insertions : 77198
% 2.13/0.87 # Search garbage collected termcells : 20229
% 2.13/0.87
% 2.13/0.87 # -------------------------------------------------
% 2.13/0.87 # User time : 0.216 s
% 2.13/0.87 # System time : 0.052 s
% 2.13/0.87 # Total time : 0.268 s
% 2.13/0.87 # Maximum resident set size: 5492 pages
% 2.13/0.87
% 2.13/0.87 # -------------------------------------------------
% 2.13/0.87 # User time : 0.227 s
% 2.13/0.87 # System time : 0.055 s
% 2.13/0.87 # Total time : 0.283 s
% 2.13/0.87 # Maximum resident set size: 2384 pages
% 2.13/0.87 % E---3.1 exiting
% 2.13/0.88 % E exiting
%------------------------------------------------------------------------------