%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET601^3 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:22:10 AM UTC 2026
% Result : Theorem 0.08s 0.23s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 316 ( 6 equ; 0 cnn)
% Maximal formula atoms : 240 ( 13 avg)
% Number of connectives : 774 ( 145 ~; 229 |; 54 &; 345 @)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 54 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 17 ( 17 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 22 ( 12 ^; 10 !; 0 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_28,type,
union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_30,type,
intersection: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_37,type,
epred1_0: $i > $o ).
thf(decl_38,type,
epred2_0: $i > $o ).
thf(decl_39,type,
epred3_0: $i > $o ).
thf(decl_40,type,
esk1_0: $i ).
thf(thm,conjecture,
! [X22: $i > $o,X23: $i > $o,X24: $i > $o] :
( ( union @ ( intersection @ X22 @ X23 ) @ ( union @ ( intersection @ X23 @ X24 ) @ ( intersection @ X24 @ X22 ) ) )
= ( intersection @ ( union @ X22 @ X23 ) @ ( intersection @ ( union @ X23 @ X24 ) @ ( union @ X24 @ X22 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.YqtprjKpSd/E---3.1_340285.p',thm) ).
thf(union,axiom,
( union
= ( ^ [X5: $i > $o,X6: $i > $o,X4: $i] :
( ( X5 @ X4 )
| ( X6 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.YqtprjKpSd/E---3.1_340285.p',union) ).
thf(intersection,axiom,
( intersection
= ( ^ [X9: $i > $o,X10: $i > $o,X4: $i] :
( ( X9 @ X4 )
& ( X10 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.YqtprjKpSd/E---3.1_340285.p',intersection) ).
thf(c_0_3,negated_conjecture,
~ ! [X22: $i > $o,X23: $i > $o,X24: $i > $o] :
( ( union @ ( intersection @ X22 @ X23 ) @ ( union @ ( intersection @ X23 @ X24 ) @ ( intersection @ X24 @ X22 ) ) )
= ( intersection @ ( union @ X22 @ X23 ) @ ( intersection @ ( union @ X23 @ X24 ) @ ( union @ X24 @ X22 ) ) ) ),
inference(assume_negation,[status(cth)],[thm]) ).
thf(c_0_4,plain,
( union
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[union]) ).
thf(c_0_5,plain,
( intersection
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[intersection]) ).
thf(c_0_6,negated_conjecture,
~ ! [X22: $i > $o,X23: $i > $o,X24: $i > $o,X28: $i] :
( ( ( ( X22 @ X28 )
& ( X23 @ X28 ) )
| ( ( X23 @ X28 )
& ( X24 @ X28 ) )
| ( ( X24 @ X28 )
& ( X22 @ X28 ) ) )
<=> ( ( ( X22 @ X28 )
| ( X23 @ X28 ) )
& ( ( X23 @ X28 )
| ( X24 @ X28 ) )
& ( ( X24 @ X28 )
| ( X22 @ X28 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_3,c_0_4]),c_0_5])]) ).
thf(c_0_7,negated_conjecture,
( ( ~ ( epred3_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred3_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred3_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred3_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred3_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) )
& ( ~ ( epred3_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) )
& ( ~ ( epred3_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) )
& ( ~ ( epred3_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) )
& ( ~ ( epred3_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 ) )
& ( ~ ( epred3_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 ) )
& ( ~ ( epred3_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 ) )
& ( ~ ( epred3_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) ) ),
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_6])])])])]) ).
thf(c_0_8,negated_conjecture,
( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_9,negated_conjecture,
( ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_12,negated_conjecture,
( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_8]) ).
thf(c_0_13,negated_conjecture,
( ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_9]) ).
thf(c_0_14,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_10]) ).
thf(c_0_15,negated_conjecture,
( ~ ( epred3_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_16,negated_conjecture,
( ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_17,negated_conjecture,
( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_11]) ).
thf(c_0_18,negated_conjecture,
epred2_0 @ esk1_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
thf(c_0_19,negated_conjecture,
( ~ ( epred2_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_15]) ).
thf(c_0_20,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_16]) ).
thf(c_0_21,negated_conjecture,
~ ( epred1_0 @ esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
thf(c_0_22,negated_conjecture,
~ ( epred3_0 @ esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_18])]) ).
thf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET601^3 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.16 % Computer : n017.cluster.edu
% 0.08/0.16 % Model : x86_64 x86_64
% 0.08/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.16 % Memory : 8046.5625MB
% 0.08/0.16 % OS : Linux 6.8.0-71-generic
% 0.08/0.16 % CPULimit : 300
% 0.08/0.16 % WCLimit : 300
% 0.08/0.16 % DateTime : Tue Sep 29 13:33:37 UTC 2026
% 0.08/0.16 % CPUTime :
% 0.08/0.16 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 Running higher-order theorem proving
% 0.08/0.21 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/tmp/tmp.YqtprjKpSd/E---3.1_340285.p
% 0.08/0.23 % Version: 3.5.1-ho
% 0.08/0.23 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.08/0.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.23 % Starting new_ho_9 with 1500s (5) cores
% 0.08/0.23 % Starting post_as_ho1 with 300s (1) cores
% 0.08/0.23 % Starting sh1l with 300s (1) cores
% 0.08/0.23 % Starting post_as_ho10 with 300s (1) cores
% 0.08/0.23 % post_as_ho1 with pid 340299 completed with status 0
% 0.08/0.23 % Result found by post_as_ho1
% 0.08/0.23 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.08/0.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.23 % Starting new_ho_9 with 1500s (5) cores
% 0.08/0.23 % Starting post_as_ho1 with 300s (1) cores
% 0.08/0.23 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.23 % No SInE strategy applied
% 0.08/0.23 % Search class: HGHNF-FFMM00-SHSSMFNN
% 0.08/0.23 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.23 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.23 % SubtermCWHack with pid 340304 completed with status 0
% 0.08/0.23 % Result found by SubtermCWHack
% 0.08/0.23 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.08/0.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.23 % Starting new_ho_9 with 1500s (5) cores
% 0.08/0.23 % Starting post_as_ho1 with 300s (1) cores
% 0.08/0.23 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.23 % No SInE strategy applied
% 0.08/0.23 % Search class: HGHNF-FFMM00-SHSSMFNN
% 0.08/0.23 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.23 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.23 % Preprocessing time : 0.001 s
% 0.08/0.23
% 0.08/0.23 % Proof found!
% 0.08/0.23 % SZS status Theorem
% 0.08/0.23 % SZS output start CNFRefutation
% See solution above
% 0.08/0.23 % Parsed axioms : 29
% 0.08/0.23 % Removed by relevancy pruning/SinE : 0
% 0.08/0.23 % Initial clauses : 62
% 0.08/0.23 % Removed in clause preprocessing : 14
% 0.08/0.23 % Initial clauses in saturation : 48
% 0.08/0.23 % Processed clauses : 17
% 0.08/0.23 % ...of these trivial : 0
% 0.08/0.23 % ...subsumed : 7
% 0.08/0.23 % ...remaining for further processing : 9
% 0.08/0.23 % Other redundant clauses eliminated : 0
% 0.08/0.23 % Clauses deleted for lack of memory : 0
% 0.08/0.23 % Backward-subsumed : 2
% 0.08/0.23 % Backward-rewritten : 3
% 0.08/0.23 % Generated clauses : 6
% 0.08/0.23 % ...of the previous two non-redundant : 5
% 0.08/0.23 % ...aggressively subsumed : 0
% 0.08/0.23 % Contextual simplify-reflections : 1
% 0.08/0.23 % Paramodulations : 5
% 0.08/0.23 % Factorizations : 0
% 0.08/0.23 % NegExts : 0
% 0.08/0.23 % Equation resolutions : 0
% 0.08/0.23 % Disequality decompositions : 0
% 0.08/0.23 % Total rewrite steps : 3
% 0.08/0.23 % ...of those cached : 2
% 0.08/0.23 % Propositional unsat checks : 0
% 0.08/0.23 % Propositional check models : 0
% 0.08/0.23 % Propositional check unsatisfiable : 0
% 0.08/0.23 % Propositional clauses : 0
% 0.08/0.23 % Propositional clauses after purity: 0
% 0.08/0.23 % Propositional unsat core size : 0
% 0.08/0.23 % Propositional preprocessing time : 0.000
% 0.08/0.23 % Propositional encoding time : 0.000
% 0.08/0.23 % Propositional solver time : 0.000
% 0.08/0.23 % Success case prop preproc time : 0.000
% 0.08/0.23 % Success case prop encoding time : 0.000
% 0.08/0.23 % Success case prop solver time : 0.000
% 0.08/0.23 % Current number of processed clauses : 3
% 0.08/0.23 % Positive orientable unit clauses : 1
% 0.08/0.23 % Positive unorientable unit clauses: 0
% 0.08/0.23 % Negative unit clauses : 2
% 0.08/0.23 % Non-unit-clauses : 0
% 0.08/0.23 % Current number of unprocessed clauses: 36
% 0.08/0.23 % ...number of literals in the above : 107
% 0.08/0.23 % Current number of archived formulas : 0
% 0.08/0.23 % Current number of archived clauses : 6
% 0.08/0.23 % Clause-clause subsumption calls (NU) : 8
% 0.08/0.23 % Rec. Clause-clause subsumption calls : 8
% 0.08/0.23 % Non-unit clause-clause subsumptions : 8
% 0.08/0.23 % Unit Clause-clause subsumption calls : 2
% 0.08/0.23 % Rewrite failures with RHS unbound : 0
% 0.08/0.23 % BW rewrite match attempts : 1
% 0.08/0.23 % BW rewrite match successes : 1
% 0.08/0.23 % Condensation attempts : 0
% 0.08/0.23 % Condensation successes : 0
% 0.08/0.23 % Termbank termtop insertions : 2825
% 0.08/0.23 % Search garbage collected termcells : 443
% 0.08/0.23
% 0.08/0.23 % -------------------------------------------------
% 0.08/0.23 % User time : 0.002 s
% 0.08/0.23 % System time : 0.003 s
% 0.08/0.23 % Total time : 0.006 s
% 0.08/0.23 % Maximum resident set size: 3660 pages
% 0.08/0.23
% 0.08/0.23 % -------------------------------------------------
% 0.08/0.23 % User time : 0.005 s
% 0.08/0.23 % System time : 0.007 s
% 0.08/0.23 % Total time : 0.012 s
% 0.08/0.23 % Maximum resident set size: 4864 pages
% 0.08/0.23 % E exiting
%------------------------------------------------------------------------------