%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR130^1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n016.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 07:46:36 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 114 ( 0 equ; 0 cnn)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 398 ( 52 ~; 49 |; 24 &; 273 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 24 ( 0 ^; 21 !; 3 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_26,type,
lBill_THFTYPE_i: $i ).
thf(decl_27,type,
lBob_THFTYPE_i: $i ).
thf(decl_28,type,
lMary_THFTYPE_i: $i ).
thf(decl_29,type,
lSue_THFTYPE_i: $i ).
thf(decl_30,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(decl_31,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_32,type,
n2009_THFTYPE_i: $i ).
thf(decl_34,type,
esk1_1: ( $i > $i > $o ) > $i ).
thf(decl_35,type,
esk2_1: ( $i > $i > $o ) > $i ).
thf(con,conjecture,
? [X1: $i > $i > $o] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( X1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [X2: $i,X3: $i] : ( X1 @ X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.6E2g0JnVIp/E---3.1_696696.p',con) ).
thf(ax_003,axiom,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i ),
file('/export/starexec/sandbox2/tmp/tmp.6E2g0JnVIp/E---3.1_696696.p',ax_003) ).
thf(ax_002,axiom,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ),
file('/export/starexec/sandbox2/tmp/tmp.6E2g0JnVIp/E---3.1_696696.p',ax_002) ).
thf(ax_004,axiom,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ),
file('/export/starexec/sandbox2/tmp/tmp.6E2g0JnVIp/E---3.1_696696.p',ax_004) ).
thf(ax_007,axiom,
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ),
file('/export/starexec/sandbox2/tmp/tmp.6E2g0JnVIp/E---3.1_696696.p',ax_007) ).
thf(c_0_5,negated_conjecture,
~ ? [X1: $i > $i > $o] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( X1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [X2: $i,X3: $i] : ( X1 @ X2 @ X3 ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
thf(c_0_6,axiom,
( ( ~ ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_003]) ).
thf(c_0_7,negated_conjecture,
~ ? [X1: $i > $i > $o] :
( ( ~ ( ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( X1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [X2: $i,X3: $i] : ( X1 @ X2 @ X3 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( X1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [X2: $i,X3: $i] : ( X1 @ X2 @ X3 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
thf(c_0_9,axiom,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_002]) ).
thf(c_0_10,negated_conjecture,
! [X5: $i > $i > $o,X8: $i,X9: $i] :
( ( ~ ( X5 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X5 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( X5 @ X8 @ X9 )
| ( X5 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X5 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( X5 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X5 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( X5 @ X8 @ X9 )
| ( X5 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X5 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( X5 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X5 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( X5 @ X8 @ X9 )
| ~ ( X5 @ ( esk1_1 @ X5 ) @ ( esk2_1 @ X5 ) ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ~ ( X5 @ ( esk1_1 @ X5 ) @ ( esk2_1 @ X5 ) ) )
& ( ~ ( X5 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X5 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( X5 @ X8 @ X9 )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ) ),
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_7])])])])])]) ).
thf(c_0_11,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
| ~ ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
( ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_13,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i > $i > $o] :
( ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_15,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_16,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i > $i > $o] :
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
| ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_18,axiom,
( ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_004]) ).
thf(c_0_19,negated_conjecture,
( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_20,negated_conjecture,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_21,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_18]) ).
thf(c_0_22,plain,
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_007])]) ).
thf(c_0_23,negated_conjecture,
! [X3: $i,X2: $i,X1: $i > $i > $o] :
( ( X1 @ X2 @ X3 )
| ~ ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_24,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_25,negated_conjecture,
~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
thf(c_0_26,plain,
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_27,plain,
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_22]) ).
thf(c_0_28,negated_conjecture,
! [X3: $i,X2: $i,X1: $i > $i > $o] :
( ( X1 @ X2 @ X3 )
| ~ ( X1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_20])]) ).
thf(c_0_29,plain,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
inference(sr,[status(thm)],[c_0_24,c_0_25]) ).
thf(c_0_30,plain,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
inference(sr,[status(thm)],[c_0_26,c_0_25]) ).
thf(c_0_31,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_32,negated_conjecture,
! [X2: $i,X3: $i] : ( likes_THFTYPE_IiioI @ X2 @ X3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
thf(c_0_33,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR130^1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n016.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 18:00:19 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 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.6E2g0JnVIp/E---3.1_696696.p
% 0.20/0.27 % Version: 3.5.1-ho
% 0.20/0.27 % Preprocessing class: HSMSSMSSSSSNSSN.
% 0.20/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.27 % Starting new_ho_11 with 1500s (5) cores
% 0.20/0.27 % Starting sh5l with 300s (1) cores
% 0.20/0.27 % Starting new_ho_9 with 300s (1) cores
% 0.20/0.27 % Starting ho_unfolding_4 with 300s (1) cores
% 0.20/0.27 % new_ho_9 with pid 696711 completed with status 0
% 0.20/0.27 % Result found by new_ho_9
% 0.20/0.27 % Preprocessing class: HSMSSMSSSSSNSSN.
% 0.20/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.27 % Starting new_ho_11 with 1500s (5) cores
% 0.20/0.27 % Starting sh5l with 300s (1) cores
% 0.20/0.27 % Starting new_ho_9 with 300s (1) cores
% 0.20/0.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.27 % No SInE strategy applied
% 0.20/0.27 % Search class: HGHNF-FFSM11-SSSFFSBN
% 0.20/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.27 % SubtermCWHack with pid 696713 completed with status 0
% 0.20/0.27 % Result found by SubtermCWHack
% 0.20/0.27 % Preprocessing class: HSMSSMSSSSSNSSN.
% 0.20/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.27 % Starting new_ho_11 with 1500s (5) cores
% 0.20/0.27 % Starting sh5l with 300s (1) cores
% 0.20/0.27 % Starting new_ho_9 with 300s (1) cores
% 0.20/0.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.27 % No SInE strategy applied
% 0.20/0.27 % Search class: HGHNF-FFSM11-SSSFFSBN
% 0.20/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.27 % Preprocessing time : 0.001 s
% 0.20/0.27
% 0.20/0.27 % Proof found!
% 0.20/0.27 % SZS status Theorem
% 0.20/0.27 % SZS output start CNFRefutation
% See solution above
% 0.20/0.27 % Parsed axioms : 21
% 0.20/0.27 % Removed by relevancy pruning/SinE : 0
% 0.20/0.27 % Initial clauses : 36
% 0.20/0.27 % Removed in clause preprocessing : 14
% 0.20/0.27 % Initial clauses in saturation : 22
% 0.20/0.27 % Processed clauses : 34
% 0.20/0.27 % ...of these trivial : 0
% 0.20/0.27 % ...subsumed : 1
% 0.20/0.27 % ...remaining for further processing : 33
% 0.20/0.27 % Other redundant clauses eliminated : 0
% 0.20/0.27 % Clauses deleted for lack of memory : 0
% 0.20/0.27 % Backward-subsumed : 4
% 0.20/0.27 % Backward-rewritten : 14
% 0.20/0.27 % Generated clauses : 21
% 0.20/0.27 % ...of the previous two non-redundant : 20
% 0.20/0.27 % ...aggressively subsumed : 0
% 0.20/0.27 % Contextual simplify-reflections : 0
% 0.20/0.27 % Paramodulations : 14
% 0.20/0.27 % Factorizations : 0
% 0.20/0.27 % NegExts : 0
% 0.20/0.27 % Equation resolutions : 0
% 0.20/0.27 % Disequality decompositions : 0
% 0.20/0.27 % Total rewrite steps : 16
% 0.20/0.27 % ...of those cached : 10
% 0.20/0.27 % Propositional unsat checks : 0
% 0.20/0.27 % Propositional check models : 0
% 0.20/0.27 % Propositional check unsatisfiable : 0
% 0.20/0.27 % Propositional clauses : 0
% 0.20/0.27 % Propositional clauses after purity: 0
% 0.20/0.27 % Propositional unsat core size : 0
% 0.20/0.27 % Propositional preprocessing time : 0.000
% 0.20/0.27 % Propositional encoding time : 0.000
% 0.20/0.27 % Propositional solver time : 0.000
% 0.20/0.27 % Success case prop preproc time : 0.000
% 0.20/0.27 % Success case prop encoding time : 0.000
% 0.20/0.27 % Success case prop solver time : 0.000
% 0.20/0.27 % Current number of processed clauses : 8
% 0.20/0.27 % Positive orientable unit clauses : 6
% 0.20/0.27 % Positive unorientable unit clauses: 0
% 0.20/0.27 % Negative unit clauses : 1
% 0.20/0.27 % Non-unit-clauses : 1
% 0.20/0.27 % Current number of unprocessed clauses: 0
% 0.20/0.27 % ...number of literals in the above : 0
% 0.20/0.27 % Current number of archived formulas : 0
% 0.20/0.27 % Current number of archived clauses : 25
% 0.20/0.27 % Clause-clause subsumption calls (NU) : 39
% 0.20/0.27 % Rec. Clause-clause subsumption calls : 27
% 0.20/0.27 % Non-unit clause-clause subsumptions : 1
% 0.20/0.27 % Unit Clause-clause subsumption calls : 12
% 0.20/0.27 % Rewrite failures with RHS unbound : 0
% 0.20/0.27 % BW rewrite match attempts : 5
% 0.20/0.27 % BW rewrite match successes : 5
% 0.20/0.27 % Condensation attempts : 0
% 0.20/0.27 % Condensation successes : 0
% 0.20/0.27 % Termbank termtop insertions : 1823
% 0.20/0.27 % Search garbage collected termcells : 135
% 0.20/0.27
% 0.20/0.27 % -------------------------------------------------
% 0.20/0.27 % User time : 0.006 s
% 0.20/0.27 % System time : 0.001 s
% 0.20/0.27 % Total time : 0.006 s
% 0.20/0.27 % Maximum resident set size: 3588 pages
% 0.20/0.27
% 0.20/0.27 % -------------------------------------------------
% 0.20/0.27 % User time : 0.008 s
% 0.20/0.27 % System time : 0.005 s
% 0.20/0.27 % Total time : 0.013 s
% 0.20/0.27 % Maximum resident set size: 4864 pages
% 0.20/0.27 % E exiting
%------------------------------------------------------------------------------