%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM633+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 : n007.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:51 PM UTC 2026
% Result : Theorem 1.99s 1.10s
% Output : CNFRefutation 1.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 4 unt; 0 def)
% Number of atoms : 331 ( 60 equ)
% Maximal formula atoms : 229 ( 20 avg)
% Number of connectives : 496 ( 181 ~; 192 |; 103 &)
% ( 1 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 69 ( 9 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 8 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 27 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ! [X1] :
( ( aElementOf0(X1,slbdtsldtrb0(xO,xK))
| ( sbrdtbr0(X1) = xK
& ( aSubsetOf0(X1,xO)
| ( ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xO) )
& aSet0(X1) ) ) ) )
=> ( sdtlpdtrp0(xc,X1) = szDzizrdt0(xd)
& aElementOf0(X1,szDzozmdt0(xc))
& aSubsetOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSubsetOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSubsetOf0(X1,szNzAzT0)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,szNzAzT0) )
& ~ ( X1 = slcrc0
| ~ ? [X2] : aElementOf0(X2,X1) ) ) )
=> ? [X1] :
( ? [X2] :
( ! [X3] :
( ( aElementOf0(X3,slbdtsldtrb0(X2,xK))
& sbrdtbr0(X3) = xK
& aSubsetOf0(X3,X2)
& ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,X2) )
& aSet0(X3) )
=> sdtlpdtrp0(xc,X3) = X1 )
& isCountable0(X2)
& ( aSubsetOf0(X2,xS)
| ( ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,xS) )
& aSet0(X2) ) ) )
& aElementOf0(X1,xT) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__4998,hypothesis,
( aSubsetOf0(xO,xS)
& ! [X1] :
( aElementOf0(X1,xO)
=> aElementOf0(X1,xS) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4998) ).
fof(m__4908,hypothesis,
( isCountable0(xO)
& aSet0(xO) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4908) ).
fof(m__4854,hypothesis,
( ! [X1] :
( aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
<=> ( sdtlpdtrp0(xd,X1) = szDzizrdt0(xd)
& aElementOf0(X1,szDzozmdt0(xd)) ) )
& aSet0(sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aElementOf0(szDzizrdt0(xd),xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4854) ).
fof(c_0_4,negated_conjecture,
~ ( ! [X1] :
( ( aElementOf0(X1,slbdtsldtrb0(xO,xK))
| ( sbrdtbr0(X1) = xK
& ( aSubsetOf0(X1,xO)
| ( ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xO) )
& aSet0(X1) ) ) ) )
=> ( sdtlpdtrp0(xc,X1) = szDzizrdt0(xd)
& aElementOf0(X1,szDzozmdt0(xc))
& aSubsetOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSubsetOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSubsetOf0(X1,szNzAzT0)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,szNzAzT0) )
& ~ ( X1 = slcrc0
| ~ ? [X2] : aElementOf0(X2,X1) ) ) )
=> ? [X1] :
( ? [X2] :
( ! [X3] :
( ( aElementOf0(X3,slbdtsldtrb0(X2,xK))
& sbrdtbr0(X3) = xK
& aSubsetOf0(X3,X2)
& ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,X2) )
& aSet0(X3) )
=> sdtlpdtrp0(xc,X3) = X1 )
& isCountable0(X2)
& ( aSubsetOf0(X2,xS)
| ( ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,xS) )
& aSet0(X2) ) ) )
& aElementOf0(X1,xT) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,negated_conjecture,
! [X85,X88,X89,X90,X91,X92,X95] :
( ( ~ aElementOf0(X91,xT)
| ~ isCountable0(X92)
| ~ aSubsetOf0(X92,xS)
| sdtlpdtrp0(xc,esk24_2(X91,X92)) != X91 )
& ( ~ aElementOf0(X91,xT)
| ~ isCountable0(X92)
| ~ aSubsetOf0(X92,xS)
| aElementOf0(esk24_2(X91,X92),slbdtsldtrb0(X92,xK)) )
& ( ~ aElementOf0(X91,xT)
| ~ isCountable0(X92)
| ~ aSubsetOf0(X92,xS)
| sbrdtbr0(esk24_2(X91,X92)) = xK )
& ( ~ aElementOf0(X91,xT)
| ~ isCountable0(X92)
| ~ aSubsetOf0(X92,xS)
| aSubsetOf0(esk24_2(X91,X92),X92) )
& ( ~ aElementOf0(X91,xT)
| ~ isCountable0(X92)
| ~ aSubsetOf0(X92,xS)
| aElementOf0(X95,X92)
| ~ aElementOf0(X95,esk24_2(X91,X92)) )
& ( ~ aElementOf0(X91,xT)
| ~ isCountable0(X92)
| ~ aSubsetOf0(X92,xS)
| aSet0(esk24_2(X91,X92)) )
& ( ~ aElementOf0(X91,xT)
| ~ isCountable0(X92)
| ~ aSet0(X92)
| ~ aElementOf0(esk23_2(X91,X92),xS)
| sdtlpdtrp0(xc,esk24_2(X91,X92)) != X91 )
& ( ~ aElementOf0(X91,xT)
| ~ isCountable0(X92)
| ~ aSet0(X92)
| ~ aElementOf0(esk23_2(X91,X92),xS)
| aElementOf0(esk24_2(X91,X92),slbdtsldtrb0(X92,xK)) )
& ( ~ aElementOf0(X91,xT)
| ~ isCountable0(X92)
| ~ aSet0(X92)
| ~ aElementOf0(esk23_2(X91,X92),xS)
| sbrdtbr0(esk24_2(X91,X92)) = xK )
& ( ~ aElementOf0(X91,xT)
| ~ isCountable0(X92)
| ~ aSet0(X92)
| ~ aElementOf0(esk23_2(X91,X92),xS)
| aSubsetOf0(esk24_2(X91,X92),X92) )
& ( ~ aElementOf0(X91,xT)
| ~ isCountable0(X92)
| ~ aSet0(X92)
| ~ aElementOf0(esk23_2(X91,X92),xS)
| aElementOf0(X95,X92)
| ~ aElementOf0(X95,esk24_2(X91,X92)) )
& ( ~ aElementOf0(X91,xT)
| ~ isCountable0(X92)
| ~ aSet0(X92)
| ~ aElementOf0(esk23_2(X91,X92),xS)
| aSet0(esk24_2(X91,X92)) )
& ( ~ aElementOf0(X91,xT)
| ~ isCountable0(X92)
| ~ aSet0(X92)
| aElementOf0(esk23_2(X91,X92),X92)
| sdtlpdtrp0(xc,esk24_2(X91,X92)) != X91 )
& ( ~ aElementOf0(X91,xT)
| ~ isCountable0(X92)
| ~ aSet0(X92)
| aElementOf0(esk23_2(X91,X92),X92)
| aElementOf0(esk24_2(X91,X92),slbdtsldtrb0(X92,xK)) )
& ( ~ aElementOf0(X91,xT)
| ~ isCountable0(X92)
| ~ aSet0(X92)
| aElementOf0(esk23_2(X91,X92),X92)
| sbrdtbr0(esk24_2(X91,X92)) = xK )
& ( ~ aElementOf0(X91,xT)
| ~ isCountable0(X92)
| ~ aSet0(X92)
| aElementOf0(esk23_2(X91,X92),X92)
| aSubsetOf0(esk24_2(X91,X92),X92) )
& ( ~ aElementOf0(X91,xT)
| ~ isCountable0(X92)
| ~ aSet0(X92)
| aElementOf0(esk23_2(X91,X92),X92)
| aElementOf0(X95,X92)
| ~ aElementOf0(X95,esk24_2(X91,X92)) )
& ( ~ aElementOf0(X91,xT)
| ~ isCountable0(X92)
| ~ aSet0(X92)
| aElementOf0(esk23_2(X91,X92),X92)
| aSet0(esk24_2(X91,X92)) )
& ( ~ aElementOf0(X85,slbdtsldtrb0(xO,xK))
| sdtlpdtrp0(xc,X85) = szDzizrdt0(xd) )
& ( ~ aElementOf0(X85,slbdtsldtrb0(xO,xK))
| aElementOf0(X85,szDzozmdt0(xc)) )
& ( ~ aElementOf0(X85,slbdtsldtrb0(xO,xK))
| aSubsetOf0(X85,xS) )
& ( ~ aElementOf0(X85,slbdtsldtrb0(xO,xK))
| aElementOf0(X90,xS)
| ~ aElementOf0(X90,X85) )
& ( ~ aElementOf0(X85,slbdtsldtrb0(xO,xK))
| aSubsetOf0(X85,xS) )
& ( ~ aElementOf0(X85,slbdtsldtrb0(xO,xK))
| aElementOf0(X89,xS)
| ~ aElementOf0(X89,X85) )
& ( ~ aElementOf0(X85,slbdtsldtrb0(xO,xK))
| aSubsetOf0(X85,szNzAzT0) )
& ( ~ aElementOf0(X85,slbdtsldtrb0(xO,xK))
| aElementOf0(X88,szNzAzT0)
| ~ aElementOf0(X88,X85) )
& ( ~ aElementOf0(X85,slbdtsldtrb0(xO,xK))
| X85 != slcrc0 )
& ( ~ aElementOf0(X85,slbdtsldtrb0(xO,xK))
| aElementOf0(esk22_1(X85),X85) )
& ( sbrdtbr0(X85) != xK
| ~ aSubsetOf0(X85,xO)
| sdtlpdtrp0(xc,X85) = szDzizrdt0(xd) )
& ( sbrdtbr0(X85) != xK
| ~ aSubsetOf0(X85,xO)
| aElementOf0(X85,szDzozmdt0(xc)) )
& ( sbrdtbr0(X85) != xK
| ~ aSubsetOf0(X85,xO)
| aSubsetOf0(X85,xS) )
& ( sbrdtbr0(X85) != xK
| ~ aSubsetOf0(X85,xO)
| aElementOf0(X90,xS)
| ~ aElementOf0(X90,X85) )
& ( sbrdtbr0(X85) != xK
| ~ aSubsetOf0(X85,xO)
| aSubsetOf0(X85,xS) )
& ( sbrdtbr0(X85) != xK
| ~ aSubsetOf0(X85,xO)
| aElementOf0(X89,xS)
| ~ aElementOf0(X89,X85) )
& ( sbrdtbr0(X85) != xK
| ~ aSubsetOf0(X85,xO)
| aSubsetOf0(X85,szNzAzT0) )
& ( sbrdtbr0(X85) != xK
| ~ aSubsetOf0(X85,xO)
| aElementOf0(X88,szNzAzT0)
| ~ aElementOf0(X88,X85) )
& ( sbrdtbr0(X85) != xK
| ~ aSubsetOf0(X85,xO)
| X85 != slcrc0 )
& ( sbrdtbr0(X85) != xK
| ~ aSubsetOf0(X85,xO)
| aElementOf0(esk22_1(X85),X85) )
& ( sbrdtbr0(X85) != xK
| ~ aSet0(X85)
| ~ aElementOf0(esk21_1(X85),xO)
| sdtlpdtrp0(xc,X85) = szDzizrdt0(xd) )
& ( sbrdtbr0(X85) != xK
| ~ aSet0(X85)
| ~ aElementOf0(esk21_1(X85),xO)
| aElementOf0(X85,szDzozmdt0(xc)) )
& ( sbrdtbr0(X85) != xK
| ~ aSet0(X85)
| ~ aElementOf0(esk21_1(X85),xO)
| aSubsetOf0(X85,xS) )
& ( sbrdtbr0(X85) != xK
| ~ aSet0(X85)
| ~ aElementOf0(esk21_1(X85),xO)
| aElementOf0(X90,xS)
| ~ aElementOf0(X90,X85) )
& ( sbrdtbr0(X85) != xK
| ~ aSet0(X85)
| ~ aElementOf0(esk21_1(X85),xO)
| aSubsetOf0(X85,xS) )
& ( sbrdtbr0(X85) != xK
| ~ aSet0(X85)
| ~ aElementOf0(esk21_1(X85),xO)
| aElementOf0(X89,xS)
| ~ aElementOf0(X89,X85) )
& ( sbrdtbr0(X85) != xK
| ~ aSet0(X85)
| ~ aElementOf0(esk21_1(X85),xO)
| aSubsetOf0(X85,szNzAzT0) )
& ( sbrdtbr0(X85) != xK
| ~ aSet0(X85)
| ~ aElementOf0(esk21_1(X85),xO)
| aElementOf0(X88,szNzAzT0)
| ~ aElementOf0(X88,X85) )
& ( sbrdtbr0(X85) != xK
| ~ aSet0(X85)
| ~ aElementOf0(esk21_1(X85),xO)
| X85 != slcrc0 )
& ( sbrdtbr0(X85) != xK
| ~ aSet0(X85)
| ~ aElementOf0(esk21_1(X85),xO)
| aElementOf0(esk22_1(X85),X85) )
& ( sbrdtbr0(X85) != xK
| ~ aSet0(X85)
| aElementOf0(esk21_1(X85),X85)
| sdtlpdtrp0(xc,X85) = szDzizrdt0(xd) )
& ( sbrdtbr0(X85) != xK
| ~ aSet0(X85)
| aElementOf0(esk21_1(X85),X85)
| aElementOf0(X85,szDzozmdt0(xc)) )
& ( sbrdtbr0(X85) != xK
| ~ aSet0(X85)
| aElementOf0(esk21_1(X85),X85)
| aSubsetOf0(X85,xS) )
& ( sbrdtbr0(X85) != xK
| ~ aSet0(X85)
| aElementOf0(esk21_1(X85),X85)
| aElementOf0(X90,xS)
| ~ aElementOf0(X90,X85) )
& ( sbrdtbr0(X85) != xK
| ~ aSet0(X85)
| aElementOf0(esk21_1(X85),X85)
| aSubsetOf0(X85,xS) )
& ( sbrdtbr0(X85) != xK
| ~ aSet0(X85)
| aElementOf0(esk21_1(X85),X85)
| aElementOf0(X89,xS)
| ~ aElementOf0(X89,X85) )
& ( sbrdtbr0(X85) != xK
| ~ aSet0(X85)
| aElementOf0(esk21_1(X85),X85)
| aSubsetOf0(X85,szNzAzT0) )
& ( sbrdtbr0(X85) != xK
| ~ aSet0(X85)
| aElementOf0(esk21_1(X85),X85)
| aElementOf0(X88,szNzAzT0)
| ~ aElementOf0(X88,X85) )
& ( sbrdtbr0(X85) != xK
| ~ aSet0(X85)
| aElementOf0(esk21_1(X85),X85)
| X85 != slcrc0 )
& ( sbrdtbr0(X85) != xK
| ~ aSet0(X85)
| aElementOf0(esk21_1(X85),X85)
| aElementOf0(esk22_1(X85),X85) ) ),
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)],[c_0_4])])])])])]) ).
fof(c_0_6,hypothesis,
! [X84] :
( aSubsetOf0(xO,xS)
& ( aElementOf0(X84,xS)
| ~ aElementOf0(X84,xO) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4998])])])]) ).
cnf(c_0_7,negated_conjecture,
( ~ aElementOf0(X1,slbdtsldtrb0(xO,xK))
| sdtlpdtrp0(xc,X1) = szDzizrdt0(xd) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( ~ aElementOf0(X1,xT)
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,xS)
| aElementOf0(esk24_2(X1,X2),slbdtsldtrb0(X2,xK)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,hypothesis,
aSubsetOf0(xO,xS),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
isCountable0(xO),
inference(split_conjunct,[status(thm)],[m__4908]) ).
fof(c_0_11,hypothesis,
! [X75] :
( ( aElementOf0(X75,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| sdtlpdtrp0(xd,X75) != szDzizrdt0(xd)
| ~ aElementOf0(X75,szDzozmdt0(xd)) )
& ( ~ aElementOf0(X75,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| sdtlpdtrp0(xd,X75) = szDzizrdt0(xd) )
& ( ~ aElementOf0(X75,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| aElementOf0(X75,szDzozmdt0(xd)) )
& aSet0(sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aElementOf0(szDzizrdt0(xd),xT) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4854])])])])]) ).
cnf(c_0_12,negated_conjecture,
( ~ aElementOf0(X1,xT)
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,xS)
| sdtlpdtrp0(xc,esk24_2(X1,X2)) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
( ~ aElementOf0(X1,xT)
| sdtlpdtrp0(xc,esk24_2(X1,xO)) = szDzizrdt0(xd) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10])]) ).
cnf(c_0_14,hypothesis,
aElementOf0(szDzizrdt0(xd),xT),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_9]),c_0_10])])]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM633+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.47 % Computer : n007.cluster.edu
% 0.17/0.47 % Model : x86_64 x86_64
% 0.17/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.47 % Memory : 8046.5625MB
% 0.17/0.47 % OS : Linux 6.8.0-71-generic
% 0.17/0.47 % CPULimit : 300
% 0.17/0.47 % WCLimit : 300
% 0.17/0.47 % DateTime : Mon Sep 21 02:44:05 UTC 2026
% 0.17/0.48 % CPUTime :
% 0.17/0.48 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/0.56 Running first-order theorem proving
% 0.22/0.56 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.99/1.10 % Version: 3.5.1
% 1.99/1.10 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.99/1.10 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.99/1.10 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.99/1.10 % Starting new_bool_3 with 300s (1) cores
% 1.99/1.10 % Starting new_bool_1 with 300s (1) cores
% 1.99/1.10 % Starting sh5l with 300s (1) cores
% 1.99/1.10 % new_bool_1 with pid 2128 completed with status 0
% 1.99/1.10 % Result found by new_bool_1
% 1.99/1.10 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.99/1.10 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.99/1.10 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.99/1.10 % Starting new_bool_3 with 300s (1) cores
% 1.99/1.10 % Starting new_bool_1 with 300s (1) cores
% 1.99/1.10 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.99/1.10 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.99/1.10 % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.99/1.10 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.99/1.10 % Starting SubtermCWHack with 28s (1) cores
% 1.99/1.10 % SubtermCWHack with pid 2130 completed with status 0
% 1.99/1.10 % Result found by SubtermCWHack
% 1.99/1.10 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.99/1.10 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.99/1.10 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.99/1.10 % Starting new_bool_3 with 300s (1) cores
% 1.99/1.10 % Starting new_bool_1 with 300s (1) cores
% 1.99/1.10 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.99/1.10 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.99/1.10 % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.99/1.10 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.99/1.10 % Starting SubtermCWHack with 28s (1) cores
% 1.99/1.10 % Preprocessing time : 0.109 s
% 1.99/1.10
% 1.99/1.10 % Proof found!
% 1.99/1.10 % SZS status Theorem
% 1.99/1.10 % SZS output start CNFRefutation
% See solution above
% 1.99/1.10 % Parsed axioms : 99
% 1.99/1.10 % Removed by relevancy pruning/SinE : 9
% 1.99/1.10 % Initial clauses : 4908
% 1.99/1.10 % Removed in clause preprocessing : 7
% 1.99/1.10 % Initial clauses in saturation : 4901
% 1.99/1.10 % Processed clauses : 1013
% 1.99/1.10 % ...of these trivial : 11
% 1.99/1.10 % ...subsumed : 354
% 1.99/1.10 % ...remaining for further processing : 648
% 1.99/1.10 % Other redundant clauses eliminated : 46
% 1.99/1.10 % Clauses deleted for lack of memory : 0
% 1.99/1.10 % Backward-subsumed : 10
% 1.99/1.10 % Backward-rewritten : 20
% 1.99/1.10 % Generated clauses : 2781
% 1.99/1.10 % ...of the previous two non-redundant : 2513
% 1.99/1.10 % ...aggressively subsumed : 0
% 1.99/1.10 % Contextual simplify-reflections : 20
% 1.99/1.10 % Paramodulations : 2735
% 1.99/1.10 % Factorizations : 0
% 1.99/1.10 % NegExts : 0
% 1.99/1.10 % Equation resolutions : 47
% 1.99/1.10 % Disequality decompositions : 0
% 1.99/1.10 % Total rewrite steps : 1368
% 1.99/1.10 % ...of those cached : 1294
% 1.99/1.10 % Propositional unsat checks : 0
% 1.99/1.10 % Propositional check models : 0
% 1.99/1.10 % Propositional check unsatisfiable : 0
% 1.99/1.10 % Propositional clauses : 0
% 1.99/1.10 % Propositional clauses after purity: 0
% 1.99/1.10 % Propositional unsat core size : 0
% 1.99/1.10 % Propositional preprocessing time : 0.000
% 1.99/1.10 % Propositional encoding time : 0.000
% 1.99/1.10 % Propositional solver time : 0.000
% 1.99/1.10 % Success case prop preproc time : 0.000
% 1.99/1.10 % Success case prop encoding time : 0.000
% 1.99/1.10 % Success case prop solver time : 0.000
% 1.99/1.10 % Current number of processed clauses : 580
% 1.99/1.10 % Positive orientable unit clauses : 75
% 1.99/1.10 % Positive unorientable unit clauses: 0
% 1.99/1.10 % Negative unit clauses : 22
% 1.99/1.10 % Non-unit-clauses : 483
% 1.99/1.10 % Current number of unprocessed clauses: 5980
% 1.99/1.10 % ...number of literals in the above : 61270
% 1.99/1.10 % Current number of archived formulas : 0
% 1.99/1.10 % Current number of archived clauses : 33
% 1.99/1.10 % Clause-clause subsumption calls (NU) : 41258
% 1.99/1.10 % Rec. Clause-clause subsumption calls : 26313
% 1.99/1.10 % Non-unit clause-clause subsumptions : 246
% 1.99/1.10 % Unit Clause-clause subsumption calls : 2176
% 1.99/1.10 % Rewrite failures with RHS unbound : 0
% 1.99/1.10 % BW rewrite match attempts : 16
% 1.99/1.10 % BW rewrite match successes : 14
% 1.99/1.10 % Condensation attempts : 0
% 1.99/1.10 % Condensation successes : 0
% 1.99/1.10 % Termbank termtop insertions : 422031
% 1.99/1.10 % Search garbage collected termcells : 32041
% 1.99/1.10
% 1.99/1.10 % -------------------------------------------------
% 1.99/1.10 % User time : 0.454 s
% 1.99/1.10 % System time : 0.028 s
% 1.99/1.10 % Total time : 0.482 s
% 1.99/1.10 % Maximum resident set size: 16052 pages
% 1.99/1.10
% 1.99/1.10 % -------------------------------------------------
% 1.99/1.10 % User time : 0.467 s
% 1.99/1.10 % System time : 0.037 s
% 1.99/1.10 % Total time : 0.504 s
% 1.99/1.10 % Maximum resident set size: 5120 pages
% 1.99/1.10 % E exiting
%------------------------------------------------------------------------------