%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM578+3 : 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 : n020.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:55:34 PM UTC 2026
% Result : Theorem 1.15s 0.78s
% Output : CNFRefutation 1.15s
% 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/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__3856_02,hypothesis,
( xi != xj
=> ( sdtlseqdt0(szszuzczcdt0(xi),xj)
| sdtlseqdt0(szszuzczcdt0(xj),xi) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3856_02) ).
fof(m__3856,hypothesis,
( aElementOf0(xj,szNzAzT0)
& aElementOf0(xi,szNzAzT0) ),
file('/export/starexec/sandbox/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,
! [X47,X48,X49,X50] :
( szmzizndt0(sdtlpdtrp0(xN,xi)) = szmzizndt0(sdtlpdtrp0(xN,xj))
& ( sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X50)
| ~ aElementOf0(X50,sdtlpdtrp0(xN,xj)) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xj))
& ( sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X49)
| ~ aElementOf0(X49,sdtlpdtrp0(xN,xi)) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& xi != xj
& ( epred1_2(X47,X48)
| ~ sdtlseqdt0(szszuzczcdt0(X47),X48)
| ~ aElementOf0(X48,szNzAzT0)
| ~ aElementOf0(X47,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,
! [X200,X201,X202,X203,X204,X205,X206] :
( ( ~ epred1_2(X201,X200)
| szmzizndt0(sdtlpdtrp0(xN,X200)) != szmzizndt0(sdtlpdtrp0(xN,X201)) )
& ( ~ epred1_2(X201,X200)
| ~ aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X200)),sdtlpdtrp0(xN,X201))
| ~ sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X200)),esk29_2(X200,X201)) )
& ( ~ epred1_2(X201,X200)
| ~ aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X200)),sdtlpdtrp0(xN,X201))
| aElementOf0(esk29_2(X200,X201),sdtlpdtrp0(xN,X201)) )
& ( ~ epred1_2(X201,X200)
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X200)),X206)
| ~ aElementOf0(X206,sdtlpdtrp0(xN,X200)) )
& ( ~ epred1_2(X201,X200)
| aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X200)),sdtlpdtrp0(xN,X200)) )
& ( ~ epred1_2(X201,X200)
| aSubsetOf0(sdtlpdtrp0(xN,X200),sdtmndt0(sdtlpdtrp0(xN,X201),szmzizndt0(sdtlpdtrp0(xN,X201)))) )
& ( ~ epred1_2(X201,X200)
| aElementOf0(X205,sdtmndt0(sdtlpdtrp0(xN,X201),szmzizndt0(sdtlpdtrp0(xN,X201))))
| ~ aElementOf0(X205,sdtlpdtrp0(xN,X200)) )
& ( ~ epred1_2(X201,X200)
| aElementOf0(X204,sdtmndt0(sdtlpdtrp0(xN,X201),szmzizndt0(sdtlpdtrp0(xN,X201))))
| X204 = szmzizndt0(sdtlpdtrp0(xN,X201))
| ~ aElementOf0(X204,sdtlpdtrp0(xN,X201))
| ~ aElement0(X204) )
& ( ~ epred1_2(X201,X200)
| ~ aElementOf0(X203,sdtmndt0(sdtlpdtrp0(xN,X201),szmzizndt0(sdtlpdtrp0(xN,X201))))
| X203 != szmzizndt0(sdtlpdtrp0(xN,X201)) )
& ( ~ epred1_2(X201,X200)
| ~ aElementOf0(X203,sdtmndt0(sdtlpdtrp0(xN,X201),szmzizndt0(sdtlpdtrp0(xN,X201))))
| aElementOf0(X203,sdtlpdtrp0(xN,X201)) )
& ( ~ epred1_2(X201,X200)
| ~ aElementOf0(X203,sdtmndt0(sdtlpdtrp0(xN,X201),szmzizndt0(sdtlpdtrp0(xN,X201))))
| aElement0(X203) )
& ( ~ epred1_2(X201,X200)
| aSet0(sdtmndt0(sdtlpdtrp0(xN,X201),szmzizndt0(sdtlpdtrp0(xN,X201)))) )
& ( ~ epred1_2(X201,X200)
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X201)),X202)
| ~ aElementOf0(X202,sdtlpdtrp0(xN,X201)) )
& ( ~ epred1_2(X201,X200)
| aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X201)),sdtlpdtrp0(xN,X201)) ) ),
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/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.36 % Computer : n020.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8046.5625MB
% 0.13/0.36 % OS : Linux 6.8.0-71-generic
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Mon Sep 21 02:42:34 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 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
% 1.15/0.78 % Version: 3.5.1
% 1.15/0.78 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.15/0.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.15/0.78 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.15/0.78 % Starting new_bool_3 with 300s (1) cores
% 1.15/0.78 % Starting new_bool_1 with 300s (1) cores
% 1.15/0.78 % Starting sh5l with 300s (1) cores
% 1.15/0.78 % new_bool_3 with pid 1821826 completed with status 0
% 1.15/0.78 % Result found by new_bool_3
% 1.15/0.78 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.15/0.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.15/0.78 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.15/0.78 % Starting new_bool_3 with 300s (1) cores
% 1.15/0.78 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.15/0.78 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.15/0.78 % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.15/0.78 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.15/0.78 % Starting SubtermCWHack with 31s (1) cores
% 1.15/0.78 % SubtermCWHack with pid 1821848 completed with status 0
% 1.15/0.78 % Result found by SubtermCWHack
% 1.15/0.78 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.15/0.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.15/0.78 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.15/0.78 % Starting new_bool_3 with 300s (1) cores
% 1.15/0.78 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.15/0.78 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.15/0.78 % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.15/0.78 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.15/0.78 % Starting SubtermCWHack with 31s (1) cores
% 1.15/0.78 % Preprocessing time : 0.081 s
% 1.15/0.78
% 1.15/0.78 % Proof found!
% 1.15/0.78 % SZS status Theorem
% 1.15/0.78 % SZS output start CNFRefutation
% See solution above
% 1.15/0.78 % Parsed axioms : 86
% 1.15/0.78 % Removed by relevancy pruning/SinE : 5
% 1.15/0.78 % Initial clauses : 4186
% 1.15/0.78 % Removed in clause preprocessing : 7
% 1.15/0.78 % Initial clauses in saturation : 4179
% 1.15/0.78 % Processed clauses : 258
% 1.15/0.78 % ...of these trivial : 1
% 1.15/0.78 % ...subsumed : 35
% 1.15/0.78 % ...remaining for further processing : 222
% 1.15/0.78 % Other redundant clauses eliminated : 21
% 1.15/0.78 % Clauses deleted for lack of memory : 0
% 1.15/0.78 % Backward-subsumed : 7
% 1.15/0.78 % Backward-rewritten : 4
% 1.15/0.78 % Generated clauses : 308
% 1.15/0.78 % ...of the previous two non-redundant : 245
% 1.15/0.78 % ...aggressively subsumed : 0
% 1.15/0.78 % Contextual simplify-reflections : 5
% 1.15/0.78 % Paramodulations : 286
% 1.15/0.78 % Factorizations : 0
% 1.15/0.78 % NegExts : 0
% 1.15/0.78 % Equation resolutions : 22
% 1.15/0.78 % Disequality decompositions : 0
% 1.15/0.78 % Total rewrite steps : 214
% 1.15/0.78 % ...of those cached : 178
% 1.15/0.78 % Propositional unsat checks : 0
% 1.15/0.78 % Propositional check models : 0
% 1.15/0.78 % Propositional check unsatisfiable : 0
% 1.15/0.78 % Propositional clauses : 0
% 1.15/0.78 % Propositional clauses after purity: 0
% 1.15/0.78 % Propositional unsat core size : 0
% 1.15/0.78 % Propositional preprocessing time : 0.000
% 1.15/0.78 % Propositional encoding time : 0.000
% 1.15/0.78 % Propositional solver time : 0.000
% 1.15/0.78 % Success case prop preproc time : 0.000
% 1.15/0.78 % Success case prop encoding time : 0.000
% 1.15/0.78 % Success case prop solver time : 0.000
% 1.15/0.78 % Current number of processed clauses : 194
% 1.15/0.78 % Positive orientable unit clauses : 51
% 1.15/0.78 % Positive unorientable unit clauses: 0
% 1.15/0.78 % Negative unit clauses : 13
% 1.15/0.78 % Non-unit-clauses : 130
% 1.15/0.78 % Current number of unprocessed clauses: 4158
% 1.15/0.78 % ...number of literals in the above : 51234
% 1.15/0.78 % Current number of archived formulas : 0
% 1.15/0.78 % Current number of archived clauses : 13
% 1.15/0.78 % Clause-clause subsumption calls (NU) : 1546
% 1.15/0.78 % Rec. Clause-clause subsumption calls : 1077
% 1.15/0.78 % Non-unit clause-clause subsumptions : 29
% 1.15/0.78 % Unit Clause-clause subsumption calls : 395
% 1.15/0.78 % Rewrite failures with RHS unbound : 0
% 1.15/0.78 % BW rewrite match attempts : 5
% 1.15/0.78 % BW rewrite match successes : 5
% 1.15/0.78 % Condensation attempts : 0
% 1.15/0.78 % Condensation successes : 0
% 1.15/0.78 % Termbank termtop insertions : 337539
% 1.15/0.78 % Search garbage collected termcells : 26666
% 1.15/0.78
% 1.15/0.78 % -------------------------------------------------
% 1.15/0.78 % User time : 0.222 s
% 1.15/0.78 % System time : 0.016 s
% 1.15/0.78 % Total time : 0.238 s
% 1.15/0.78 % Maximum resident set size: 14984 pages
% 1.15/0.78
% 1.15/0.78 % -------------------------------------------------
% 1.15/0.78 % User time : 0.225 s
% 1.15/0.78 % System time : 0.019 s
% 1.15/0.78 % Total time : 0.244 s
% 1.15/0.78 % Maximum resident set size: 4864 pages
% 1.15/0.78 % E exiting
%------------------------------------------------------------------------------