%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM578+3 : 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 : n001.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 01:49:38 PM UTC 2026
% Result : Theorem 1.83s 0.95s
% Output : CNFRefutation 1.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 6 unt; 0 def)
% Number of atoms : 191 ( 26 equ)
% Maximal formula atoms : 39 ( 8 avg)
% Number of connectives : 225 ( 57 ~; 47 |; 75 &)
% ( 5 <=>; 41 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 7 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn 47 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( sdtlseqdt0(szszuzczcdt0(X1),X2)
=> ( ~ ( ( ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X2))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X2)),X3) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X2)),sdtlpdtrp0(xN,X2)) )
=> ( szmzizndt0(sdtlpdtrp0(xN,X2)) = szmzizndt0(sdtlpdtrp0(xN,X1))
| ( ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X2)),X3) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X2)),sdtlpdtrp0(xN,X1)) ) ) )
& aSubsetOf0(sdtlpdtrp0(xN,X2),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X2))
=> aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
& ! [X3] :
( aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( X3 != szmzizndt0(sdtlpdtrp0(xN,X1))
& aElementOf0(X3,sdtlpdtrp0(xN,X1))
& aElement0(X3) ) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X3) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1)) ) ) )
=> ( xi != xj
=> ~ ( szmzizndt0(sdtlpdtrp0(xN,xi)) = szmzizndt0(sdtlpdtrp0(xN,xj))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xj))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xj))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__3856_02,hypothesis,
( xi != xj
=> ( sdtlseqdt0(szszuzczcdt0(xi),xj)
| sdtlseqdt0(szszuzczcdt0(xj),xi) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3856_02) ).
fof(m__3856,hypothesis,
( aElementOf0(xj,szNzAzT0)
& aElementOf0(xi,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3856) ).
fof(c_0_3,negated_conjecture,
~ ( ! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( sdtlseqdt0(szszuzczcdt0(X1),X2)
=> ( ~ ( ( ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X2))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X2)),X3) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X2)),sdtlpdtrp0(xN,X2)) )
=> ( szmzizndt0(sdtlpdtrp0(xN,X2)) = szmzizndt0(sdtlpdtrp0(xN,X1))
| ( ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X2)),X3) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X2)),sdtlpdtrp0(xN,X1)) ) ) )
& aSubsetOf0(sdtlpdtrp0(xN,X2),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X2))
=> aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
& ! [X3] :
( aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( X3 != szmzizndt0(sdtlpdtrp0(xN,X1))
& aElementOf0(X3,sdtlpdtrp0(xN,X1))
& aElement0(X3) ) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X3) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1)) ) ) )
=> ( xi != xj
=> ~ ( szmzizndt0(sdtlpdtrp0(xN,xi)) = szmzizndt0(sdtlpdtrp0(xN,xj))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xj))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xj))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_4,plain,
! [X2,X1] :
( epred1_2(X1,X2)
<=> ( ~ ( ( ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X2))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X2)),X3) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X2)),sdtlpdtrp0(xN,X2)) )
=> ( szmzizndt0(sdtlpdtrp0(xN,X2)) = szmzizndt0(sdtlpdtrp0(xN,X1))
| ( ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X2)),X3) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X2)),sdtlpdtrp0(xN,X1)) ) ) )
& aSubsetOf0(sdtlpdtrp0(xN,X2),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X2))
=> aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
& ! [X3] :
( aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( X3 != szmzizndt0(sdtlpdtrp0(xN,X1))
& aElementOf0(X3,sdtlpdtrp0(xN,X1))
& aElement0(X3) ) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X3) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1)) ) ),
introduced(definition) ).
fof(c_0_5,hypothesis,
( xi != xj
=> ( sdtlseqdt0(szszuzczcdt0(xi),xj)
| sdtlseqdt0(szszuzczcdt0(xj),xi) ) ),
inference(fof_simplification,[status(thm)],[m__3856_02]) ).
fof(c_0_6,negated_conjecture,
~ ( ! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( sdtlseqdt0(szszuzczcdt0(X1),X2)
=> epred1_2(X1,X2) ) )
=> ( xi != xj
=> ~ ( szmzizndt0(sdtlpdtrp0(xN,xi)) = szmzizndt0(sdtlpdtrp0(xN,xj))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xj))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xj))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_3]),c_0_4]) ).
fof(c_0_7,hypothesis,
( sdtlseqdt0(szszuzczcdt0(xi),xj)
| sdtlseqdt0(szszuzczcdt0(xj),xi)
| xi = xj ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
fof(c_0_8,negated_conjecture,
! [X8,X9,X10,X11] :
( szmzizndt0(sdtlpdtrp0(xN,xi)) = szmzizndt0(sdtlpdtrp0(xN,xj))
& ( sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X11)
| ~ aElementOf0(X11,sdtlpdtrp0(xN,xj)) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xj))
& ( sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X10)
| ~ aElementOf0(X10,sdtlpdtrp0(xN,xi)) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& xi != xj
& ( epred1_2(X8,X9)
| ~ sdtlseqdt0(szszuzczcdt0(X8),X9)
| ~ aElementOf0(X9,szNzAzT0)
| ~ aElementOf0(X8,szNzAzT0) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_9,hypothesis,
( sdtlseqdt0(szszuzczcdt0(xi),xj)
| sdtlseqdt0(szszuzczcdt0(xj),xi)
| xi = xj ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
xi != xj,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X2,X1] :
( epred1_2(X1,X2)
=> ( ~ ( ( ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X2))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X2)),X3) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X2)),sdtlpdtrp0(xN,X2)) )
=> ( szmzizndt0(sdtlpdtrp0(xN,X2)) = szmzizndt0(sdtlpdtrp0(xN,X1))
| ( ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X2)),X3) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X2)),sdtlpdtrp0(xN,X1)) ) ) )
& aSubsetOf0(sdtlpdtrp0(xN,X2),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X2))
=> aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
& ! [X3] :
( aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( X3 != szmzizndt0(sdtlpdtrp0(xN,X1))
& aElementOf0(X3,sdtlpdtrp0(xN,X1))
& aElement0(X3) ) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X3) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1)) ) ),
inference(split_equiv,[status(thm)],[c_0_4]) ).
cnf(c_0_12,negated_conjecture,
( ~ sdtlseqdt0(szszuzczcdt0(X1),X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| epred1_2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
( sdtlseqdt0(szszuzczcdt0(xi),xj)
| sdtlseqdt0(szszuzczcdt0(xj),xi) ),
inference(sr,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3856]) ).
cnf(c_0_15,hypothesis,
aElementOf0(xj,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3856]) ).
fof(c_0_16,plain,
! [X210,X211,X212,X213,X214,X215,X216] :
( ( ~ epred1_2(X211,X210)
| szmzizndt0(sdtlpdtrp0(xN,X210)) != szmzizndt0(sdtlpdtrp0(xN,X211)) )
& ( ~ epred1_2(X211,X210)
| ~ aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X210)),sdtlpdtrp0(xN,X211))
| ~ sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X210)),esk30_2(X210,X211)) )
& ( ~ epred1_2(X211,X210)
| ~ aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X210)),sdtlpdtrp0(xN,X211))
| aElementOf0(esk30_2(X210,X211),sdtlpdtrp0(xN,X211)) )
& ( ~ epred1_2(X211,X210)
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X210)),X216)
| ~ aElementOf0(X216,sdtlpdtrp0(xN,X210)) )
& ( ~ epred1_2(X211,X210)
| aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X210)),sdtlpdtrp0(xN,X210)) )
& ( ~ epred1_2(X211,X210)
| aSubsetOf0(sdtlpdtrp0(xN,X210),sdtmndt0(sdtlpdtrp0(xN,X211),szmzizndt0(sdtlpdtrp0(xN,X211)))) )
& ( ~ epred1_2(X211,X210)
| aElementOf0(X215,sdtmndt0(sdtlpdtrp0(xN,X211),szmzizndt0(sdtlpdtrp0(xN,X211))))
| ~ aElementOf0(X215,sdtlpdtrp0(xN,X210)) )
& ( ~ epred1_2(X211,X210)
| aElementOf0(X214,sdtmndt0(sdtlpdtrp0(xN,X211),szmzizndt0(sdtlpdtrp0(xN,X211))))
| X214 = szmzizndt0(sdtlpdtrp0(xN,X211))
| ~ aElementOf0(X214,sdtlpdtrp0(xN,X211))
| ~ aElement0(X214) )
& ( ~ epred1_2(X211,X210)
| ~ aElementOf0(X213,sdtmndt0(sdtlpdtrp0(xN,X211),szmzizndt0(sdtlpdtrp0(xN,X211))))
| X213 != szmzizndt0(sdtlpdtrp0(xN,X211)) )
& ( ~ epred1_2(X211,X210)
| ~ aElementOf0(X213,sdtmndt0(sdtlpdtrp0(xN,X211),szmzizndt0(sdtlpdtrp0(xN,X211))))
| aElementOf0(X213,sdtlpdtrp0(xN,X211)) )
& ( ~ epred1_2(X211,X210)
| ~ aElementOf0(X213,sdtmndt0(sdtlpdtrp0(xN,X211),szmzizndt0(sdtlpdtrp0(xN,X211))))
| aElement0(X213) )
& ( ~ epred1_2(X211,X210)
| aSet0(sdtmndt0(sdtlpdtrp0(xN,X211),szmzizndt0(sdtlpdtrp0(xN,X211)))) )
& ( ~ epred1_2(X211,X210)
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X211)),X212)
| ~ aElementOf0(X212,sdtlpdtrp0(xN,X211)) )
& ( ~ epred1_2(X211,X210)
| aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X211)),sdtlpdtrp0(xN,X211)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])])])]) ).
cnf(c_0_17,hypothesis,
( sdtlseqdt0(szszuzczcdt0(xi),xj)
| epred1_2(xj,xi) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]) ).
cnf(c_0_18,plain,
( ~ epred1_2(X2,X1)
| szmzizndt0(sdtlpdtrp0(xN,X1)) != szmzizndt0(sdtlpdtrp0(xN,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( epred1_2(xi,xj)
| epred1_2(xj,xi) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_17]),c_0_15]),c_0_14])]) ).
cnf(c_0_20,negated_conjecture,
szmzizndt0(sdtlpdtrp0(xN,xi)) = szmzizndt0(sdtlpdtrp0(xN,xj)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,plain,
epred1_2(xi,xj),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_22,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_21]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM578+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n001.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 02:47:14 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.44 Running first-order theorem proving
% 0.14/0.44 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.83/0.95 % Version: 3.5.1
% 1.83/0.95 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.83/0.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.83/0.95 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.83/0.95 % Starting new_bool_3 with 300s (1) cores
% 1.83/0.95 % Starting new_bool_1 with 300s (1) cores
% 1.83/0.95 % Starting sh5l with 300s (1) cores
% 1.83/0.95 % sh5l with pid 2023311 completed with status 0
% 1.83/0.95 % Result found by sh5l
% 1.83/0.95 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.83/0.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.83/0.95 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.83/0.95 % Starting new_bool_3 with 300s (1) cores
% 1.83/0.95 % Starting new_bool_1 with 300s (1) cores
% 1.83/0.95 % Starting sh5l with 300s (1) cores
% 1.83/0.95 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 1.83/0.95 % SinE strategy is gf500_gu_R04_F100_L20000
% 1.83/0.95 % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.83/0.95 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.83/0.95 % Starting SubtermCWHack with 28s (1) cores
% 1.83/0.95 % SubtermCWHack with pid 2023312 completed with status 0
% 1.83/0.95 % Result found by SubtermCWHack
% 1.83/0.95 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.83/0.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.83/0.95 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.83/0.95 % Starting new_bool_3 with 300s (1) cores
% 1.83/0.95 % Starting new_bool_1 with 300s (1) cores
% 1.83/0.95 % Starting sh5l with 300s (1) cores
% 1.83/0.95 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 1.83/0.95 % SinE strategy is gf500_gu_R04_F100_L20000
% 1.83/0.95 % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.83/0.95 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.83/0.95 % Starting SubtermCWHack with 28s (1) cores
% 1.83/0.95 % Preprocessing time : 0.083 s
% 1.83/0.95
% 1.83/0.95 % Proof found!
% 1.83/0.95 % SZS status Theorem
% 1.83/0.95 % SZS output start CNFRefutation
% See solution above
% 1.83/0.95 % Parsed axioms : 86
% 1.83/0.95 % Removed by relevancy pruning/SinE : 3
% 1.83/0.95 % Initial clauses : 4194
% 1.83/0.95 % Removed in clause preprocessing : 7
% 1.83/0.95 % Initial clauses in saturation : 4187
% 1.83/0.95 % Processed clauses : 236
% 1.83/0.95 % ...of these trivial : 1
% 1.83/0.95 % ...subsumed : 34
% 1.83/0.95 % ...remaining for further processing : 201
% 1.83/0.95 % Other redundant clauses eliminated : 19
% 1.83/0.95 % Clauses deleted for lack of memory : 0
% 1.83/0.95 % Backward-subsumed : 7
% 1.83/0.95 % Backward-rewritten : 3
% 1.83/0.95 % Generated clauses : 269
% 1.83/0.95 % ...of the previous two non-redundant : 213
% 1.83/0.95 % ...aggressively subsumed : 0
% 1.83/0.95 % Contextual simplify-reflections : 5
% 1.83/0.95 % Paramodulations : 249
% 1.83/0.95 % Factorizations : 0
% 1.83/0.95 % NegExts : 0
% 1.83/0.95 % Equation resolutions : 20
% 1.83/0.95 % Disequality decompositions : 0
% 1.83/0.95 % Total rewrite steps : 188
% 1.83/0.95 % ...of those cached : 156
% 1.83/0.95 % Propositional unsat checks : 0
% 1.83/0.95 % Propositional check models : 0
% 1.83/0.95 % Propositional check unsatisfiable : 0
% 1.83/0.95 % Propositional clauses : 0
% 1.83/0.95 % Propositional clauses after purity: 0
% 1.83/0.95 % Propositional unsat core size : 0
% 1.83/0.95 % Propositional preprocessing time : 0.000
% 1.83/0.95 % Propositional encoding time : 0.000
% 1.83/0.95 % Propositional solver time : 0.000
% 1.83/0.96 % Success case prop preproc time : 0.000
% 1.83/0.96 % Success case prop encoding time : 0.000
% 1.83/0.96 % Success case prop solver time : 0.000
% 1.83/0.96 % Current number of processed clauses : 175
% 1.83/0.96 % Positive orientable unit clauses : 44
% 1.83/0.96 % Positive unorientable unit clauses: 0
% 1.83/0.96 % Negative unit clauses : 10
% 1.83/0.96 % Non-unit-clauses : 121
% 1.83/0.96 % Current number of unprocessed clauses: 4156
% 1.83/0.96 % ...number of literals in the above : 51234
% 1.83/0.96 % Current number of archived formulas : 0
% 1.83/0.96 % Current number of archived clauses : 12
% 1.83/0.96 % Clause-clause subsumption calls (NU) : 1308
% 1.83/0.96 % Rec. Clause-clause subsumption calls : 922
% 1.83/0.96 % Non-unit clause-clause subsumptions : 28
% 1.83/0.96 % Unit Clause-clause subsumption calls : 257
% 1.83/0.96 % Rewrite failures with RHS unbound : 0
% 1.83/0.96 % BW rewrite match attempts : 4
% 1.83/0.96 % BW rewrite match successes : 4
% 1.83/0.96 % Condensation attempts : 0
% 1.83/0.96 % Condensation successes : 0
% 1.83/0.96 % Termbank termtop insertions : 337882
% 1.83/0.96 % Search garbage collected termcells : 26912
% 1.83/0.96
% 1.83/0.96 % -------------------------------------------------
% 1.83/0.96 % User time : 0.402 s
% 1.83/0.96 % System time : 0.027 s
% 1.83/0.96 % Total time : 0.429 s
% 1.83/0.96 % Maximum resident set size: 15036 pages
% 1.83/0.96
% 1.83/0.96 % -------------------------------------------------
% 1.83/0.96 % User time : 0.409 s
% 1.83/0.96 % System time : 0.035 s
% 1.83/0.96 % Total time : 0.443 s
% 1.83/0.96 % Maximum resident set size: 4608 pages
% 1.83/0.96 % E exiting
%------------------------------------------------------------------------------