TSTP Solution File: NUM693^4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM693^4 : TPTP v8.2.0. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:38 EDT 2024
% Result : Theorem 1.19s 0.65s
% Output : CNFRefutation 1.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 38
% Syntax : Number of formulae : 80 ( 43 unt; 21 typ; 0 def)
% Number of atoms : 229 ( 76 equ; 0 cnn)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 358 ( 68 ~; 38 |; 8 &; 187 @)
% ( 0 <=>; 57 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 57 ( 57 >; 0 *; 0 +; 0 <<)
% Number of symbols : 24 ( 21 usr; 5 con; 0-3 aty)
% Number of variables : 110 ( 84 ^ 26 !; 0 ?; 110 :)
% 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_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_125,type,
nis: $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_185,type,
esk29_1: $i > $i ).
thf(decl_244,type,
esk88_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_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(def_non,axiom,
( non
= ( ^ [X1: $i,X2: $i > $o,X4: $i] : ( d_not @ ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax',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/benchmark/Axioms/NUM007^0.ax',def_l_some) ).
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_diffprop,axiom,
( diffprop
= ( ^ [X1: $i,X207: $i,X4: $i] : ( n_is @ X1 @ ( n_pl @ X207 @ X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_diffprop) ).
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_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_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_n_some,axiom,
( n_some
= ( ^ [Z0: $i > $o] :
( ! [X495: $i] :
( ( in @ X495 @ nat )
=> ( ( Z0 @ X495 )
=> ~ $true ) )
=> ~ $true ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax',def_n_some) ).
thf(def_nis,axiom,
( nis
= ( ^ [X1: $i,X165: $i] : ( d_not @ ( n_is @ X1 @ X165 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax',def_nis) ).
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(satz3,axiom,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( ( nis @ X1 @ n_1 )
=> ( n_some
@ ^ [X175: $i] : ( n_is @ X1 @ ( ordsucc @ X175 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz3) ).
thf(satz24,conjecture,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] : ( moreis @ X1 @ n_1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz24) ).
thf(satz4g,axiom,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] : ( n_is @ ( ordsucc @ X1 ) @ ( n_pl @ n_1 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz4g) ).
thf(c_0_17,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_not]) ).
thf(c_0_18,plain,
( imp
= ( ^ [Z0: $o,Z1: $o] :
( Z0
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_imp]) ).
thf(c_0_19,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_20,plain,
( is_of
= ( ^ [Z0: $i,Z1: $i > $o] : ( Z1 @ Z0 ) ) ),
inference(fof_simplification,[status(thm)],[def_is_of]) ).
thf(c_0_21,plain,
( non
= ( ^ [Z0: $i,Z1: $i > $o,Z2: $i] :
( ( Z1 @ Z2 )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_non]) ).
thf(c_0_22,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_23,plain,
( l_some
= ( ^ [Z0: $i,Z1: $i > $o] :
( ! [X468: $i] :
( ( in @ X468 @ Z0 )
=> ( ( Z1 @ X468 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_l_some]) ).
thf(c_0_24,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_25,plain,
( non
= ( ^ [Z0: $i,Z1: $i > $o,Z2: $i] :
( ( Z1 @ Z2 )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_26,plain,
( e_is
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( Z1 = Z2 ) ) ),
inference(fof_simplification,[status(thm)],[def_e_is]) ).
thf(c_0_27,plain,
( l_some
= ( ^ [Z0: $i,Z1: $i > $o] :
( ! [X468: $i] :
( ( in @ X468 @ Z0 )
=> ( ( Z1 @ X468 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_23,c_0_24]),c_0_22]),c_0_25]) ).
thf(c_0_28,plain,
( diffprop
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_diffprop]) ).
thf(c_0_29,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
inference(apply_def,[status(thm)],[def_n_is,c_0_26]) ).
thf(c_0_30,plain,
( l_or
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ~ $true )
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_l_or]) ).
thf(c_0_31,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] :
( ! [X506: $i] :
( ( in @ X506 @ nat )
=> ( ( Z0
= ( n_pl @ Z1 @ X506 ) )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_29_ii]) ).
thf(c_0_32,axiom,
( n_some
= ( ^ [Z0: $i > $o] :
( ! [X495: $i] :
( ( in @ X495 @ nat )
=> ( ( Z0 @ X495 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[def_n_some,c_0_27]) ).
thf(c_0_33,plain,
( diffprop
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_28,c_0_29]) ).
thf(c_0_34,plain,
( nis
= ( ^ [Z0: $i,Z1: $i] :
( ( Z0 = Z1 )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_nis]) ).
thf(c_0_35,plain,
( moreis
= ( ^ [Z0: $i,Z1: $i] :
( ( ( ! [X510: $i] :
( ( in @ X510 @ nat )
=> ( ( Z0
= ( n_pl @ Z1 @ X510 ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true )
=> ( Z0 = Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_moreis]) ).
thf(c_0_36,plain,
( l_or
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ~ $true )
=> Z1 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_30,c_0_18]),c_0_22]) ).
thf(c_0_37,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] :
( ! [X506: $i] :
( ( in @ X506 @ nat )
=> ( ( Z0
= ( n_pl @ Z1 @ X506 ) )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
thf(c_0_38,plain,
( nis
= ( ^ [Z0: $i,Z1: $i] :
( ( Z0 = Z1 )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_34,c_0_22]),c_0_29]) ).
thf(c_0_39,plain,
( moreis
= ( ^ [Z0: $i,Z1: $i] :
( ( ( ! [X510: $i] :
( ( in @ X510 @ nat )
=> ( ( Z0
= ( n_pl @ Z1 @ X510 ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true )
=> ( Z0 = Z1 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_35,c_0_36]),c_0_29]),c_0_37]) ).
thf(c_0_40,plain,
! [X596: $i] :
( ( in @ X596 @ nat )
=> ( ( ( X596 = n_1 )
=> ~ $true )
=> ( ! [X595: $i] :
( ( in @ X595 @ nat )
=> ( ( X596
= ( ordsucc @ X595 ) )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz3]),c_0_24]),c_0_29]),c_0_38]),c_0_32]) ).
thf(c_0_41,negated_conjecture,
~ ! [X907: $i] :
( ( in @ X907 @ nat )
=> ( ( ( ! [X906: $i] :
( ( in @ X906 @ nat )
=> ( ( X907
= ( n_pl @ n_1 @ X906 ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true )
=> ( X907 = n_1 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz24])]),c_0_24]),c_0_39]) ).
thf(c_0_42,plain,
! [X1357: $i] :
( ( ( in @ ( esk29_1 @ X1357 ) @ nat )
| ~ $true
| ( X1357 = n_1 )
| ~ ( in @ X1357 @ nat ) )
& ( ( X1357
= ( ordsucc @ ( esk29_1 @ X1357 ) ) )
| ~ $true
| ( X1357 = n_1 )
| ~ ( in @ X1357 @ nat ) )
& ( $true
| ~ $true
| ( X1357 = n_1 )
| ~ ( in @ X1357 @ nat ) )
& ( ( in @ ( esk29_1 @ X1357 ) @ nat )
| ~ $true
| $true
| ~ ( in @ X1357 @ nat ) )
& ( ( X1357
= ( ordsucc @ ( esk29_1 @ X1357 ) ) )
| ~ $true
| $true
| ~ ( in @ X1357 @ nat ) )
& ( $true
| ~ $true
| $true
| ~ ( in @ X1357 @ nat ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_40])])])])]) ).
thf(c_0_43,negated_conjecture,
! [X1685: $i] :
( ( in @ esk88_0 @ nat )
& ( ~ ( in @ X1685 @ nat )
| ( esk88_0
!= ( n_pl @ n_1 @ X1685 ) )
| ~ $true
| ~ $true )
& ( $true
| ~ $true )
& ( esk88_0 != n_1 ) ),
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_41])])])])])]) ).
thf(c_0_44,plain,
! [X1: $i] :
( ( in @ ( esk29_1 @ X1 ) @ nat )
| ( X1 = n_1 )
| ~ $true
| ~ ( in @ X1 @ nat ) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
thf(c_0_45,plain,
! [X616: $i] :
( ( in @ X616 @ nat )
=> ( ( ordsucc @ X616 )
= ( n_pl @ n_1 @ X616 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz4g]),c_0_24]),c_0_29]) ).
thf(c_0_46,plain,
! [X1: $i] :
( ( X1
= ( ordsucc @ ( esk29_1 @ X1 ) ) )
| ( X1 = n_1 )
| ~ $true
| ~ ( in @ X1 @ nat ) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
thf(c_0_47,negated_conjecture,
! [X1: $i] :
( ~ ( in @ X1 @ nat )
| ( esk88_0
!= ( n_pl @ n_1 @ X1 ) )
| ~ $true
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
thf(c_0_48,plain,
! [X1: $i] :
( ( X1 = n_1 )
| ( in @ ( esk29_1 @ X1 ) @ nat )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[c_0_44]) ).
thf(c_0_49,negated_conjecture,
in @ esk88_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_43]) ).
thf(c_0_50,negated_conjecture,
esk88_0 != n_1,
inference(split_conjunct,[status(thm)],[c_0_43]) ).
thf(c_0_51,plain,
! [X1382: $i] :
( ~ ( in @ X1382 @ nat )
| ( ( ordsucc @ X1382 )
= ( n_pl @ n_1 @ X1382 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_45])])]) ).
thf(c_0_52,plain,
! [X1: $i] :
( ( X1 = n_1 )
| ( X1
= ( ordsucc @ ( esk29_1 @ X1 ) ) )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[c_0_46]) ).
thf(c_0_53,negated_conjecture,
! [X1: $i] :
( ( esk88_0
!= ( n_pl @ n_1 @ X1 ) )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[c_0_47]) ).
thf(c_0_54,negated_conjecture,
in @ ( esk29_1 @ esk88_0 ) @ nat,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]) ).
thf(c_0_55,plain,
! [X1: $i] :
( ( ( ordsucc @ X1 )
= ( n_pl @ n_1 @ X1 ) )
| ~ ( in @ X1 @ nat ) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
thf(c_0_56,negated_conjecture,
( ( ordsucc @ ( esk29_1 @ esk88_0 ) )
= esk88_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_49]),c_0_50]) ).
thf(c_0_57,negated_conjecture,
( ( n_pl @ n_1 @ ( esk29_1 @ esk88_0 ) )
!= esk88_0 ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
thf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_54]),c_0_56]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.09 % Problem : NUM693^4 : TPTP v8.2.0. Released v7.1.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n021.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon May 20 05:38:52 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.15/0.41 Running higher-order theorem proving
% 0.15/0.41 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.83/0.57 # 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.83/0.57 eprover: Type error
% 0.83/0.62 # 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.83/0.62 eprover: Type error
% 1.19/0.64 # 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.19/0.64 eprover: Type error
% 1.19/0.65 # Version: 3.1.0-ho
% 1.19/0.65 # Preprocessing class: HSLMSMSSLLLCHSA.
% 1.19/0.65 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 1.19/0.65 # Starting lpo1_fix with 900s (3) cores
% 1.19/0.65 # Starting full_lambda_9 with 300s (1) cores
% 1.19/0.65 # Starting almost_fo_4 with 300s (1) cores
% 1.19/0.65 # Starting new_ho_9 with 300s (1) cores
% 1.19/0.65 # Starting pre_casc_4 with 300s (1) cores
% 1.19/0.65 # Starting ho_unfolding_6 with 300s (1) cores
% 1.19/0.65 # lpo1_fix with pid 22195 completed with status 0
% 1.19/0.65 # Result found by lpo1_fix
% 1.19/0.65 # Preprocessing class: HSLMSMSSLLLCHSA.
% 1.19/0.65 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 1.19/0.65 # Starting lpo1_fix with 900s (3) cores
% 1.19/0.65 # No SInE strategy applied
% 1.19/0.65 # Search class: HGHSM-FSLM32-MHSMMSBN
% 1.19/0.65 # Scheduled 11 strats onto 3 cores with 900 seconds (900 total)
% 1.19/0.65 # Starting full_lambda_5 with 82s (1) cores
% 1.19/0.65 # Starting new_ho_6 with 82s (1) cores
% 1.19/0.65 # Starting pre_casc_4 with 82s (1) cores
% 1.19/0.65 # pre_casc_4 with pid 22207 completed with status 0
% 1.19/0.65 # Result found by pre_casc_4
% 1.19/0.65 # Preprocessing class: HSLMSMSSLLLCHSA.
% 1.19/0.65 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 1.19/0.65 # Starting lpo1_fix with 900s (3) cores
% 1.19/0.65 # No SInE strategy applied
% 1.19/0.65 # Search class: HGHSM-FSLM32-MHSMMSBN
% 1.19/0.65 # Scheduled 11 strats onto 3 cores with 900 seconds (900 total)
% 1.19/0.65 # Starting full_lambda_5 with 82s (1) cores
% 1.19/0.65 # Starting new_ho_6 with 82s (1) cores
% 1.19/0.65 # Starting pre_casc_4 with 82s (1) cores
% 1.19/0.65 # Preprocessing time : 0.010 s
% 1.19/0.65 # Presaturation interreduction done
% 1.19/0.65
% 1.19/0.65 # Proof found!
% 1.19/0.65 # SZS status Theorem
% 1.19/0.65 # SZS output start CNFRefutation
% See solution above
% 1.19/0.65 # Parsed axioms : 397
% 1.19/0.65 # Removed by relevancy pruning/SinE : 0
% 1.19/0.65 # Initial clauses : 1158
% 1.19/0.65 # Removed in clause preprocessing : 714
% 1.19/0.65 # Initial clauses in saturation : 444
% 1.19/0.65 # Processed clauses : 799
% 1.19/0.65 # ...of these trivial : 4
% 1.19/0.65 # ...subsumed : 70
% 1.19/0.65 # ...remaining for further processing : 724
% 1.19/0.65 # Other redundant clauses eliminated : 201
% 1.19/0.65 # Clauses deleted for lack of memory : 0
% 1.19/0.65 # Backward-subsumed : 0
% 1.19/0.65 # Backward-rewritten : 9
% 1.19/0.65 # Generated clauses : 547
% 1.19/0.65 # ...of the previous two non-redundant : 530
% 1.19/0.65 # ...aggressively subsumed : 0
% 1.19/0.65 # Contextual simplify-reflections : 10
% 1.19/0.65 # Paramodulations : 384
% 1.19/0.65 # Factorizations : 0
% 1.19/0.65 # NegExts : 0
% 1.19/0.65 # Equation resolutions : 202
% 1.19/0.65 # Disequality decompositions : 0
% 1.19/0.65 # Total rewrite steps : 93
% 1.19/0.65 # ...of those cached : 54
% 1.19/0.65 # Propositional unsat checks : 0
% 1.19/0.65 # Propositional check models : 0
% 1.19/0.65 # Propositional check unsatisfiable : 0
% 1.19/0.65 # Propositional clauses : 0
% 1.19/0.65 # Propositional clauses after purity: 0
% 1.19/0.65 # Propositional unsat core size : 0
% 1.19/0.65 # Propositional preprocessing time : 0.000
% 1.19/0.65 # Propositional encoding time : 0.000
% 1.19/0.65 # Propositional solver time : 0.000
% 1.19/0.65 # Success case prop preproc time : 0.000
% 1.19/0.65 # Success case prop encoding time : 0.000
% 1.19/0.65 # Success case prop solver time : 0.000
% 1.19/0.65 # Current number of processed clauses : 186
% 1.19/0.65 # Positive orientable unit clauses : 72
% 1.19/0.65 # Positive unorientable unit clauses: 0
% 1.19/0.65 # Negative unit clauses : 35
% 1.19/0.65 # Non-unit-clauses : 79
% 1.19/0.65 # Current number of unprocessed clauses: 577
% 1.19/0.65 # ...number of literals in the above : 1774
% 1.19/0.65 # Current number of archived formulas : 0
% 1.19/0.65 # Current number of archived clauses : 412
% 1.19/0.65 # Clause-clause subsumption calls (NU) : 96374
% 1.19/0.65 # Rec. Clause-clause subsumption calls : 6243
% 1.19/0.65 # Non-unit clause-clause subsumptions : 50
% 1.19/0.65 # Unit Clause-clause subsumption calls : 1427
% 1.19/0.65 # Rewrite failures with RHS unbound : 0
% 1.19/0.65 # BW rewrite match attempts : 28
% 1.19/0.65 # BW rewrite match successes : 3
% 1.19/0.65 # Condensation attempts : 0
% 1.19/0.65 # Condensation successes : 0
% 1.19/0.65 # Termbank termtop insertions : 147144
% 1.19/0.65 # Search garbage collected termcells : 46815
% 1.19/0.65
% 1.19/0.65 # -------------------------------------------------
% 1.19/0.65 # User time : 0.195 s
% 1.19/0.65 # System time : 0.019 s
% 1.19/0.65 # Total time : 0.214 s
% 1.19/0.65 # Maximum resident set size: 8544 pages
% 1.19/0.65
% 1.19/0.65 # -------------------------------------------------
% 1.19/0.65 # User time : 0.445 s
% 1.19/0.65 # System time : 0.038 s
% 1.19/0.65 # Total time : 0.483 s
% 1.19/0.65 # Maximum resident set size: 2380 pages
% 1.19/0.65 % E---3.1 exiting
% 1.19/0.65 % E exiting
%------------------------------------------------------------------------------