%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU743^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:27:37 AM UTC 2026
% Result : Theorem 4.39s 0.85s
% Output : CNFRefutation 4.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 147 ( 0 equ; 0 cnn)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 759 ( 61 ~; 59 |; 9 &; 577 @)
% ( 4 <=>; 49 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 12 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 13 usr; 9 con; 0-3 aty)
% Number of variables : 90 ( 0 ^; 90 !; 0 ?; 90 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_24,type,
powerset: $i > $i ).
thf(decl_25,type,
binunion: $i > $i > $i ).
thf(decl_26,type,
binintersect: $i > $i > $i ).
thf(decl_27,type,
binintersectT_lem: $o ).
thf(decl_28,type,
binunionT_lem: $o ).
thf(decl_29,type,
powersetTI1: $o ).
thf(decl_30,type,
inIntersectImpInIntersectUnions: $o ).
thf(decl_31,type,
esk1_3: $i > $i > $i > $i ).
thf(decl_32,type,
esk2_0: $i ).
thf(decl_33,type,
esk3_0: $i ).
thf(decl_34,type,
esk4_0: $i ).
thf(decl_35,type,
esk5_0: $i ).
thf(intersectInPowersetIntersectUnions,conjecture,
( binintersectT_lem
=> ( binunionT_lem
=> ( powersetTI1
=> ( inIntersectImpInIntersectUnions
=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ! [X5: $i] :
( ( in @ X5 @ ( powerset @ X1 ) )
=> ( in @ ( binintersect @ X2 @ X3 ) @ ( powerset @ ( binintersect @ ( binunion @ X2 @ X5 ) @ ( binunion @ X3 @ X5 ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uVkBbryJ4G/E---3.1_2574408.p',intersectInPowersetIntersectUnions) ).
thf(binintersectT_lem,axiom,
( binintersectT_lem
<=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ( in @ ( binintersect @ X2 @ X3 ) @ ( powerset @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uVkBbryJ4G/E---3.1_2574408.p',binintersectT_lem) ).
thf(binunionT_lem,axiom,
( binunionT_lem
<=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ( in @ ( binunion @ X2 @ X3 ) @ ( powerset @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uVkBbryJ4G/E---3.1_2574408.p',binunionT_lem) ).
thf(powersetTI1,axiom,
( powersetTI1
<=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ( ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( in @ X4 @ X2 )
=> ( in @ X4 @ X3 ) ) )
=> ( in @ X2 @ ( powerset @ X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uVkBbryJ4G/E---3.1_2574408.p',powersetTI1) ).
thf(inIntersectImpInIntersectUnions,axiom,
( inIntersectImpInIntersectUnions
<=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ! [X5: $i] :
( ( in @ X5 @ ( powerset @ X1 ) )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( in @ X4 @ ( binintersect @ X2 @ X3 ) )
=> ( in @ X4 @ ( binintersect @ ( binunion @ X2 @ X5 ) @ ( binunion @ X3 @ X5 ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uVkBbryJ4G/E---3.1_2574408.p',inIntersectImpInIntersectUnions) ).
thf(c_0_5,negated_conjecture,
~ ( binintersectT_lem
=> ( binunionT_lem
=> ( powersetTI1
=> ( inIntersectImpInIntersectUnions
=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ! [X5: $i] :
( ( in @ X5 @ ( powerset @ X1 ) )
=> ( in @ ( binintersect @ X2 @ X3 ) @ ( powerset @ ( binintersect @ ( binunion @ X2 @ X5 ) @ ( binunion @ X3 @ X5 ) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[intersectInPowersetIntersectUnions]) ).
thf(c_0_6,negated_conjecture,
~ ( ! [X25: $i,X26: $i] :
( ( in @ X26 @ ( powerset @ X25 ) )
=> ! [X27: $i] :
( ( in @ X27 @ ( powerset @ X25 ) )
=> ( in @ ( binintersect @ X26 @ X27 ) @ ( powerset @ X25 ) ) ) )
=> ( ! [X28: $i,X29: $i] :
( ( in @ X29 @ ( powerset @ X28 ) )
=> ! [X30: $i] :
( ( in @ X30 @ ( powerset @ X28 ) )
=> ( in @ ( binunion @ X29 @ X30 ) @ ( powerset @ X28 ) ) ) )
=> ( ! [X31: $i,X32: $i] :
( ( in @ X32 @ ( powerset @ X31 ) )
=> ! [X33: $i] :
( ( in @ X33 @ ( powerset @ X31 ) )
=> ( ! [X34: $i] :
( ( in @ X34 @ X31 )
=> ( ( in @ X34 @ X32 )
=> ( in @ X34 @ X33 ) ) )
=> ( in @ X32 @ ( powerset @ X33 ) ) ) ) )
=> ( ! [X35: $i,X36: $i] :
( ( in @ X36 @ ( powerset @ X35 ) )
=> ! [X37: $i] :
( ( in @ X37 @ ( powerset @ X35 ) )
=> ! [X38: $i] :
( ( in @ X38 @ ( powerset @ X35 ) )
=> ! [X39: $i] :
( ( in @ X39 @ X35 )
=> ( ( in @ X39 @ ( binintersect @ X36 @ X37 ) )
=> ( in @ X39 @ ( binintersect @ ( binunion @ X36 @ X38 ) @ ( binunion @ X37 @ X38 ) ) ) ) ) ) ) )
=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X1 ) )
=> ! [X5: $i] :
( ( in @ X5 @ ( powerset @ X1 ) )
=> ( in @ ( binintersect @ X2 @ X3 ) @ ( powerset @ ( binintersect @ ( binunion @ X2 @ X5 ) @ ( binunion @ X3 @ X5 ) ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_5,binintersectT_lem]),binunionT_lem]),powersetTI1]),inIntersectImpInIntersectUnions]) ).
thf(c_0_7,negated_conjecture,
! [X40: $i,X41: $i,X42: $i,X43: $i,X44: $i,X45: $i,X46: $i,X47: $i,X48: $i,X50: $i,X51: $i,X52: $i,X53: $i,X54: $i] :
( ( ~ ( in @ X41 @ ( powerset @ X40 ) )
| ~ ( in @ X42 @ ( powerset @ X40 ) )
| ( in @ ( binintersect @ X41 @ X42 ) @ ( powerset @ X40 ) ) )
& ( ~ ( in @ X44 @ ( powerset @ X43 ) )
| ~ ( in @ X45 @ ( powerset @ X43 ) )
| ( in @ ( binunion @ X44 @ X45 ) @ ( powerset @ X43 ) ) )
& ( ( in @ ( esk1_3 @ X46 @ X47 @ X48 ) @ X46 )
| ( in @ X47 @ ( powerset @ X48 ) )
| ~ ( in @ X48 @ ( powerset @ X46 ) )
| ~ ( in @ X47 @ ( powerset @ X46 ) ) )
& ( ( in @ ( esk1_3 @ X46 @ X47 @ X48 ) @ X47 )
| ( in @ X47 @ ( powerset @ X48 ) )
| ~ ( in @ X48 @ ( powerset @ X46 ) )
| ~ ( in @ X47 @ ( powerset @ X46 ) ) )
& ( ~ ( in @ ( esk1_3 @ X46 @ X47 @ X48 ) @ X48 )
| ( in @ X47 @ ( powerset @ X48 ) )
| ~ ( in @ X48 @ ( powerset @ X46 ) )
| ~ ( in @ X47 @ ( powerset @ X46 ) ) )
& ( ~ ( in @ X51 @ ( powerset @ X50 ) )
| ~ ( in @ X52 @ ( powerset @ X50 ) )
| ~ ( in @ X53 @ ( powerset @ X50 ) )
| ~ ( in @ X54 @ X50 )
| ~ ( in @ X54 @ ( binintersect @ X51 @ X52 ) )
| ( in @ X54 @ ( binintersect @ ( binunion @ X51 @ X53 ) @ ( binunion @ X52 @ X53 ) ) ) )
& ( in @ esk3_0 @ ( powerset @ esk2_0 ) )
& ( in @ esk4_0 @ ( powerset @ esk2_0 ) )
& ( in @ esk5_0 @ ( powerset @ esk2_0 ) )
& ~ ( in @ ( binintersect @ esk3_0 @ esk4_0 ) @ ( powerset @ ( binintersect @ ( binunion @ esk3_0 @ esk5_0 ) @ ( binunion @ esk4_0 @ esk5_0 ) ) ) ) ),
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_6])])])])])]) ).
thf(c_0_8,negated_conjecture,
! [X2: $i,X1: $i,X4: $i,X5: $i,X3: $i] :
( ( in @ X5 @ ( binintersect @ ( binunion @ X1 @ X4 ) @ ( binunion @ X3 @ X4 ) ) )
| ~ ( in @ X1 @ ( powerset @ X2 ) )
| ~ ( in @ X3 @ ( powerset @ X2 ) )
| ~ ( in @ X4 @ ( powerset @ X2 ) )
| ~ ( in @ X5 @ X2 )
| ~ ( in @ X5 @ ( binintersect @ X1 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_9,negated_conjecture,
in @ esk5_0 @ ( powerset @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ X2 @ ( powerset @ X3 ) )
| ~ ( in @ ( esk1_3 @ X1 @ X2 @ X3 ) @ X3 )
| ~ ( in @ X3 @ ( powerset @ X1 ) )
| ~ ( in @ X2 @ ( powerset @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ X1 @ ( binintersect @ ( binunion @ X2 @ esk5_0 ) @ ( binunion @ X3 @ esk5_0 ) ) )
| ~ ( in @ X1 @ ( binintersect @ X2 @ X3 ) )
| ~ ( in @ X3 @ ( powerset @ esk2_0 ) )
| ~ ( in @ X2 @ ( powerset @ esk2_0 ) )
| ~ ( in @ X1 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i,X3: $i,X2: $i,X4: $i] :
( ( in @ X1 @ ( powerset @ ( binintersect @ ( binunion @ X2 @ esk5_0 ) @ ( binunion @ X3 @ esk5_0 ) ) ) )
| ~ ( in @ ( esk1_3 @ X4 @ X1 @ ( binintersect @ ( binunion @ X2 @ esk5_0 ) @ ( binunion @ X3 @ esk5_0 ) ) ) @ ( binintersect @ X2 @ X3 ) )
| ~ ( in @ ( esk1_3 @ X4 @ X1 @ ( binintersect @ ( binunion @ X2 @ esk5_0 ) @ ( binunion @ X3 @ esk5_0 ) ) ) @ esk2_0 )
| ~ ( in @ ( binintersect @ ( binunion @ X2 @ esk5_0 ) @ ( binunion @ X3 @ esk5_0 ) ) @ ( powerset @ X4 ) )
| ~ ( in @ X3 @ ( powerset @ esk2_0 ) )
| ~ ( in @ X2 @ ( powerset @ esk2_0 ) )
| ~ ( in @ X1 @ ( powerset @ X4 ) ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_13,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ ( esk1_3 @ X1 @ X2 @ X3 ) @ X2 )
| ( in @ X2 @ ( powerset @ X3 ) )
| ~ ( in @ X3 @ ( powerset @ X1 ) )
| ~ ( in @ X2 @ ( powerset @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_14,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ ( binintersect @ X1 @ X2 ) @ ( powerset @ ( binintersect @ ( binunion @ X1 @ esk5_0 ) @ ( binunion @ X2 @ esk5_0 ) ) ) )
| ~ ( in @ ( esk1_3 @ X3 @ ( binintersect @ X1 @ X2 ) @ ( binintersect @ ( binunion @ X1 @ esk5_0 ) @ ( binunion @ X2 @ esk5_0 ) ) ) @ esk2_0 )
| ~ ( in @ ( binintersect @ ( binunion @ X1 @ esk5_0 ) @ ( binunion @ X2 @ esk5_0 ) ) @ ( powerset @ X3 ) )
| ~ ( in @ ( binintersect @ X1 @ X2 ) @ ( powerset @ X3 ) )
| ~ ( in @ X2 @ ( powerset @ esk2_0 ) )
| ~ ( in @ X1 @ ( powerset @ esk2_0 ) ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_15,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ ( esk1_3 @ X1 @ X2 @ X3 ) @ X1 )
| ( in @ X2 @ ( powerset @ X3 ) )
| ~ ( in @ X3 @ ( powerset @ X1 ) )
| ~ ( in @ X2 @ ( powerset @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( in @ ( binintersect @ X1 @ X3 ) @ ( powerset @ X2 ) )
| ~ ( in @ X1 @ ( powerset @ X2 ) )
| ~ ( in @ X3 @ ( powerset @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_17,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ ( binintersect @ X1 @ X2 ) @ ( powerset @ ( binintersect @ ( binunion @ X1 @ esk5_0 ) @ ( binunion @ X2 @ esk5_0 ) ) ) )
| ~ ( in @ ( binintersect @ ( binunion @ X1 @ esk5_0 ) @ ( binunion @ X2 @ esk5_0 ) ) @ ( powerset @ esk2_0 ) )
| ~ ( in @ X2 @ ( powerset @ esk2_0 ) )
| ~ ( in @ X1 @ ( powerset @ esk2_0 ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
thf(c_0_18,negated_conjecture,
~ ( in @ ( binintersect @ esk3_0 @ esk4_0 ) @ ( powerset @ ( binintersect @ ( binunion @ esk3_0 @ esk5_0 ) @ ( binunion @ esk4_0 @ esk5_0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_19,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ ( binintersect @ X1 @ X2 ) @ ( powerset @ ( binintersect @ ( binunion @ X1 @ esk5_0 ) @ ( binunion @ X2 @ esk5_0 ) ) ) )
| ~ ( in @ ( binunion @ X2 @ esk5_0 ) @ ( powerset @ esk2_0 ) )
| ~ ( in @ ( binunion @ X1 @ esk5_0 ) @ ( powerset @ esk2_0 ) )
| ~ ( in @ X2 @ ( powerset @ esk2_0 ) )
| ~ ( in @ X1 @ ( powerset @ esk2_0 ) ) ),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
thf(c_0_20,negated_conjecture,
in @ esk4_0 @ ( powerset @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_21,negated_conjecture,
in @ esk3_0 @ ( powerset @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_22,negated_conjecture,
( ~ ( in @ ( binunion @ esk4_0 @ esk5_0 ) @ ( powerset @ esk2_0 ) )
| ~ ( in @ ( binunion @ esk3_0 @ esk5_0 ) @ ( powerset @ esk2_0 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]) ).
thf(c_0_23,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( in @ ( binunion @ X1 @ X3 ) @ ( powerset @ X2 ) )
| ~ ( in @ X1 @ ( powerset @ X2 ) )
| ~ ( in @ X3 @ ( powerset @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_24,negated_conjecture,
~ ( in @ ( binunion @ esk4_0 @ esk5_0 ) @ ( powerset @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_9]),c_0_21])]) ).
thf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_23]),c_0_9]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU743^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n003.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 14:21:28 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.23 Running higher-order theorem proving
% 0.07/0.24 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.uVkBbryJ4G/E---3.1_2574408.p
% 4.39/0.85 % Version: 3.5.1-ho
% 4.39/0.85 % Preprocessing class: HSSSSLSSSLSNFFN.
% 4.39/0.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.39/0.85 % Starting lpo6_lambda_fix with 1500s (5) cores
% 4.39/0.85 % Starting post_as_ho8 with 300s (1) cores
% 4.39/0.85 % Starting post_as_ho3 with 300s (1) cores
% 4.39/0.85 % Starting post_as_ho2 with 300s (1) cores
% 4.39/0.85 % lpo6_lambda_fix with pid 2574421 completed with status 0
% 4.39/0.85 % Result found by lpo6_lambda_fix
% 4.39/0.85 % Preprocessing class: HSSSSLSSSLSNFFN.
% 4.39/0.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.39/0.85 % Starting lpo6_lambda_fix with 1500s (5) cores
% 4.39/0.85 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = Auto)
% 4.39/0.85 % No SInE strategy applied
% 4.39/0.85 % Search class: HGUNF-FFSS32-MFFFMFNN
% 4.39/0.85 % partial match(2): HGUNF-FFSF32-SFFFMFNN
% 4.39/0.85 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.39/0.85 % Starting SubtermCWHack with 136s (1) cores
% 4.39/0.85 % Starting lpo6_lambda_fix with 151s (1) cores
% 4.39/0.85 % Starting sh5l with 136s (1) cores
% 4.39/0.85 % Starting new_bool_1 with 136s (1) cores
% 4.39/0.85 % Starting new_bool_2 with 136s (1) cores
% 4.39/0.85 % lpo6_lambda_fix with pid 2574428 completed with status 0
% 4.39/0.85 % Result found by lpo6_lambda_fix
% 4.39/0.85 % Preprocessing class: HSSSSLSSSLSNFFN.
% 4.39/0.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.39/0.85 % Starting lpo6_lambda_fix with 1500s (5) cores
% 4.39/0.85 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = Auto)
% 4.39/0.85 % No SInE strategy applied
% 4.39/0.85 % Search class: HGUNF-FFSS32-MFFFMFNN
% 4.39/0.85 % partial match(2): HGUNF-FFSF32-SFFFMFNN
% 4.39/0.85 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.39/0.85 % Starting SubtermCWHack with 136s (1) cores
% 4.39/0.85 % Starting lpo6_lambda_fix with 151s (1) cores
% 4.39/0.85 % Preprocessing time : 0.001 s
% 4.39/0.85
% 4.39/0.85 % Proof found!
% 4.39/0.85 % SZS status Theorem
% 4.39/0.85 % SZS output start CNFRefutation
% See solution above
% 4.39/0.85 % Parsed axioms : 13
% 4.39/0.85 % Removed by relevancy pruning/SinE : 0
% 4.39/0.85 % Initial clauses : 18
% 4.39/0.85 % Removed in clause preprocessing : 8
% 4.39/0.85 % Initial clauses in saturation : 10
% 4.39/0.85 % Processed clauses : 702
% 4.39/0.85 % ...of these trivial : 0
% 4.39/0.85 % ...subsumed : 259
% 4.39/0.85 % ...remaining for further processing : 443
% 4.39/0.85 % Other redundant clauses eliminated : 0
% 4.39/0.85 % Clauses deleted for lack of memory : 0
% 4.39/0.85 % Backward-subsumed : 1
% 4.39/0.85 % Backward-rewritten : 0
% 4.39/0.85 % Generated clauses : 12042
% 4.39/0.85 % ...of the previous two non-redundant : 12037
% 4.39/0.85 % ...aggressively subsumed : 0
% 4.39/0.85 % Contextual simplify-reflections : 1
% 4.39/0.85 % Paramodulations : 12042
% 4.39/0.85 % Factorizations : 0
% 4.39/0.85 % NegExts : 0
% 4.39/0.85 % Equation resolutions : 0
% 4.39/0.85 % Disequality decompositions : 0
% 4.39/0.85 % Total rewrite steps : 21
% 4.39/0.85 % ...of those cached : 15
% 4.39/0.85 % Propositional unsat checks : 0
% 4.39/0.85 % Propositional check models : 0
% 4.39/0.85 % Propositional check unsatisfiable : 0
% 4.39/0.85 % Propositional clauses : 0
% 4.39/0.85 % Propositional clauses after purity: 0
% 4.39/0.85 % Propositional unsat core size : 0
% 4.39/0.85 % Propositional preprocessing time : 0.000
% 4.39/0.85 % Propositional encoding time : 0.000
% 4.39/0.85 % Propositional solver time : 0.000
% 4.39/0.85 % Success case prop preproc time : 0.000
% 4.39/0.85 % Success case prop encoding time : 0.000
% 4.39/0.85 % Success case prop solver time : 0.000
% 4.39/0.85 % Current number of processed clauses : 442
% 4.39/0.85 % Positive orientable unit clauses : 6
% 4.39/0.85 % Positive unorientable unit clauses: 0
% 4.39/0.85 % Negative unit clauses : 2
% 4.39/0.85 % Non-unit-clauses : 434
% 4.39/0.85 % Current number of unprocessed clauses: 11345
% 4.39/0.85 % ...number of literals in the above : 88296
% 4.39/0.85 % Current number of archived formulas : 0
% 4.39/0.85 % Current number of archived clauses : 1
% 4.39/0.85 % Clause-clause subsumption calls (NU) : 45689
% 4.39/0.85 % Rec. Clause-clause subsumption calls : 15402
% 4.39/0.85 % Non-unit clause-clause subsumptions : 260
% 4.39/0.85 % Unit Clause-clause subsumption calls : 59
% 4.39/0.85 % Rewrite failures with RHS unbound : 0
% 4.39/0.85 % BW rewrite match attempts : 0
% 4.39/0.85 % BW rewrite match successes : 0
% 4.39/0.85 % Condensation attempts : 702
% 4.39/0.85 % Condensation successes : 0
% 4.39/0.85 % Termbank termtop insertions : 637059
% 4.39/0.85 % Search garbage collected termcells : 589
% 4.39/0.85
% 4.39/0.85 % -------------------------------------------------
% 4.39/0.85 % User time : 0.558 s
% 4.39/0.85 % System time : 0.021 s
% 4.39/0.85 % Total time : 0.578 s
% 4.39/0.85 % Maximum resident set size: 3640 pages
% 4.39/0.85
% 4.39/0.85 % -------------------------------------------------
% 4.39/0.85 % User time : 2.624 s
% 4.39/0.85 % System time : 0.137 s
% 4.39/0.85 % Total time : 2.760 s
% 4.39/0.85 % Maximum resident set size: 4608 pages
% 4.39/0.85 % E exiting
%------------------------------------------------------------------------------