%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM017+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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 12:11:28 PM UTC 2026
% Result : Theorem 1.31s 0.63s
% Output : CNFRefutation 1.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 6 unt; 0 def)
% Number of atoms : 340 ( 34 equ)
% Maximal formula atoms : 96 ( 14 avg)
% Number of connectives : 510 ( 193 ~; 217 |; 97 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 40 ( 0 sgn 14 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( ( sdtmndtasgtdt0(xv,xR,X1)
| sdtmndtplgtdt0(xv,xR,X1)
| ? [X2] :
( sdtmndtplgtdt0(X2,xR,X1)
& aReductOfIn0(X2,xv,xR)
& aElement0(X2) )
| aReductOfIn0(X1,xv,xR)
| xv = X1 )
& ( sdtmndtasgtdt0(xu,xR,X1)
| sdtmndtplgtdt0(xu,xR,X1)
| ? [X2] :
( sdtmndtplgtdt0(X2,xR,X1)
& aReductOfIn0(X2,xu,xR)
& aElement0(X2) )
| aReductOfIn0(X1,xu,xR)
| xu = X1 )
& aElement0(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__656_01,hypothesis,
( isTerminating0(xR)
& ! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> ( ( sdtmndtplgtdt0(X1,xR,X2)
| ? [X3] :
( sdtmndtplgtdt0(X3,xR,X2)
& aReductOfIn0(X3,X1,xR)
& aElement0(X3) )
| aReductOfIn0(X2,X1,xR) )
=> iLess0(X2,X1) ) )
& isLocallyConfluent0(xR)
& ! [X1,X2,X3] :
( ( aReductOfIn0(X3,X1,xR)
& aReductOfIn0(X2,X1,xR)
& aElement0(X3)
& aElement0(X2)
& aElement0(X1) )
=> ? [X4] :
( sdtmndtasgtdt0(X3,xR,X4)
& ( ( sdtmndtplgtdt0(X3,xR,X4)
& ( ? [X5] :
( sdtmndtplgtdt0(X5,xR,X4)
& aReductOfIn0(X5,X3,xR)
& aElement0(X5) )
| aReductOfIn0(X4,X3,xR) ) )
| X3 = X4 )
& sdtmndtasgtdt0(X2,xR,X4)
& ( ( sdtmndtplgtdt0(X2,xR,X4)
& ( ? [X5] :
( sdtmndtplgtdt0(X5,xR,X4)
& aReductOfIn0(X5,X2,xR)
& aElement0(X5) )
| aReductOfIn0(X4,X2,xR) ) )
| X2 = X4 )
& aElement0(X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__656_01) ).
fof(m__779,hypothesis,
( sdtmndtasgtdt0(xv,xR,xc)
& ( ( sdtmndtplgtdt0(xv,xR,xc)
& ( ? [X1] :
( sdtmndtplgtdt0(X1,xR,xc)
& aReductOfIn0(X1,xv,xR)
& aElement0(X1) )
| aReductOfIn0(xc,xv,xR) ) )
| xv = xc )
& aReductOfIn0(xv,xa,xR)
& aElement0(xv) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__779) ).
fof(m__755,hypothesis,
( sdtmndtasgtdt0(xu,xR,xb)
& ( ( sdtmndtplgtdt0(xu,xR,xb)
& ( ? [X1] :
( sdtmndtplgtdt0(X1,xR,xb)
& aReductOfIn0(X1,xu,xR)
& aElement0(X1) )
| aReductOfIn0(xb,xu,xR) ) )
| xu = xb )
& aReductOfIn0(xu,xa,xR)
& aElement0(xu) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__755) ).
fof(m__731,hypothesis,
( aElement0(xc)
& aElement0(xb)
& aElement0(xa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__731) ).
fof(c_0_5,negated_conjecture,
~ ? [X1] :
( ( sdtmndtasgtdt0(xv,xR,X1)
| sdtmndtplgtdt0(xv,xR,X1)
| ? [X2] :
( sdtmndtplgtdt0(X2,xR,X1)
& aReductOfIn0(X2,xv,xR)
& aElement0(X2) )
| aReductOfIn0(X1,xv,xR)
| xv = X1 )
& ( sdtmndtasgtdt0(xu,xR,X1)
| sdtmndtplgtdt0(xu,xR,X1)
| ? [X2] :
( sdtmndtplgtdt0(X2,xR,X1)
& aReductOfIn0(X2,xu,xR)
& aElement0(X2) )
| aReductOfIn0(X1,xu,xR)
| xu = X1 )
& aElement0(X1) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,negated_conjecture,
! [X85,X86,X87] :
( ( ~ aElement0(X85)
| ~ sdtmndtasgtdt0(xu,xR,X85)
| ~ sdtmndtasgtdt0(xv,xR,X85) )
& ( ~ aElement0(X85)
| ~ sdtmndtasgtdt0(xu,xR,X85)
| ~ sdtmndtplgtdt0(xv,xR,X85) )
& ( ~ aElement0(X85)
| ~ sdtmndtasgtdt0(xu,xR,X85)
| ~ sdtmndtplgtdt0(X87,xR,X85)
| ~ aReductOfIn0(X87,xv,xR)
| ~ aElement0(X87) )
& ( ~ aElement0(X85)
| ~ sdtmndtasgtdt0(xu,xR,X85)
| ~ aReductOfIn0(X85,xv,xR) )
& ( ~ aElement0(X85)
| ~ sdtmndtasgtdt0(xu,xR,X85)
| xv != X85 )
& ( ~ aElement0(X85)
| ~ sdtmndtplgtdt0(xu,xR,X85)
| ~ sdtmndtasgtdt0(xv,xR,X85) )
& ( ~ aElement0(X85)
| ~ sdtmndtplgtdt0(xu,xR,X85)
| ~ sdtmndtplgtdt0(xv,xR,X85) )
& ( ~ aElement0(X85)
| ~ sdtmndtplgtdt0(xu,xR,X85)
| ~ sdtmndtplgtdt0(X87,xR,X85)
| ~ aReductOfIn0(X87,xv,xR)
| ~ aElement0(X87) )
& ( ~ aElement0(X85)
| ~ sdtmndtplgtdt0(xu,xR,X85)
| ~ aReductOfIn0(X85,xv,xR) )
& ( ~ aElement0(X85)
| ~ sdtmndtplgtdt0(xu,xR,X85)
| xv != X85 )
& ( ~ aElement0(X85)
| ~ sdtmndtplgtdt0(X86,xR,X85)
| ~ aReductOfIn0(X86,xu,xR)
| ~ aElement0(X86)
| ~ sdtmndtasgtdt0(xv,xR,X85) )
& ( ~ aElement0(X85)
| ~ sdtmndtplgtdt0(X86,xR,X85)
| ~ aReductOfIn0(X86,xu,xR)
| ~ aElement0(X86)
| ~ sdtmndtplgtdt0(xv,xR,X85) )
& ( ~ aElement0(X85)
| ~ sdtmndtplgtdt0(X86,xR,X85)
| ~ aReductOfIn0(X86,xu,xR)
| ~ aElement0(X86)
| ~ sdtmndtplgtdt0(X87,xR,X85)
| ~ aReductOfIn0(X87,xv,xR)
| ~ aElement0(X87) )
& ( ~ aElement0(X85)
| ~ sdtmndtplgtdt0(X86,xR,X85)
| ~ aReductOfIn0(X86,xu,xR)
| ~ aElement0(X86)
| ~ aReductOfIn0(X85,xv,xR) )
& ( ~ aElement0(X85)
| ~ sdtmndtplgtdt0(X86,xR,X85)
| ~ aReductOfIn0(X86,xu,xR)
| ~ aElement0(X86)
| xv != X85 )
& ( ~ aElement0(X85)
| ~ aReductOfIn0(X85,xu,xR)
| ~ sdtmndtasgtdt0(xv,xR,X85) )
& ( ~ aElement0(X85)
| ~ aReductOfIn0(X85,xu,xR)
| ~ sdtmndtplgtdt0(xv,xR,X85) )
& ( ~ aElement0(X85)
| ~ aReductOfIn0(X85,xu,xR)
| ~ sdtmndtplgtdt0(X87,xR,X85)
| ~ aReductOfIn0(X87,xv,xR)
| ~ aElement0(X87) )
& ( ~ aElement0(X85)
| ~ aReductOfIn0(X85,xu,xR)
| ~ aReductOfIn0(X85,xv,xR) )
& ( ~ aElement0(X85)
| ~ aReductOfIn0(X85,xu,xR)
| xv != X85 )
& ( ~ aElement0(X85)
| xu != X85
| ~ sdtmndtasgtdt0(xv,xR,X85) )
& ( ~ aElement0(X85)
| xu != X85
| ~ sdtmndtplgtdt0(xv,xR,X85) )
& ( ~ aElement0(X85)
| xu != X85
| ~ sdtmndtplgtdt0(X87,xR,X85)
| ~ aReductOfIn0(X87,xv,xR)
| ~ aElement0(X87) )
& ( ~ aElement0(X85)
| xu != X85
| ~ aReductOfIn0(X85,xv,xR) )
& ( ~ aElement0(X85)
| xu != X85
| xv != X85 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
fof(c_0_7,hypothesis,
! [X64,X65,X66,X70,X71,X72] :
( isTerminating0(xR)
& ( ~ aElement0(X71)
| ~ aElement0(X70)
| iLess0(X71,X70)
| ~ sdtmndtplgtdt0(X70,xR,X71) )
& ( ~ aElement0(X71)
| ~ aElement0(X70)
| iLess0(X71,X70)
| ~ sdtmndtplgtdt0(X72,xR,X71)
| ~ aReductOfIn0(X72,X70,xR)
| ~ aElement0(X72) )
& ( ~ aElement0(X71)
| ~ aElement0(X70)
| iLess0(X71,X70)
| ~ aReductOfIn0(X71,X70,xR) )
& isLocallyConfluent0(xR)
& ( ~ aReductOfIn0(X66,X64,xR)
| ~ aReductOfIn0(X65,X64,xR)
| ~ aElement0(X66)
| ~ aElement0(X65)
| ~ aElement0(X64)
| sdtmndtasgtdt0(X66,xR,esk14_3(X64,X65,X66)) )
& ( ~ aReductOfIn0(X66,X64,xR)
| ~ aReductOfIn0(X65,X64,xR)
| ~ aElement0(X66)
| ~ aElement0(X65)
| ~ aElement0(X64)
| X66 = esk14_3(X64,X65,X66)
| sdtmndtplgtdt0(X66,xR,esk14_3(X64,X65,X66)) )
& ( ~ aReductOfIn0(X66,X64,xR)
| ~ aReductOfIn0(X65,X64,xR)
| ~ aElement0(X66)
| ~ aElement0(X65)
| ~ aElement0(X64)
| X66 = esk14_3(X64,X65,X66)
| aReductOfIn0(esk14_3(X64,X65,X66),X66,xR)
| sdtmndtplgtdt0(esk16_3(X64,X65,X66),xR,esk14_3(X64,X65,X66)) )
& ( ~ aReductOfIn0(X66,X64,xR)
| ~ aReductOfIn0(X65,X64,xR)
| ~ aElement0(X66)
| ~ aElement0(X65)
| ~ aElement0(X64)
| X66 = esk14_3(X64,X65,X66)
| aReductOfIn0(esk14_3(X64,X65,X66),X66,xR)
| aReductOfIn0(esk16_3(X64,X65,X66),X66,xR) )
& ( ~ aReductOfIn0(X66,X64,xR)
| ~ aReductOfIn0(X65,X64,xR)
| ~ aElement0(X66)
| ~ aElement0(X65)
| ~ aElement0(X64)
| X66 = esk14_3(X64,X65,X66)
| aReductOfIn0(esk14_3(X64,X65,X66),X66,xR)
| aElement0(esk16_3(X64,X65,X66)) )
& ( ~ aReductOfIn0(X66,X64,xR)
| ~ aReductOfIn0(X65,X64,xR)
| ~ aElement0(X66)
| ~ aElement0(X65)
| ~ aElement0(X64)
| sdtmndtasgtdt0(X65,xR,esk14_3(X64,X65,X66)) )
& ( ~ aReductOfIn0(X66,X64,xR)
| ~ aReductOfIn0(X65,X64,xR)
| ~ aElement0(X66)
| ~ aElement0(X65)
| ~ aElement0(X64)
| X65 = esk14_3(X64,X65,X66)
| sdtmndtplgtdt0(X65,xR,esk14_3(X64,X65,X66)) )
& ( ~ aReductOfIn0(X66,X64,xR)
| ~ aReductOfIn0(X65,X64,xR)
| ~ aElement0(X66)
| ~ aElement0(X65)
| ~ aElement0(X64)
| X65 = esk14_3(X64,X65,X66)
| aReductOfIn0(esk14_3(X64,X65,X66),X65,xR)
| sdtmndtplgtdt0(esk15_3(X64,X65,X66),xR,esk14_3(X64,X65,X66)) )
& ( ~ aReductOfIn0(X66,X64,xR)
| ~ aReductOfIn0(X65,X64,xR)
| ~ aElement0(X66)
| ~ aElement0(X65)
| ~ aElement0(X64)
| X65 = esk14_3(X64,X65,X66)
| aReductOfIn0(esk14_3(X64,X65,X66),X65,xR)
| aReductOfIn0(esk15_3(X64,X65,X66),X65,xR) )
& ( ~ aReductOfIn0(X66,X64,xR)
| ~ aReductOfIn0(X65,X64,xR)
| ~ aElement0(X66)
| ~ aElement0(X65)
| ~ aElement0(X64)
| X65 = esk14_3(X64,X65,X66)
| aReductOfIn0(esk14_3(X64,X65,X66),X65,xR)
| aElement0(esk15_3(X64,X65,X66)) )
& ( ~ aReductOfIn0(X66,X64,xR)
| ~ aReductOfIn0(X65,X64,xR)
| ~ aElement0(X66)
| ~ aElement0(X65)
| ~ aElement0(X64)
| aElement0(esk14_3(X64,X65,X66)) ) ),
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)],[m__656_01])])])])])]) ).
fof(c_0_8,hypothesis,
( sdtmndtasgtdt0(xv,xR,xc)
& ( xv = xc
| sdtmndtplgtdt0(xv,xR,xc) )
& ( xv = xc
| aReductOfIn0(xc,xv,xR)
| sdtmndtplgtdt0(esk23_0,xR,xc) )
& ( xv = xc
| aReductOfIn0(xc,xv,xR)
| aReductOfIn0(esk23_0,xv,xR) )
& ( xv = xc
| aReductOfIn0(xc,xv,xR)
| aElement0(esk23_0) )
& aReductOfIn0(xv,xa,xR)
& aElement0(xv) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__779])])]) ).
cnf(c_0_9,negated_conjecture,
( ~ aElement0(X1)
| ~ sdtmndtasgtdt0(xu,xR,X1)
| ~ sdtmndtasgtdt0(xv,xR,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
( ~ aReductOfIn0(X1,X2,xR)
| ~ aReductOfIn0(X3,X2,xR)
| ~ aElement0(X1)
| ~ aElement0(X3)
| ~ aElement0(X2)
| sdtmndtasgtdt0(X1,xR,esk14_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,hypothesis,
aElement0(xv),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,hypothesis,
( sdtmndtasgtdt0(xu,xR,xb)
& ( xu = xb
| sdtmndtplgtdt0(xu,xR,xb) )
& ( xu = xb
| aReductOfIn0(xb,xu,xR)
| sdtmndtplgtdt0(esk22_0,xR,xb) )
& ( xu = xb
| aReductOfIn0(xb,xu,xR)
| aReductOfIn0(esk22_0,xu,xR) )
& ( xu = xb
| aReductOfIn0(xb,xu,xR)
| aElement0(esk22_0) )
& aReductOfIn0(xu,xa,xR)
& aElement0(xu) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__755])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aElement0(esk14_3(X1,X2,xv))
| ~ aReductOfIn0(X2,X1,xR)
| ~ aReductOfIn0(xv,X1,xR)
| ~ sdtmndtasgtdt0(xu,xR,esk14_3(X1,X2,xv)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_14,hypothesis,
( ~ aReductOfIn0(X3,X2,xR)
| ~ aReductOfIn0(X1,X2,xR)
| ~ aElement0(X3)
| ~ aElement0(X1)
| ~ aElement0(X2)
| sdtmndtasgtdt0(X1,xR,esk14_3(X2,X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,hypothesis,
aElement0(xu),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( ~ aElement0(X1)
| ~ aElement0(esk14_3(X1,xu,xv))
| ~ aReductOfIn0(xu,X1,xR)
| ~ aReductOfIn0(xv,X1,xR) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_11])]) ).
cnf(c_0_17,hypothesis,
( ~ aReductOfIn0(X3,X1,xR)
| ~ aReductOfIn0(X2,X1,xR)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1)
| aElement0(esk14_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,hypothesis,
( ~ aElement0(X1)
| ~ aReductOfIn0(xu,X1,xR)
| ~ aReductOfIn0(xv,X1,xR) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_11]),c_0_15])]) ).
cnf(c_0_19,hypothesis,
aReductOfIn0(xv,xa,xR),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,hypothesis,
aReductOfIn0(xu,xa,xR),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__731]) ).
cnf(c_0_22,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM017+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n011.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 14:14:26 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 1.31/0.63 % Version: 3.5.1
% 1.31/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.31/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.31/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.31/0.63 % Starting new_bool_3 with 300s (1) cores
% 1.31/0.63 % Starting new_bool_1 with 300s (1) cores
% 1.31/0.63 % Starting sh5l with 300s (1) cores
% 1.31/0.63 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2124178 completed with status 0
% 1.31/0.63 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.31/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.31/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.31/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.31/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.31/0.63 % No SInE strategy applied
% 1.31/0.63 % Search class: FGHSF-FSLM32-SFFFFFNN
% 1.31/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.31/0.63 % Starting SubtermCWHack with 136s (1) cores
% 1.31/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.31/0.63 % Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 1.31/0.63 % Starting new_bool_3 with 136s (1) cores
% 1.31/0.63 % Starting U----_116_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN1 with 136s (1) cores
% 1.31/0.63 % U----_116_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN1 with pid 2124189 completed with status 0
% 1.31/0.63 % Result found by U----_116_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN1
% 1.31/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.31/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.31/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.31/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.31/0.63 % No SInE strategy applied
% 1.31/0.63 % Search class: FGHSF-FSLM32-SFFFFFNN
% 1.31/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.31/0.63 % Starting SubtermCWHack with 136s (1) cores
% 1.31/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.31/0.63 % Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 1.31/0.63 % Starting new_bool_3 with 136s (1) cores
% 1.31/0.63 % Starting U----_116_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN1 with 136s (1) cores
% 1.31/0.63 % Preprocessing time : 0.007 s
% 1.31/0.63 % Presaturation interreduction done
% 1.31/0.63
% 1.31/0.63 % Proof found!
% 1.31/0.63 % SZS status Theorem
% 1.31/0.63 % SZS output start CNFRefutation
% See solution above
% 1.31/0.63 % Parsed axioms : 22
% 1.31/0.63 % Removed by relevancy pruning/SinE : 0
% 1.31/0.63 % Initial clauses : 385
% 1.31/0.63 % Removed in clause preprocessing : 4
% 1.31/0.63 % Initial clauses in saturation : 381
% 1.31/0.63 % Processed clauses : 901
% 1.31/0.63 % ...of these trivial : 0
% 1.31/0.63 % ...subsumed : 129
% 1.31/0.63 % ...remaining for further processing : 772
% 1.31/0.63 % Other redundant clauses eliminated : 120
% 1.31/0.63 % Clauses deleted for lack of memory : 0
% 1.31/0.63 % Backward-subsumed : 18
% 1.31/0.63 % Backward-rewritten : 9
% 1.31/0.63 % Generated clauses : 541
% 1.31/0.63 % ...of the previous two non-redundant : 492
% 1.31/0.63 % ...aggressively subsumed : 0
% 1.31/0.63 % Contextual simplify-reflections : 59
% 1.31/0.63 % Paramodulations : 432
% 1.31/0.63 % Factorizations : 0
% 1.31/0.63 % NegExts : 0
% 1.31/0.63 % Equation resolutions : 120
% 1.31/0.63 % Disequality decompositions : 0
% 1.31/0.63 % Total rewrite steps : 686
% 1.31/0.63 % ...of those cached : 673
% 1.31/0.63 % Propositional unsat checks : 0
% 1.31/0.63 % Propositional check models : 0
% 1.31/0.63 % Propositional check unsatisfiable : 0
% 1.31/0.63 % Propositional clauses : 0
% 1.31/0.63 % Propositional clauses after purity: 0
% 1.31/0.63 % Propositional unsat core size : 0
% 1.31/0.63 % Propositional preprocessing time : 0.000
% 1.31/0.63 % Propositional encoding time : 0.000
% 1.31/0.63 % Propositional solver time : 0.000
% 1.31/0.63 % Success case prop preproc time : 0.000
% 1.31/0.63 % Success case prop encoding time : 0.000
% 1.31/0.63 % Success case prop solver time : 0.000
% 1.31/0.63 % Current number of processed clauses : 257
% 1.31/0.63 % Positive orientable unit clauses : 18
% 1.31/0.63 % Positive unorientable unit clauses: 0
% 1.31/0.63 % Negative unit clauses : 14
% 1.31/0.63 % Non-unit-clauses : 225
% 1.31/0.63 % Current number of unprocessed clauses: 328
% 1.31/0.63 % ...number of literals in the above : 2628
% 1.31/0.63 % Current number of archived formulas : 0
% 1.31/0.63 % Current number of archived clauses : 406
% 1.31/0.63 % Clause-clause subsumption calls (NU) : 156957
% 1.31/0.63 % Rec. Clause-clause subsumption calls : 5310
% 1.31/0.63 % Non-unit clause-clause subsumptions : 167
% 1.31/0.63 % Unit Clause-clause subsumption calls : 172
% 1.31/0.63 % Rewrite failures with RHS unbound : 0
% 1.31/0.63 % BW rewrite match attempts : 14
% 1.31/0.63 % BW rewrite match successes : 4
% 1.31/0.63 % Condensation attempts : 0
% 1.31/0.63 % Condensation successes : 0
% 1.31/0.63 % Termbank termtop insertions : 41562
% 1.31/0.63 % Search garbage collected termcells : 2466
% 1.31/0.63
% 1.31/0.63 % -------------------------------------------------
% 1.31/0.63 % User time : 0.149 s
% 1.31/0.63 % System time : 0.005 s
% 1.31/0.63 % Total time : 0.154 s
% 1.31/0.63 % Maximum resident set size: 4448 pages
% 1.31/0.63
% 1.31/0.63 % -------------------------------------------------
% 1.31/0.63 % User time : 0.836 s
% 1.31/0.63 % System time : 0.047 s
% 1.31/0.63 % Total time : 0.883 s
% 1.31/0.63 % Maximum resident set size: 4608 pages
% 1.31/0.63 % E exiting
%------------------------------------------------------------------------------