%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO041_8 : TPTP v9.3.1. Released v8.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 : Thu Sep 24 03:45:22 PM UTC 2026
% Result : Theorem 0.28s 0.57s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 4
% Syntax : Number of formulae : 65 ( 9 unt; 0 def)
% Number of atoms : 661 ( 0 equ)
% Maximal formula atoms : 131 ( 10 avg)
% Number of connectives : 873 ( 277 ~; 457 |; 124 &)
% ( 13 <=>; 0 =>; 0 <=; 2 <~>)
% Maximal formula depth : 33 ( 5 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-1 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
tff(decl_24,type,
f: $o > $o ).
tff(decl_25,type,
g: $o > $o ).
tff(decl_26,type,
x: $o ).
tff(decl_27,type,
y: $o ).
tff(decl_28,type,
epred1_0: $o ).
tff(decl_29,type,
epred2_0: $o ).
tff(decl_30,type,
epred3_0: $o ).
fof(3,conjecture,
~ ( ( f(f(f(x)))
<=> g(f(x)) )
& ( g(y)
<=> x )
& ( g(x)
<=> y )
& ( x
<~> y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',3) ).
fof(c_0_1,negated_conjecture,
~ ~ ( ( f(f(f(x)))
<=> g(f(x)) )
& ( g(y)
<=> x )
& ( g(x)
<=> y )
& ( x
<~> y ) ),
inference(assume_negation,[status(cth)],[3]) ).
fof(c_0_2,plain,
( epred1_0
<=> ( ( ~ f($false)
| ( ( f($false)
| x )
& ( f($true)
| ~ x ) ) )
& ( ~ f($true)
| ( ( ~ f($false)
| x )
& ( ~ f($true)
| ~ x ) ) ) ) ),
introduced(definition) ).
fof(c_0_3,plain,
( epred2_0
<=> ( ( f($false)
| ( ( f($false)
| x )
& ( f($true)
| ~ x ) ) )
& ( f($true)
| ( ( ~ f($false)
| x )
& ( ~ f($true)
| ~ x ) ) ) ) ),
introduced(definition) ).
fof(c_0_4,plain,
( epred3_0
<=> ( ( g($false)
| ( ( f($false)
| x )
& ( f($true)
| ~ x ) ) )
& ( g($true)
| ( ( ~ f($false)
| x )
& ( ~ f($true)
| ~ x ) ) ) ) ),
introduced(definition) ).
fof(c_0_5,negated_conjecture,
~ ~ ( ( ( ( f($false)
| epred2_0 )
& ( f($true)
| epred1_0 ) )
<=> epred3_0 )
& ( ( ( g($false)
| y )
& ( g($true)
| ~ y ) )
<=> x )
& ( ( ( g($false)
| x )
& ( g($true)
| ~ x ) )
<=> y )
& ~ ( x
<=> y ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[c_0_1])]),c_0_2]),c_0_3]),c_0_4]) ).
fof(c_0_6,plain,
( ( epred1_0
| f($true)
| f($false) )
& ( epred1_0
| f($true)
| ~ f($true)
| ~ f($false) )
& ( epred1_0
| f($true)
| ~ f($true)
| ~ x )
& ( epred1_0
| f($true)
| x
| ~ f($false) )
& ( epred1_0
| f($true)
| x
| ~ x )
& ( epred1_0
| f($true)
| f($false)
| f($false) )
& ( epred1_0
| f($true)
| f($false)
| ~ f($true)
| ~ f($false) )
& ( epred1_0
| f($true)
| f($false)
| ~ f($true)
| ~ x )
& ( epred1_0
| f($true)
| f($false)
| x
| ~ f($false) )
& ( epred1_0
| f($true)
| f($false)
| x
| ~ x )
& ( epred1_0
| f($true)
| ~ x
| f($false) )
& ( epred1_0
| f($true)
| ~ x
| ~ f($true)
| ~ f($false) )
& ( epred1_0
| f($true)
| ~ x
| ~ f($true)
| ~ x )
& ( epred1_0
| f($true)
| ~ x
| x
| ~ f($false) )
& ( epred1_0
| f($true)
| ~ x
| x
| ~ x )
& ( epred1_0
| x
| f($false)
| f($false) )
& ( epred1_0
| x
| f($false)
| ~ f($true)
| ~ f($false) )
& ( epred1_0
| x
| f($false)
| ~ f($true)
| ~ x )
& ( epred1_0
| x
| f($false)
| x
| ~ f($false) )
& ( epred1_0
| x
| f($false)
| x
| ~ x )
& ( epred1_0
| x
| ~ x
| f($false) )
& ( epred1_0
| x
| ~ x
| ~ f($true)
| ~ f($false) )
& ( epred1_0
| x
| ~ x
| ~ f($true)
| ~ x )
& ( epred1_0
| x
| ~ x
| x
| ~ f($false) )
& ( epred1_0
| x
| ~ x
| x
| ~ x )
& ( ~ epred1_0
| ~ f($false)
| f($false)
| x )
& ( ~ epred1_0
| ~ f($false)
| f($true)
| ~ x )
& ( ~ epred1_0
| ~ f($true)
| ~ f($false)
| x )
& ( ~ epred1_0
| ~ f($true)
| ~ f($true)
| ~ x ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_7,negated_conjecture,
( ( ~ epred3_0
| f($false)
| epred2_0 )
& ( ~ epred3_0
| f($true)
| epred1_0 )
& ( epred3_0
| ~ f($true)
| ~ f($false) )
& ( epred3_0
| ~ f($true)
| ~ epred2_0 )
& ( epred3_0
| ~ epred1_0
| ~ f($false) )
& ( epred3_0
| ~ epred1_0
| ~ epred2_0 )
& ( ~ x
| g($false)
| y )
& ( ~ x
| g($true)
| ~ y )
& ( x
| ~ g($true)
| ~ g($false) )
& ( x
| ~ g($true)
| ~ y )
& ( x
| y
| ~ g($false) )
& ( x
| y
| ~ y )
& ( ~ y
| g($false)
| x )
& ( ~ y
| g($true)
| ~ x )
& ( y
| ~ g($true)
| ~ g($false) )
& ( y
| ~ g($true)
| ~ x )
& ( y
| x
| ~ g($false) )
& ( y
| x
| ~ x )
& ( y
| x )
& ( ~ y
| ~ x ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_8,plain,
( epred1_0
| x
| f($false)
| f($false) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
( ( epred3_0
| ~ g($true)
| ~ g($false) )
& ( epred3_0
| ~ g($true)
| ~ f($true)
| ~ f($false) )
& ( epred3_0
| ~ g($true)
| ~ f($true)
| ~ x )
& ( epred3_0
| ~ g($true)
| x
| ~ f($false) )
& ( epred3_0
| ~ g($true)
| x
| ~ x )
& ( epred3_0
| f($true)
| f($false)
| ~ g($false) )
& ( epred3_0
| f($true)
| f($false)
| ~ f($true)
| ~ f($false) )
& ( epred3_0
| f($true)
| f($false)
| ~ f($true)
| ~ x )
& ( epred3_0
| f($true)
| f($false)
| x
| ~ f($false) )
& ( epred3_0
| f($true)
| f($false)
| x
| ~ x )
& ( epred3_0
| f($true)
| ~ x
| ~ g($false) )
& ( epred3_0
| f($true)
| ~ x
| ~ f($true)
| ~ f($false) )
& ( epred3_0
| f($true)
| ~ x
| ~ f($true)
| ~ x )
& ( epred3_0
| f($true)
| ~ x
| x
| ~ f($false) )
& ( epred3_0
| f($true)
| ~ x
| x
| ~ x )
& ( epred3_0
| x
| f($false)
| ~ g($false) )
& ( epred3_0
| x
| f($false)
| ~ f($true)
| ~ f($false) )
& ( epred3_0
| x
| f($false)
| ~ f($true)
| ~ x )
& ( epred3_0
| x
| f($false)
| x
| ~ f($false) )
& ( epred3_0
| x
| f($false)
| x
| ~ x )
& ( epred3_0
| x
| ~ x
| ~ g($false) )
& ( epred3_0
| x
| ~ x
| ~ f($true)
| ~ f($false) )
& ( epred3_0
| x
| ~ x
| ~ f($true)
| ~ x )
& ( epred3_0
| x
| ~ x
| x
| ~ f($false) )
& ( epred3_0
| x
| ~ x
| x
| ~ x )
& ( ~ epred3_0
| g($false)
| f($false)
| x )
& ( ~ epred3_0
| g($false)
| f($true)
| ~ x )
& ( ~ epred3_0
| g($true)
| ~ f($false)
| x )
& ( ~ epred3_0
| g($true)
| ~ f($true)
| ~ x ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_10,negated_conjecture,
( ~ y
| g($false)
| x ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( y
| x ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
( ~ f($true)
| ~ f($false)
| epred3_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( f($false)
| epred1_0
| x ),
inference(cn,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ~ f($false)
| epred1_0
| f($true)
| x ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,plain,
( epred1_0
| f($true)
| f($false) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,plain,
( ~ g($false)
| epred3_0
| x
| f($false) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
( g($false)
| x ),
inference(csr,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,plain,
( ~ f($true)
| x
| epred1_0
| epred3_0 ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( f($true)
| x
| epred1_0 ),
inference(csr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( ~ epred1_0
| ~ f($false)
| epred3_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,plain,
( f($false)
| x
| epred3_0 ),
inference(csr,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( x
| epred1_0
| epred3_0 ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( ~ g($true)
| ~ y
| x ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_24,plain,
( ( epred2_0
| ~ f($true)
| ~ f($false) )
& ( epred2_0
| ~ f($true)
| ~ f($true)
| ~ f($false) )
& ( epred2_0
| ~ f($true)
| ~ f($true)
| ~ x )
& ( epred2_0
| ~ f($true)
| x
| ~ f($false) )
& ( epred2_0
| ~ f($true)
| x
| ~ x )
& ( epred2_0
| f($true)
| f($false)
| ~ f($false) )
& ( epred2_0
| f($true)
| f($false)
| ~ f($true)
| ~ f($false) )
& ( epred2_0
| f($true)
| f($false)
| ~ f($true)
| ~ x )
& ( epred2_0
| f($true)
| f($false)
| x
| ~ f($false) )
& ( epred2_0
| f($true)
| f($false)
| x
| ~ x )
& ( epred2_0
| f($true)
| ~ x
| ~ f($false) )
& ( epred2_0
| f($true)
| ~ x
| ~ f($true)
| ~ f($false) )
& ( epred2_0
| f($true)
| ~ x
| ~ f($true)
| ~ x )
& ( epred2_0
| f($true)
| ~ x
| x
| ~ f($false) )
& ( epred2_0
| f($true)
| ~ x
| x
| ~ x )
& ( epred2_0
| x
| f($false)
| ~ f($false) )
& ( epred2_0
| x
| f($false)
| ~ f($true)
| ~ f($false) )
& ( epred2_0
| x
| f($false)
| ~ f($true)
| ~ x )
& ( epred2_0
| x
| f($false)
| x
| ~ f($false) )
& ( epred2_0
| x
| f($false)
| x
| ~ x )
& ( epred2_0
| x
| ~ x
| ~ f($false) )
& ( epred2_0
| x
| ~ x
| ~ f($true)
| ~ f($false) )
& ( epred2_0
| x
| ~ x
| ~ f($true)
| ~ x )
& ( epred2_0
| x
| ~ x
| x
| ~ f($false) )
& ( epred2_0
| x
| ~ x
| x
| ~ x )
& ( ~ epred2_0
| f($false)
| f($false)
| x )
& ( ~ epred2_0
| f($false)
| f($true)
| ~ x )
& ( ~ epred2_0
| f($true)
| ~ f($false)
| x )
& ( ~ epred2_0
| f($true)
| ~ f($true)
| ~ x ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_25,plain,
( ~ epred3_0
| ~ f($false)
| g($true)
| x ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,negated_conjecture,
( x
| epred3_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( ~ g($true)
| x ),
inference(csr,[status(thm)],[c_0_23,c_0_11]) ).
cnf(c_0_28,plain,
( ~ epred2_0
| f($false)
| f($false)
| x ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
( ~ x
| ~ f($false)
| epred2_0
| f($true) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
( ~ f($false)
| x ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_31,plain,
( ~ f($true)
| ~ f($false)
| epred2_0 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,plain,
( ~ epred2_0
| f($false)
| x ),
inference(cn,[status(thm)],[c_0_28]) ).
cnf(c_0_33,plain,
( ~ f($false)
| epred2_0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_34,negated_conjecture,
( ~ epred3_0
| f($false)
| epred2_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_35,plain,
( ~ epred2_0
| x ),
inference(spm,[status(thm)],[c_0_30,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( ~ epred3_0
| epred2_0 ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
( ~ x
| g($false)
| y ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_38,negated_conjecture,
( ~ y
| ~ x ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_39,plain,
x,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_26]) ).
cnf(c_0_40,plain,
( ~ f($true)
| ~ f($true)
| ~ x
| epred2_0 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_41,negated_conjecture,
( g($false)
| y ),
inference(csr,[status(thm)],[c_0_37,c_0_17]) ).
cnf(c_0_42,negated_conjecture,
~ y,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).
cnf(c_0_43,plain,
( ~ f($true)
| ~ x
| epred2_0 ),
inference(cn,[status(thm)],[c_0_40]) ).
cnf(c_0_44,plain,
( ~ x
| ~ g($false)
| epred3_0
| f($true) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_45,negated_conjecture,
g($false),
inference(sr,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
( ~ g($true)
| ~ x
| y ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_47,plain,
( ~ epred3_0
| ~ f($true)
| ~ x
| g($true) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_48,plain,
( ~ f($true)
| epred2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_39])]) ).
cnf(c_0_49,plain,
( f($true)
| epred3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_39]),c_0_45])]) ).
cnf(c_0_50,negated_conjecture,
( ~ g($true)
| y ),
inference(csr,[status(thm)],[c_0_46,c_0_27]) ).
cnf(c_0_51,plain,
( ~ f($true)
| ~ epred3_0
| g($true) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_39])]) ).
cnf(c_0_52,negated_conjecture,
( ~ f($true)
| ~ epred2_0
| epred3_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_53,plain,
epred2_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_36]) ).
cnf(c_0_54,negated_conjecture,
( ~ f($true)
| ~ epred3_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_42]) ).
cnf(c_0_55,negated_conjecture,
( ~ epred3_0
| f($true)
| epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_56,plain,
( ~ epred2_0
| ~ x
| f($false)
| f($true) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_57,negated_conjecture,
epred3_0,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]),c_0_49]) ).
cnf(c_0_58,negated_conjecture,
( ~ epred3_0
| epred1_0 ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,plain,
( ~ epred2_0
| f($true)
| f($false) ),
inference(csr,[status(thm)],[c_0_56,c_0_32]) ).
cnf(c_0_60,negated_conjecture,
~ f($true),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_57])]) ).
cnf(c_0_61,plain,
( ~ epred1_0
| ~ f($false)
| ~ x
| f($true) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_62,negated_conjecture,
epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_57])]) ).
cnf(c_0_63,plain,
f($false),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_53])]),c_0_60]) ).
cnf(c_0_64,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_39]),c_0_62]),c_0_63])]),c_0_60]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO041_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.44 % Computer : n019.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Mon Sep 21 11:35:04 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.51 Running first-order theorem proving
% 0.18/0.51 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.28/0.57 % Version: 3.5.1
% 0.28/0.57 % Preprocessing class: FSSSSLSSSSSNFFN.
% 0.28/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.57 % Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.28/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.28/0.57 % Starting sh5l with 300s (1) cores
% 0.28/0.57 % new_bool_1 with pid 2461442 completed with status 0
% 0.28/0.57 % Result found by new_bool_1
% 0.28/0.57 % Preprocessing class: FSSSSLSSSSSNFFN.
% 0.28/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.57 % Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.28/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.28/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.28/0.57 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/0.57 % Search class: FGHNF-FFMS00-SFFFFFNN
% 0.28/0.57 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.28/0.57 % Starting SubtermCWHack with 31s (1) cores
% 0.28/0.57 % SubtermCWHack with pid 2461451 completed with status 0
% 0.28/0.57 % Result found by SubtermCWHack
% 0.28/0.57 % Preprocessing class: FSSSSLSSSSSNFFN.
% 0.28/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.57 % Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.28/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.28/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.28/0.57 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/0.57 % Search class: FGHNF-FFMS00-SFFFFFNN
% 0.28/0.57 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.28/0.57 % Starting SubtermCWHack with 31s (1) cores
% 0.28/0.57 % Preprocessing time : 0.002 s
% 0.28/0.57
% 0.28/0.57 % Proof found!
% 0.28/0.57 % SZS status Theorem
% 0.28/0.57 % SZS output start CNFRefutation
% See solution above
% 0.28/0.57 % Parsed axioms : 6
% 0.28/0.57 % Removed by relevancy pruning/SinE : 5
% 0.28/0.57 % Initial clauses : 107
% 0.28/0.57 % Removed in clause preprocessing : 62
% 0.28/0.57 % Initial clauses in saturation : 45
% 0.28/0.57 % Processed clauses : 76
% 0.28/0.57 % ...of these trivial : 0
% 0.28/0.57 % ...subsumed : 21
% 0.28/0.57 % ...remaining for further processing : 54
% 0.28/0.57 % Other redundant clauses eliminated : 0
% 0.28/0.57 % Clauses deleted for lack of memory : 0
% 0.28/0.57 % Backward-subsumed : 21
% 0.28/0.57 % Backward-rewritten : 23
% 0.28/0.57 % Generated clauses : 66
% 0.28/0.57 % ...of the previous two non-redundant : 45
% 0.28/0.57 % ...aggressively subsumed : 0
% 0.28/0.57 % Contextual simplify-reflections : 19
% 0.28/0.57 % Paramodulations : 65
% 0.28/0.57 % Factorizations : 0
% 0.28/0.57 % NegExts : 0
% 0.28/0.57 % Equation resolutions : 0
% 0.28/0.57 % Disequality decompositions : 0
% 0.28/0.57 % Total rewrite steps : 29
% 0.28/0.57 % ...of those cached : 23
% 0.28/0.57 % Propositional unsat checks : 0
% 0.28/0.57 % Propositional check models : 0
% 0.28/0.57 % Propositional check unsatisfiable : 0
% 0.28/0.57 % Propositional clauses : 0
% 0.28/0.57 % Propositional clauses after purity: 0
% 0.28/0.57 % Propositional unsat core size : 0
% 0.28/0.57 % Propositional preprocessing time : 0.000
% 0.28/0.57 % Propositional encoding time : 0.000
% 0.28/0.57 % Propositional solver time : 0.000
% 0.28/0.57 % Success case prop preproc time : 0.000
% 0.28/0.57 % Success case prop encoding time : 0.000
% 0.28/0.57 % Success case prop solver time : 0.000
% 0.28/0.57 % Current number of processed clauses : 9
% 0.28/0.57 % Positive orientable unit clauses : 6
% 0.28/0.57 % Positive unorientable unit clauses: 0
% 0.28/0.57 % Negative unit clauses : 2
% 0.28/0.57 % Non-unit-clauses : 1
% 0.28/0.57 % Current number of unprocessed clauses: 6
% 0.28/0.57 % ...number of literals in the above : 24
% 0.28/0.57 % Current number of archived formulas : 0
% 0.28/0.57 % Current number of archived clauses : 45
% 0.28/0.57 % Clause-clause subsumption calls (NU) : 112
% 0.28/0.57 % Rec. Clause-clause subsumption calls : 98
% 0.28/0.57 % Non-unit clause-clause subsumptions : 57
% 0.28/0.57 % Unit Clause-clause subsumption calls : 15
% 0.28/0.57 % Rewrite failures with RHS unbound : 0
% 0.28/0.57 % BW rewrite match attempts : 5
% 0.28/0.57 % BW rewrite match successes : 5
% 0.28/0.57 % Condensation attempts : 0
% 0.28/0.57 % Condensation successes : 0
% 0.28/0.57 % Termbank termtop insertions : 3901
% 0.28/0.57 % Search garbage collected termcells : 695
% 0.28/0.57
% 0.28/0.57 % -------------------------------------------------
% 0.28/0.57 % User time : 0.015 s
% 0.28/0.57 % System time : 0.001 s
% 0.28/0.57 % Total time : 0.017 s
% 0.28/0.57 % Maximum resident set size: 3628 pages
% 0.28/0.57
% 0.28/0.57 % -------------------------------------------------
% 0.28/0.57 % User time : 0.019 s
% 0.28/0.57 % System time : 0.006 s
% 0.28/0.57 % Total time : 0.025 s
% 0.28/0.57 % Maximum resident set size: 4608 pages
% 0.28/0.57 % E exiting
%------------------------------------------------------------------------------