%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYO499^1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:44:40 AM UTC 2026
% Result : Theorem 0.09s 0.25s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 27 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 797 ( 183 equ; 0 cnn)
% Maximal formula atoms : 306 ( 29 avg)
% Number of connectives : 1041 ( 271 ~; 300 |; 104 &; 366 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 90 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
a: $o ).
thf(decl_24,type,
b: $o ).
thf(decl_25,type,
c: $o ).
thf(decl_26,type,
f: $o > $i ).
thf(decl_27,type,
f1: $o > $i ).
thf(decl_28,type,
f2: $o > $i ).
thf(decl_29,type,
g: $o > $i ).
thf(decl_30,type,
g1: $o > $i ).
thf(decl_31,type,
g2: $o > $i ).
thf(con,conjecture,
( ( ( f @ a )
= ( g @ b ) )
| ( ( f @ b )
!= ( g @ a ) )
| ( ( f1 @ a )
= ( g1 @ c ) )
| ( ( f1 @ c )
!= ( g1 @ a ) )
| ( ( f2 @ b )
= ( g2 @ c ) )
| ( ( f2 @ c )
!= ( g2 @ b ) ) ),
file('/export/starexec/sandbox/tmp/tmp.9AaKoNpozH/E---3.1_1093371.p',con) ).
thf(c_0_1,negated_conjecture,
~ ( ( ( f @ a )
= ( g @ b ) )
| ( ( f @ b )
!= ( g @ a ) )
| ( ( f1 @ a )
= ( g1 @ c ) )
| ( ( f1 @ c )
!= ( g1 @ a ) )
| ( ( f2 @ b )
= ( g2 @ c ) )
| ( ( f2 @ c )
!= ( g2 @ b ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
thf(c_0_2,negated_conjecture,
~ ( ( ( ~ a
| ( ( ~ b
| ( ( f @ $true )
= ( g @ $true ) ) )
& ( b
| ( ( f @ $true )
= ( g @ $false ) ) ) ) )
& ( a
| ( ( ~ b
| ( ( f @ $false )
= ( g @ $true ) ) )
& ( b
| ( ( f @ $false )
= ( g @ $false ) ) ) ) ) )
| ~ ( ( ~ b
| ( ( ~ a
| ( ( f @ $true )
= ( g @ $true ) ) )
& ( a
| ( ( f @ $true )
= ( g @ $false ) ) ) ) )
& ( b
| ( ( ~ a
| ( ( f @ $false )
= ( g @ $true ) ) )
& ( a
| ( ( f @ $false )
= ( g @ $false ) ) ) ) ) )
| ( ( ~ a
| ( ( ~ c
| ( ( f1 @ $true )
= ( g1 @ $true ) ) )
& ( c
| ( ( f1 @ $true )
= ( g1 @ $false ) ) ) ) )
& ( a
| ( ( ~ c
| ( ( f1 @ $false )
= ( g1 @ $true ) ) )
& ( c
| ( ( f1 @ $false )
= ( g1 @ $false ) ) ) ) ) )
| ~ ( ( ~ c
| ( ( ~ a
| ( ( f1 @ $true )
= ( g1 @ $true ) ) )
& ( a
| ( ( f1 @ $true )
= ( g1 @ $false ) ) ) ) )
& ( c
| ( ( ~ a
| ( ( f1 @ $false )
= ( g1 @ $true ) ) )
& ( a
| ( ( f1 @ $false )
= ( g1 @ $false ) ) ) ) ) )
| ( ( ~ b
| ( ( ~ c
| ( ( f2 @ $true )
= ( g2 @ $true ) ) )
& ( c
| ( ( f2 @ $true )
= ( g2 @ $false ) ) ) ) )
& ( b
| ( ( ~ c
| ( ( f2 @ $false )
= ( g2 @ $true ) ) )
& ( c
| ( ( f2 @ $false )
= ( g2 @ $false ) ) ) ) ) )
| ~ ( ( ~ c
| ( ( ~ b
| ( ( f2 @ $true )
= ( g2 @ $true ) ) )
& ( b
| ( ( f2 @ $true )
= ( g2 @ $false ) ) ) ) )
& ( c
| ( ( ~ b
| ( ( f2 @ $false )
= ( g2 @ $true ) ) )
& ( b
| ( ( f2 @ $false )
= ( g2 @ $false ) ) ) ) ) ) ),
inference(fool_unroll,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
( ( ~ a
| a )
& ( ~ b
| b
| a )
& ( ( ( f @ $false )
!= ( g @ $false ) )
| b
| a )
& ( ~ b
| ( ( f @ $false )
!= ( g @ $true ) )
| a )
& ( ( ( f @ $false )
!= ( g @ $false ) )
| ( ( f @ $false )
!= ( g @ $true ) )
| a )
& ( ~ a
| ~ b
| b )
& ( ~ b
| b
| ~ b
| b )
& ( ( ( f @ $false )
!= ( g @ $false ) )
| b
| ~ b
| b )
& ( ~ b
| ( ( f @ $false )
!= ( g @ $true ) )
| ~ b
| b )
& ( ( ( f @ $false )
!= ( g @ $false ) )
| ( ( f @ $false )
!= ( g @ $true ) )
| ~ b
| b )
& ( ~ a
| ( ( f @ $true )
!= ( g @ $false ) )
| b )
& ( ~ b
| b
| ( ( f @ $true )
!= ( g @ $false ) )
| b )
& ( ( ( f @ $false )
!= ( g @ $false ) )
| b
| ( ( f @ $true )
!= ( g @ $false ) )
| b )
& ( ~ b
| ( ( f @ $false )
!= ( g @ $true ) )
| ( ( f @ $true )
!= ( g @ $false ) )
| b )
& ( ( ( f @ $false )
!= ( g @ $false ) )
| ( ( f @ $false )
!= ( g @ $true ) )
| ( ( f @ $true )
!= ( g @ $false ) )
| b )
& ( ~ a
| ~ b
| ( ( f @ $true )
!= ( g @ $true ) ) )
& ( ~ b
| b
| ~ b
| ( ( f @ $true )
!= ( g @ $true ) ) )
& ( ( ( f @ $false )
!= ( g @ $false ) )
| b
| ~ b
| ( ( f @ $true )
!= ( g @ $true ) ) )
& ( ~ b
| ( ( f @ $false )
!= ( g @ $true ) )
| ~ b
| ( ( f @ $true )
!= ( g @ $true ) ) )
& ( ( ( f @ $false )
!= ( g @ $false ) )
| ( ( f @ $false )
!= ( g @ $true ) )
| ~ b
| ( ( f @ $true )
!= ( g @ $true ) ) )
& ( ~ a
| ( ( f @ $true )
!= ( g @ $false ) )
| ( ( f @ $true )
!= ( g @ $true ) ) )
& ( ~ b
| b
| ( ( f @ $true )
!= ( g @ $false ) )
| ( ( f @ $true )
!= ( g @ $true ) ) )
& ( ( ( f @ $false )
!= ( g @ $false ) )
| b
| ( ( f @ $true )
!= ( g @ $false ) )
| ( ( f @ $true )
!= ( g @ $true ) ) )
& ( ~ b
| ( ( f @ $false )
!= ( g @ $true ) )
| ( ( f @ $true )
!= ( g @ $false ) )
| ( ( f @ $true )
!= ( g @ $true ) ) )
& ( ( ( f @ $false )
!= ( g @ $false ) )
| ( ( f @ $false )
!= ( g @ $true ) )
| ( ( f @ $true )
!= ( g @ $false ) )
| ( ( f @ $true )
!= ( g @ $true ) ) )
& ( ~ a
| ( ( f @ $true )
= ( g @ $true ) )
| ~ b )
& ( a
| ( ( f @ $true )
= ( g @ $false ) )
| ~ b )
& ( ~ a
| ( ( f @ $false )
= ( g @ $true ) )
| b )
& ( a
| ( ( f @ $false )
= ( g @ $false ) )
| b )
& ( ~ a
| a )
& ( ~ c
| c
| a )
& ( ( ( f1 @ $false )
!= ( g1 @ $false ) )
| c
| a )
& ( ~ c
| ( ( f1 @ $false )
!= ( g1 @ $true ) )
| a )
& ( ( ( f1 @ $false )
!= ( g1 @ $false ) )
| ( ( f1 @ $false )
!= ( g1 @ $true ) )
| a )
& ( ~ a
| ~ c
| c )
& ( ~ c
| c
| ~ c
| c )
& ( ( ( f1 @ $false )
!= ( g1 @ $false ) )
| c
| ~ c
| c )
& ( ~ c
| ( ( f1 @ $false )
!= ( g1 @ $true ) )
| ~ c
| c )
& ( ( ( f1 @ $false )
!= ( g1 @ $false ) )
| ( ( f1 @ $false )
!= ( g1 @ $true ) )
| ~ c
| c )
& ( ~ a
| ( ( f1 @ $true )
!= ( g1 @ $false ) )
| c )
& ( ~ c
| c
| ( ( f1 @ $true )
!= ( g1 @ $false ) )
| c )
& ( ( ( f1 @ $false )
!= ( g1 @ $false ) )
| c
| ( ( f1 @ $true )
!= ( g1 @ $false ) )
| c )
& ( ~ c
| ( ( f1 @ $false )
!= ( g1 @ $true ) )
| ( ( f1 @ $true )
!= ( g1 @ $false ) )
| c )
& ( ( ( f1 @ $false )
!= ( g1 @ $false ) )
| ( ( f1 @ $false )
!= ( g1 @ $true ) )
| ( ( f1 @ $true )
!= ( g1 @ $false ) )
| c )
& ( ~ a
| ~ c
| ( ( f1 @ $true )
!= ( g1 @ $true ) ) )
& ( ~ c
| c
| ~ c
| ( ( f1 @ $true )
!= ( g1 @ $true ) ) )
& ( ( ( f1 @ $false )
!= ( g1 @ $false ) )
| c
| ~ c
| ( ( f1 @ $true )
!= ( g1 @ $true ) ) )
& ( ~ c
| ( ( f1 @ $false )
!= ( g1 @ $true ) )
| ~ c
| ( ( f1 @ $true )
!= ( g1 @ $true ) ) )
& ( ( ( f1 @ $false )
!= ( g1 @ $false ) )
| ( ( f1 @ $false )
!= ( g1 @ $true ) )
| ~ c
| ( ( f1 @ $true )
!= ( g1 @ $true ) ) )
& ( ~ a
| ( ( f1 @ $true )
!= ( g1 @ $false ) )
| ( ( f1 @ $true )
!= ( g1 @ $true ) ) )
& ( ~ c
| c
| ( ( f1 @ $true )
!= ( g1 @ $false ) )
| ( ( f1 @ $true )
!= ( g1 @ $true ) ) )
& ( ( ( f1 @ $false )
!= ( g1 @ $false ) )
| c
| ( ( f1 @ $true )
!= ( g1 @ $false ) )
| ( ( f1 @ $true )
!= ( g1 @ $true ) ) )
& ( ~ c
| ( ( f1 @ $false )
!= ( g1 @ $true ) )
| ( ( f1 @ $true )
!= ( g1 @ $false ) )
| ( ( f1 @ $true )
!= ( g1 @ $true ) ) )
& ( ( ( f1 @ $false )
!= ( g1 @ $false ) )
| ( ( f1 @ $false )
!= ( g1 @ $true ) )
| ( ( f1 @ $true )
!= ( g1 @ $false ) )
| ( ( f1 @ $true )
!= ( g1 @ $true ) ) )
& ( ~ a
| ( ( f1 @ $true )
= ( g1 @ $true ) )
| ~ c )
& ( a
| ( ( f1 @ $true )
= ( g1 @ $false ) )
| ~ c )
& ( ~ a
| ( ( f1 @ $false )
= ( g1 @ $true ) )
| c )
& ( a
| ( ( f1 @ $false )
= ( g1 @ $false ) )
| c )
& ( ~ b
| b )
& ( ~ c
| c
| b )
& ( ( ( f2 @ $false )
!= ( g2 @ $false ) )
| c
| b )
& ( ~ c
| ( ( f2 @ $false )
!= ( g2 @ $true ) )
| b )
& ( ( ( f2 @ $false )
!= ( g2 @ $false ) )
| ( ( f2 @ $false )
!= ( g2 @ $true ) )
| b )
& ( ~ b
| ~ c
| c )
& ( ~ c
| c
| ~ c
| c )
& ( ( ( f2 @ $false )
!= ( g2 @ $false ) )
| c
| ~ c
| c )
& ( ~ c
| ( ( f2 @ $false )
!= ( g2 @ $true ) )
| ~ c
| c )
& ( ( ( f2 @ $false )
!= ( g2 @ $false ) )
| ( ( f2 @ $false )
!= ( g2 @ $true ) )
| ~ c
| c )
& ( ~ b
| ( ( f2 @ $true )
!= ( g2 @ $false ) )
| c )
& ( ~ c
| c
| ( ( f2 @ $true )
!= ( g2 @ $false ) )
| c )
& ( ( ( f2 @ $false )
!= ( g2 @ $false ) )
| c
| ( ( f2 @ $true )
!= ( g2 @ $false ) )
| c )
& ( ~ c
| ( ( f2 @ $false )
!= ( g2 @ $true ) )
| ( ( f2 @ $true )
!= ( g2 @ $false ) )
| c )
& ( ( ( f2 @ $false )
!= ( g2 @ $false ) )
| ( ( f2 @ $false )
!= ( g2 @ $true ) )
| ( ( f2 @ $true )
!= ( g2 @ $false ) )
| c )
& ( ~ b
| ~ c
| ( ( f2 @ $true )
!= ( g2 @ $true ) ) )
& ( ~ c
| c
| ~ c
| ( ( f2 @ $true )
!= ( g2 @ $true ) ) )
& ( ( ( f2 @ $false )
!= ( g2 @ $false ) )
| c
| ~ c
| ( ( f2 @ $true )
!= ( g2 @ $true ) ) )
& ( ~ c
| ( ( f2 @ $false )
!= ( g2 @ $true ) )
| ~ c
| ( ( f2 @ $true )
!= ( g2 @ $true ) ) )
& ( ( ( f2 @ $false )
!= ( g2 @ $false ) )
| ( ( f2 @ $false )
!= ( g2 @ $true ) )
| ~ c
| ( ( f2 @ $true )
!= ( g2 @ $true ) ) )
& ( ~ b
| ( ( f2 @ $true )
!= ( g2 @ $false ) )
| ( ( f2 @ $true )
!= ( g2 @ $true ) ) )
& ( ~ c
| c
| ( ( f2 @ $true )
!= ( g2 @ $false ) )
| ( ( f2 @ $true )
!= ( g2 @ $true ) ) )
& ( ( ( f2 @ $false )
!= ( g2 @ $false ) )
| c
| ( ( f2 @ $true )
!= ( g2 @ $false ) )
| ( ( f2 @ $true )
!= ( g2 @ $true ) ) )
& ( ~ c
| ( ( f2 @ $false )
!= ( g2 @ $true ) )
| ( ( f2 @ $true )
!= ( g2 @ $false ) )
| ( ( f2 @ $true )
!= ( g2 @ $true ) ) )
& ( ( ( f2 @ $false )
!= ( g2 @ $false ) )
| ( ( f2 @ $false )
!= ( g2 @ $true ) )
| ( ( f2 @ $true )
!= ( g2 @ $false ) )
| ( ( f2 @ $true )
!= ( g2 @ $true ) ) )
& ( ~ b
| ( ( f2 @ $true )
= ( g2 @ $true ) )
| ~ c )
& ( b
| ( ( f2 @ $true )
= ( g2 @ $false ) )
| ~ c )
& ( ~ b
| ( ( f2 @ $false )
= ( g2 @ $true ) )
| c )
& ( b
| ( ( f2 @ $false )
= ( g2 @ $false ) )
| c ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
thf(c_0_4,negated_conjecture,
( ~ a
| ~ b
| ( ( f @ $true )
!= ( g @ $true ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
( ( ( f @ $true )
= ( g @ $true ) )
| ~ a
| ~ b ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
( c
| a
| ( ( f1 @ ~ $true )
!= ( g1 @ ~ $true ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
( a
| ( ( f1 @ ~ $true )
= ( g1 @ ~ $true ) )
| c ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_8,negated_conjecture,
( c
| b
| ( ( f2 @ ~ $true )
!= ( g2 @ ~ $true ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_9,negated_conjecture,
( b
| ( ( f2 @ ~ $true )
= ( g2 @ ~ $true ) )
| c ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_10,negated_conjecture,
( ~ a
| ~ b ),
inference(csr,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_11,negated_conjecture,
( c
| a ),
inference(csr,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_12,negated_conjecture,
( c
| b ),
inference(csr,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_13,negated_conjecture,
( ( ( f1 @ $true )
= ( g1 @ $true ) )
| ~ a
| ~ c ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_14,negated_conjecture,
c,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
thf(c_0_15,negated_conjecture,
( b
| a
| ( ( f @ ~ $true )
!= ( g @ ~ $true ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_16,negated_conjecture,
( a
| ( ( f @ ~ $true )
= ( g @ ~ $true ) )
| b ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_17,negated_conjecture,
( ~ a
| ~ c
| ( ( f1 @ $true )
!= ( g1 @ $true ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_18,negated_conjecture,
( ( ( f1 @ $true )
= ( g1 @ $true ) )
| ~ a ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
thf(c_0_19,negated_conjecture,
( ( ( f2 @ $true )
= ( g2 @ $true ) )
| ~ b
| ~ c ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_20,negated_conjecture,
( b
| a ),
inference(csr,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_21,negated_conjecture,
~ a,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_14])]),c_0_18]) ).
thf(c_0_22,negated_conjecture,
( ( ( f2 @ $true )
= ( g2 @ $true ) )
| ~ b ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_14])]) ).
thf(c_0_23,negated_conjecture,
b,
inference(sr,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_24,negated_conjecture,
( ~ b
| ~ c
| ( ( f2 @ $true )
!= ( g2 @ $true ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_25,negated_conjecture,
( ( f2 @ $true )
= ( g2 @ $true ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
thf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_23]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO499^1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.18 % Computer : n019.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 17:10:47 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running higher-order theorem proving
% 0.09/0.23 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.9AaKoNpozH/E---3.1_1093371.p
% 0.09/0.25 % Version: 3.5.1-ho
% 0.09/0.25 % Preprocessing class: HSSSSLSSSSSNFFN.
% 0.09/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.09/0.25 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.09/0.25 % Starting ho_unfolding_6 with 300s (1) cores
% 0.09/0.25 % Starting sh4l with 300s (1) cores
% 0.09/0.25 % ehoh_best8_lambda with pid 1093402 completed with status 0
% 0.09/0.25 % Result found by ehoh_best8_lambda
% 0.09/0.25 % Preprocessing class: HSSSSLSSSSSNFFN.
% 0.09/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.09/0.25 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.09/0.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = Auto)
% 0.09/0.25 % No SInE strategy applied
% 0.09/0.25 % Search class: HGHSF-FFMS11-SFFFFFNN
% 0.09/0.25 % partial match(1): HGHSF-FFMM11-SFFFFFNN
% 0.09/0.25 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.25 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.25 % SubtermCWHack with pid 1093407 completed with status 0
% 0.09/0.25 % Result found by SubtermCWHack
% 0.09/0.25 % Preprocessing class: HSSSSLSSSSSNFFN.
% 0.09/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.09/0.25 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.09/0.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = Auto)
% 0.09/0.25 % No SInE strategy applied
% 0.09/0.25 % Search class: HGHSF-FFMS11-SFFFFFNN
% 0.09/0.25 % partial match(1): HGHSF-FFMM11-SFFFFFNN
% 0.09/0.25 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.25 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.25 % Preprocessing time : 0.002 s
% 0.09/0.25
% 0.09/0.25 % Proof found!
% 0.09/0.25 % SZS status Theorem
% 0.09/0.25 % SZS output start CNFRefutation
% See solution above
% 0.09/0.25 % Parsed axioms : 10
% 0.09/0.25 % Removed by relevancy pruning/SinE : 0
% 0.09/0.25 % Initial clauses : 96
% 0.09/0.25 % Removed in clause preprocessing : 45
% 0.09/0.25 % Initial clauses in saturation : 51
% 0.09/0.25 % Processed clauses : 33
% 0.09/0.25 % ...of these trivial : 0
% 0.09/0.25 % ...subsumed : 0
% 0.09/0.25 % ...remaining for further processing : 32
% 0.09/0.25 % Other redundant clauses eliminated : 0
% 0.09/0.25 % Clauses deleted for lack of memory : 0
% 0.09/0.25 % Backward-subsumed : 7
% 0.09/0.25 % Backward-rewritten : 15
% 0.09/0.25 % Generated clauses : 21
% 0.09/0.25 % ...of the previous two non-redundant : 9
% 0.09/0.25 % ...aggressively subsumed : 0
% 0.09/0.25 % Contextual simplify-reflections : 12
% 0.09/0.25 % Paramodulations : 19
% 0.09/0.25 % Factorizations : 0
% 0.09/0.25 % NegExts : 0
% 0.09/0.25 % Equation resolutions : 0
% 0.09/0.25 % Disequality decompositions : 0
% 0.09/0.25 % Total rewrite steps : 19
% 0.09/0.25 % ...of those cached : 16
% 0.09/0.25 % Propositional unsat checks : 0
% 0.09/0.25 % Propositional check models : 0
% 0.09/0.25 % Propositional check unsatisfiable : 0
% 0.09/0.25 % Propositional clauses : 0
% 0.09/0.25 % Propositional clauses after purity: 0
% 0.09/0.25 % Propositional unsat core size : 0
% 0.09/0.25 % Propositional preprocessing time : 0.000
% 0.09/0.25 % Propositional encoding time : 0.000
% 0.09/0.25 % Propositional solver time : 0.000
% 0.09/0.25 % Success case prop preproc time : 0.000
% 0.09/0.25 % Success case prop encoding time : 0.000
% 0.09/0.25 % Success case prop solver time : 0.000
% 0.09/0.25 % Current number of processed clauses : 8
% 0.09/0.25 % Positive orientable unit clauses : 5
% 0.09/0.25 % Positive unorientable unit clauses: 0
% 0.09/0.25 % Negative unit clauses : 1
% 0.09/0.25 % Non-unit-clauses : 2
% 0.09/0.25 % Current number of unprocessed clauses: 27
% 0.09/0.25 % ...number of literals in the above : 96
% 0.09/0.25 % Current number of archived formulas : 0
% 0.09/0.25 % Current number of archived clauses : 24
% 0.09/0.25 % Clause-clause subsumption calls (NU) : 33
% 0.09/0.25 % Rec. Clause-clause subsumption calls : 33
% 0.09/0.25 % Non-unit clause-clause subsumptions : 16
% 0.09/0.25 % Unit Clause-clause subsumption calls : 9
% 0.09/0.25 % Rewrite failures with RHS unbound : 0
% 0.09/0.25 % BW rewrite match attempts : 2
% 0.09/0.25 % BW rewrite match successes : 2
% 0.09/0.25 % Condensation attempts : 0
% 0.09/0.25 % Condensation successes : 0
% 0.09/0.25 % Termbank termtop insertions : 3449
% 0.09/0.25 % Search garbage collected termcells : 361
% 0.09/0.25
% 0.09/0.25 % -------------------------------------------------
% 0.09/0.25 % User time : 0.004 s
% 0.09/0.25 % System time : 0.004 s
% 0.09/0.25 % Total time : 0.008 s
% 0.09/0.25 % Maximum resident set size: 3628 pages
% 0.09/0.25
% 0.09/0.25 % -------------------------------------------------
% 0.09/0.25 % User time : 0.007 s
% 0.09/0.25 % System time : 0.007 s
% 0.09/0.25 % Total time : 0.014 s
% 0.09/0.25 % Maximum resident set size: 4608 pages
% 0.09/0.25 % E exiting
%------------------------------------------------------------------------------