%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU792^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 : n026.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:25:39 AM UTC 2026
% Result : Theorem 0.08s 0.28s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 26 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 113 ( 25 equ; 0 cnn)
% Maximal formula atoms : 21 ( 4 avg)
% Number of connectives : 643 ( 33 ~; 23 |; 9 &; 523 @)
% ( 6 <=>; 49 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 11 con; 0-3 aty)
% Number of variables : 78 ( 0 ^; 78 !; 0 ?; 78 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
binunion: $i > $i > $i ).
thf(decl_24,type,
breln1: $i > $i > $o ).
thf(decl_25,type,
breln1invset: $i > $i > $i ).
thf(decl_26,type,
breln1invprop: $o ).
thf(decl_27,type,
breln1compset: $i > $i > $i > $i ).
thf(decl_28,type,
breln1compprop: $o ).
thf(decl_29,type,
breln1unionCommutes: $o ).
thf(decl_30,type,
woz2Ex: $o ).
thf(decl_31,type,
woz2W: $o ).
thf(decl_32,type,
woz2A: $o ).
thf(decl_33,type,
esk1_0: $i ).
thf(decl_34,type,
esk2_0: $i ).
thf(decl_35,type,
esk3_0: $i ).
thf(decl_36,type,
esk4_0: $i ).
thf(woz2B,conjecture,
( breln1invprop
=> ( breln1compprop
=> ( breln1unionCommutes
=> ( woz2Ex
=> ( woz2W
=> ( woz2A
=> ! [X1: $i,X2: $i] :
( ( breln1 @ X1 @ X2 )
=> ! [X3: $i] :
( ( breln1 @ X1 @ X3 )
=> ! [X4: $i] :
( ( breln1 @ X1 @ X4 )
=> ( ( breln1compset @ X1 @ ( binunion @ X2 @ X3 ) @ X4 )
= ( binunion @ ( breln1invset @ X1 @ ( breln1compset @ X1 @ ( breln1invset @ X1 @ X4 ) @ ( breln1invset @ X1 @ X3 ) ) ) @ ( breln1invset @ X1 @ ( breln1compset @ X1 @ ( breln1invset @ X1 @ X4 ) @ ( breln1invset @ X1 @ X2 ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.JFtuvEPHXt/E---3.1_679972.p',woz2B) ).
thf(breln1invprop,axiom,
( breln1invprop
<=> ! [X1: $i,X2: $i] :
( ( breln1 @ X1 @ X2 )
=> ( breln1 @ X1 @ ( breln1invset @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.JFtuvEPHXt/E---3.1_679972.p',breln1invprop) ).
thf(breln1compprop,axiom,
( breln1compprop
<=> ! [X1: $i,X2: $i] :
( ( breln1 @ X1 @ X2 )
=> ! [X3: $i] :
( ( breln1 @ X1 @ X3 )
=> ( breln1 @ X1 @ ( breln1compset @ X1 @ X2 @ X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.JFtuvEPHXt/E---3.1_679972.p',breln1compprop) ).
thf(breln1unionCommutes,axiom,
( breln1unionCommutes
<=> ! [X1: $i,X2: $i] :
( ( breln1 @ X1 @ X2 )
=> ! [X3: $i] :
( ( breln1 @ X1 @ X3 )
=> ( ( binunion @ X2 @ X3 )
= ( binunion @ X3 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.JFtuvEPHXt/E---3.1_679972.p',breln1unionCommutes) ).
thf(woz2Ex,axiom,
( woz2Ex
<=> ! [X1: $i,X2: $i] :
( ( breln1 @ X1 @ X2 )
=> ( X2
= ( breln1invset @ X1 @ ( breln1invset @ X1 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.JFtuvEPHXt/E---3.1_679972.p',woz2Ex) ).
thf(woz2W,axiom,
( woz2W
<=> ! [X1: $i,X2: $i] :
( ( breln1 @ X1 @ X2 )
=> ! [X3: $i] :
( ( breln1 @ X1 @ X3 )
=> ( ( breln1invset @ X1 @ ( breln1compset @ X1 @ X2 @ X3 ) )
= ( breln1compset @ X1 @ ( breln1invset @ X1 @ X3 ) @ ( breln1invset @ X1 @ X2 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.JFtuvEPHXt/E---3.1_679972.p',woz2W) ).
thf(woz2A,axiom,
( woz2A
<=> ! [X1: $i,X2: $i] :
( ( breln1 @ X1 @ X2 )
=> ! [X3: $i] :
( ( breln1 @ X1 @ X3 )
=> ! [X4: $i] :
( ( breln1 @ X1 @ X4 )
=> ( ( breln1compset @ X1 @ ( binunion @ X2 @ X3 ) @ X4 )
= ( binunion @ ( breln1compset @ X1 @ X2 @ X4 ) @ ( breln1compset @ X1 @ X3 @ X4 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.JFtuvEPHXt/E---3.1_679972.p',woz2A) ).
thf(c_0_7,negated_conjecture,
~ ( breln1invprop
=> ( breln1compprop
=> ( breln1unionCommutes
=> ( woz2Ex
=> ( woz2W
=> ( woz2A
=> ! [X1: $i,X2: $i] :
( ( breln1 @ X1 @ X2 )
=> ! [X3: $i] :
( ( breln1 @ X1 @ X3 )
=> ! [X4: $i] :
( ( breln1 @ X1 @ X4 )
=> ( ( breln1compset @ X1 @ ( binunion @ X2 @ X3 ) @ X4 )
= ( binunion @ ( breln1invset @ X1 @ ( breln1compset @ X1 @ ( breln1invset @ X1 @ X4 ) @ ( breln1invset @ X1 @ X3 ) ) ) @ ( breln1invset @ X1 @ ( breln1compset @ X1 @ ( breln1invset @ X1 @ X4 ) @ ( breln1invset @ X1 @ X2 ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[woz2B]) ).
thf(c_0_8,negated_conjecture,
~ ( ! [X26: $i,X27: $i] :
( ( breln1 @ X26 @ X27 )
=> ( breln1 @ X26 @ ( breln1invset @ X26 @ X27 ) ) )
=> ( ! [X28: $i,X29: $i] :
( ( breln1 @ X28 @ X29 )
=> ! [X30: $i] :
( ( breln1 @ X28 @ X30 )
=> ( breln1 @ X28 @ ( breln1compset @ X28 @ X29 @ X30 ) ) ) )
=> ( ! [X31: $i,X32: $i] :
( ( breln1 @ X31 @ X32 )
=> ! [X33: $i] :
( ( breln1 @ X31 @ X33 )
=> ( ( binunion @ X32 @ X33 )
= ( binunion @ X33 @ X32 ) ) ) )
=> ( ! [X34: $i,X35: $i] :
( ( breln1 @ X34 @ X35 )
=> ( X35
= ( breln1invset @ X34 @ ( breln1invset @ X34 @ X35 ) ) ) )
=> ( ! [X36: $i,X37: $i] :
( ( breln1 @ X36 @ X37 )
=> ! [X38: $i] :
( ( breln1 @ X36 @ X38 )
=> ( ( breln1invset @ X36 @ ( breln1compset @ X36 @ X37 @ X38 ) )
= ( breln1compset @ X36 @ ( breln1invset @ X36 @ X38 ) @ ( breln1invset @ X36 @ X37 ) ) ) ) )
=> ( ! [X39: $i,X40: $i] :
( ( breln1 @ X39 @ X40 )
=> ! [X41: $i] :
( ( breln1 @ X39 @ X41 )
=> ! [X42: $i] :
( ( breln1 @ X39 @ X42 )
=> ( ( breln1compset @ X39 @ ( binunion @ X40 @ X41 ) @ X42 )
= ( binunion @ ( breln1compset @ X39 @ X40 @ X42 ) @ ( breln1compset @ X39 @ X41 @ X42 ) ) ) ) ) )
=> ! [X1: $i,X2: $i] :
( ( breln1 @ X1 @ X2 )
=> ! [X3: $i] :
( ( breln1 @ X1 @ X3 )
=> ! [X4: $i] :
( ( breln1 @ X1 @ X4 )
=> ( ( breln1compset @ X1 @ ( binunion @ X2 @ X3 ) @ X4 )
= ( binunion @ ( breln1invset @ X1 @ ( breln1compset @ X1 @ ( breln1invset @ X1 @ X4 ) @ ( breln1invset @ X1 @ X3 ) ) ) @ ( breln1invset @ X1 @ ( breln1compset @ X1 @ ( breln1invset @ X1 @ X4 ) @ ( breln1invset @ X1 @ X2 ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_7,breln1invprop]),breln1compprop]),breln1unionCommutes]),woz2Ex]),woz2W]),woz2A]) ).
thf(c_0_9,negated_conjecture,
! [X43: $i,X44: $i,X45: $i,X46: $i,X47: $i,X48: $i,X49: $i,X50: $i,X51: $i,X52: $i,X53: $i,X54: $i,X55: $i,X56: $i,X57: $i,X58: $i,X59: $i] :
( ( ~ ( breln1 @ X43 @ X44 )
| ( breln1 @ X43 @ ( breln1invset @ X43 @ X44 ) ) )
& ( ~ ( breln1 @ X45 @ X46 )
| ~ ( breln1 @ X45 @ X47 )
| ( breln1 @ X45 @ ( breln1compset @ X45 @ X46 @ X47 ) ) )
& ( ~ ( breln1 @ X48 @ X49 )
| ~ ( breln1 @ X48 @ X50 )
| ( ( binunion @ X49 @ X50 )
= ( binunion @ X50 @ X49 ) ) )
& ( ~ ( breln1 @ X51 @ X52 )
| ( X52
= ( breln1invset @ X51 @ ( breln1invset @ X51 @ X52 ) ) ) )
& ( ~ ( breln1 @ X53 @ X54 )
| ~ ( breln1 @ X53 @ X55 )
| ( ( breln1invset @ X53 @ ( breln1compset @ X53 @ X54 @ X55 ) )
= ( breln1compset @ X53 @ ( breln1invset @ X53 @ X55 ) @ ( breln1invset @ X53 @ X54 ) ) ) )
& ( ~ ( breln1 @ X56 @ X57 )
| ~ ( breln1 @ X56 @ X58 )
| ~ ( breln1 @ X56 @ X59 )
| ( ( breln1compset @ X56 @ ( binunion @ X57 @ X58 ) @ X59 )
= ( binunion @ ( breln1compset @ X56 @ X57 @ X59 ) @ ( breln1compset @ X56 @ X58 @ X59 ) ) ) )
& ( breln1 @ esk1_0 @ esk2_0 )
& ( breln1 @ esk1_0 @ esk3_0 )
& ( breln1 @ esk1_0 @ esk4_0 )
& ( ( breln1compset @ esk1_0 @ ( binunion @ esk2_0 @ esk3_0 ) @ esk4_0 )
!= ( binunion @ ( breln1invset @ esk1_0 @ ( breln1compset @ esk1_0 @ ( breln1invset @ esk1_0 @ esk4_0 ) @ ( breln1invset @ esk1_0 @ esk3_0 ) ) ) @ ( breln1invset @ esk1_0 @ ( breln1compset @ esk1_0 @ ( breln1invset @ esk1_0 @ esk4_0 ) @ ( breln1invset @ esk1_0 @ esk2_0 ) ) ) ) ) ),
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_10,negated_conjecture,
( ( breln1compset @ esk1_0 @ ( binunion @ esk2_0 @ esk3_0 ) @ esk4_0 )
!= ( binunion @ ( breln1invset @ esk1_0 @ ( breln1compset @ esk1_0 @ ( breln1invset @ esk1_0 @ esk4_0 ) @ ( breln1invset @ esk1_0 @ esk3_0 ) ) ) @ ( breln1invset @ esk1_0 @ ( breln1compset @ esk1_0 @ ( breln1invset @ esk1_0 @ esk4_0 ) @ ( breln1invset @ esk1_0 @ esk2_0 ) ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i,X3: $i,X2: $i,X4: $i] :
( ( ( breln1compset @ X1 @ ( binunion @ X2 @ X3 ) @ X4 )
= ( binunion @ ( breln1compset @ X1 @ X2 @ X4 ) @ ( breln1compset @ X1 @ X3 @ X4 ) ) )
| ~ ( breln1 @ X1 @ X2 )
| ~ ( breln1 @ X1 @ X3 )
| ~ ( breln1 @ X1 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_12,negated_conjecture,
breln1 @ esk1_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_13,negated_conjecture,
breln1 @ esk1_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_14,negated_conjecture,
breln1 @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_15,negated_conjecture,
( ( binunion @ ( breln1invset @ esk1_0 @ ( breln1compset @ esk1_0 @ ( breln1invset @ esk1_0 @ esk4_0 ) @ ( breln1invset @ esk1_0 @ esk3_0 ) ) ) @ ( breln1invset @ esk1_0 @ ( breln1compset @ esk1_0 @ ( breln1invset @ esk1_0 @ esk4_0 ) @ ( breln1invset @ esk1_0 @ esk2_0 ) ) ) )
!= ( binunion @ ( breln1compset @ esk1_0 @ esk2_0 @ esk4_0 ) @ ( breln1compset @ esk1_0 @ esk3_0 @ esk4_0 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]),c_0_14])]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( ( breln1invset @ X1 @ ( breln1compset @ X1 @ X2 @ X3 ) )
= ( breln1compset @ X1 @ ( breln1invset @ X1 @ X3 ) @ ( breln1invset @ X1 @ X2 ) ) )
| ~ ( breln1 @ X1 @ X2 )
| ~ ( breln1 @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_17,negated_conjecture,
( ( binunion @ ( breln1invset @ esk1_0 @ ( breln1compset @ esk1_0 @ ( breln1invset @ esk1_0 @ esk4_0 ) @ ( breln1invset @ esk1_0 @ esk3_0 ) ) ) @ ( breln1invset @ esk1_0 @ ( breln1invset @ esk1_0 @ ( breln1compset @ esk1_0 @ esk2_0 @ esk4_0 ) ) ) )
!= ( binunion @ ( breln1compset @ esk1_0 @ esk2_0 @ esk4_0 ) @ ( breln1compset @ esk1_0 @ esk3_0 @ esk4_0 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_12]),c_0_14])]) ).
thf(c_0_18,negated_conjecture,
( ( binunion @ ( breln1invset @ esk1_0 @ ( breln1invset @ esk1_0 @ ( breln1compset @ esk1_0 @ esk3_0 @ esk4_0 ) ) ) @ ( breln1invset @ esk1_0 @ ( breln1invset @ esk1_0 @ ( breln1compset @ esk1_0 @ esk2_0 @ esk4_0 ) ) ) )
!= ( binunion @ ( breln1compset @ esk1_0 @ esk2_0 @ esk4_0 ) @ ( breln1compset @ esk1_0 @ esk3_0 @ esk4_0 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_16]),c_0_12]),c_0_13])]) ).
thf(c_0_19,negated_conjecture,
! [X1: $i,X2: $i] :
( ( X2
= ( breln1invset @ X1 @ ( breln1invset @ X1 @ X2 ) ) )
| ~ ( breln1 @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_20,negated_conjecture,
( ( ( binunion @ ( breln1invset @ esk1_0 @ ( breln1invset @ esk1_0 @ ( breln1compset @ esk1_0 @ esk3_0 @ esk4_0 ) ) ) @ ( breln1compset @ esk1_0 @ esk2_0 @ esk4_0 ) )
!= ( binunion @ ( breln1compset @ esk1_0 @ esk2_0 @ esk4_0 ) @ ( breln1compset @ esk1_0 @ esk3_0 @ esk4_0 ) ) )
| ~ ( breln1 @ esk1_0 @ ( breln1compset @ esk1_0 @ esk2_0 @ esk4_0 ) ) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( ( binunion @ X2 @ X3 )
= ( binunion @ X3 @ X2 ) )
| ~ ( breln1 @ X1 @ X2 )
| ~ ( breln1 @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_22,negated_conjecture,
( ~ ( breln1 @ esk1_0 @ ( breln1compset @ esk1_0 @ esk2_0 @ esk4_0 ) )
| ~ ( breln1 @ esk1_0 @ ( breln1compset @ esk1_0 @ esk3_0 @ esk4_0 ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_19]),c_0_21]) ).
thf(c_0_23,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( breln1 @ X1 @ ( breln1compset @ X1 @ X2 @ X3 ) )
| ~ ( breln1 @ X1 @ X2 )
| ~ ( breln1 @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_24,negated_conjecture,
~ ( breln1 @ esk1_0 @ ( breln1compset @ esk1_0 @ esk2_0 @ esk4_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_12]),c_0_13])]) ).
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_12]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU792^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n026.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 14:32:57 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.24 Running higher-order theorem proving
% 0.08/0.25 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.JFtuvEPHXt/E---3.1_679972.p
% 0.08/0.28 % Version: 3.5.1-ho
% 0.08/0.28 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.08/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.28 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.08/0.28 % Starting post_as_ho8 with 300s (1) cores
% 0.08/0.28 % Starting post_as_ho3 with 300s (1) cores
% 0.08/0.28 % Starting post_as_ho2 with 300s (1) cores
% 0.08/0.28 % lpo6_lambda_fix with pid 679991 completed with status 0
% 0.08/0.28 % Result found by lpo6_lambda_fix
% 0.08/0.28 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.08/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.28 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.08/0.28 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = Auto)
% 0.08/0.28 % No SInE strategy applied
% 0.08/0.28 % Search class: HHUSF-FFSS32-MFFFMFNN
% 0.08/0.28 % partial match(2): HHUSF-FFSF32-SFFFMFNN
% 0.08/0.28 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.28 % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.28 % Starting lpo6_lambda_fix with 151s (1) cores
% 0.08/0.28 % Starting sh5l with 136s (1) cores
% 0.08/0.28 % Starting new_bool_1 with 136s (1) cores
% 0.08/0.28 % Starting new_bool_2 with 136s (1) cores
% 0.08/0.28 % lpo6_lambda_fix with pid 679996 completed with status 0
% 0.08/0.28 % Result found by lpo6_lambda_fix
% 0.08/0.28 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.08/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.28 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.08/0.28 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = Auto)
% 0.08/0.28 % No SInE strategy applied
% 0.08/0.28 % Search class: HHUSF-FFSS32-MFFFMFNN
% 0.08/0.28 % partial match(2): HHUSF-FFSF32-SFFFMFNN
% 0.08/0.28 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.28 % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.28 % Starting lpo6_lambda_fix with 151s (1) cores
% 0.08/0.28 % Preprocessing time : 0.002 s
% 0.08/0.28
% 0.08/0.28 % Proof found!
% 0.08/0.28 % SZS status Theorem
% 0.08/0.28 % SZS output start CNFRefutation
% See solution above
% 0.08/0.28 % Parsed axioms : 17
% 0.08/0.28 % Removed by relevancy pruning/SinE : 0
% 0.08/0.28 % Initial clauses : 20
% 0.08/0.28 % Removed in clause preprocessing : 10
% 0.08/0.28 % Initial clauses in saturation : 10
% 0.08/0.28 % Processed clauses : 17
% 0.08/0.28 % ...of these trivial : 0
% 0.08/0.28 % ...subsumed : 0
% 0.08/0.28 % ...remaining for further processing : 17
% 0.08/0.28 % Other redundant clauses eliminated : 0
% 0.08/0.28 % Clauses deleted for lack of memory : 0
% 0.08/0.28 % Backward-subsumed : 2
% 0.08/0.28 % Backward-rewritten : 0
% 0.08/0.28 % Generated clauses : 27
% 0.08/0.28 % ...of the previous two non-redundant : 25
% 0.08/0.28 % ...aggressively subsumed : 0
% 0.08/0.28 % Contextual simplify-reflections : 1
% 0.08/0.28 % Paramodulations : 27
% 0.08/0.28 % Factorizations : 0
% 0.08/0.28 % NegExts : 0
% 0.08/0.28 % Equation resolutions : 0
% 0.08/0.28 % Disequality decompositions : 0
% 0.08/0.28 % Total rewrite steps : 13
% 0.08/0.28 % ...of those cached : 10
% 0.08/0.28 % Propositional unsat checks : 0
% 0.08/0.28 % Propositional check models : 0
% 0.08/0.28 % Propositional check unsatisfiable : 0
% 0.08/0.28 % Propositional clauses : 0
% 0.08/0.28 % Propositional clauses after purity: 0
% 0.08/0.28 % Propositional unsat core size : 0
% 0.08/0.28 % Propositional preprocessing time : 0.000
% 0.08/0.28 % Propositional encoding time : 0.000
% 0.08/0.28 % Propositional solver time : 0.000
% 0.08/0.28 % Success case prop preproc time : 0.000
% 0.08/0.28 % Success case prop encoding time : 0.000
% 0.08/0.28 % Success case prop solver time : 0.000
% 0.08/0.28 % Current number of processed clauses : 15
% 0.08/0.28 % Positive orientable unit clauses : 3
% 0.08/0.28 % Positive unorientable unit clauses: 0
% 0.08/0.28 % Negative unit clauses : 5
% 0.08/0.28 % Non-unit-clauses : 7
% 0.08/0.28 % Current number of unprocessed clauses: 18
% 0.08/0.28 % ...number of literals in the above : 65
% 0.08/0.28 % Current number of archived formulas : 0
% 0.08/0.28 % Current number of archived clauses : 2
% 0.08/0.28 % Clause-clause subsumption calls (NU) : 21
% 0.08/0.28 % Rec. Clause-clause subsumption calls : 17
% 0.08/0.28 % Non-unit clause-clause subsumptions : 1
% 0.08/0.28 % Unit Clause-clause subsumption calls : 6
% 0.08/0.28 % Rewrite failures with RHS unbound : 0
% 0.08/0.28 % BW rewrite match attempts : 0
% 0.08/0.28 % BW rewrite match successes : 0
% 0.08/0.28 % Condensation attempts : 17
% 0.08/0.28 % Condensation successes : 0
% 0.08/0.28 % Termbank termtop insertions : 2254
% 0.08/0.28 % Search garbage collected termcells : 555
% 0.08/0.28
% 0.08/0.28 % -------------------------------------------------
% 0.08/0.28 % User time : 0.006 s
% 0.08/0.28 % System time : 0.004 s
% 0.08/0.28 % Total time : 0.010 s
% 0.08/0.28 % Maximum resident set size: 3644 pages
% 0.08/0.28
% 0.08/0.28 % -------------------------------------------------
% 0.08/0.28 % User time : 0.030 s
% 0.08/0.28 % System time : 0.014 s
% 0.08/0.28 % Total time : 0.044 s
% 0.08/0.28 % Maximum resident set size: 4864 pages
% 0.08/0.28 % E exiting
%------------------------------------------------------------------------------