TSTP Solution File: NUM633+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM633+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:08:04 EDT 2023
% Result : Theorem 29.25s 4.38s
% Output : CNFRefutation 29.25s
% 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] :
( ( ( ( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xO) ) )
| aSubsetOf0(X1,xO) )
& sbrdtbr0(X1) = xK )
| aElementOf0(X1,slbdtsldtrb0(xO,xK)) )
=> ( ~ ( ~ ? [X2] : aElementOf0(X2,X1)
| X1 = slcrc0 )
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,szNzAzT0) )
& aSubsetOf0(X1,szNzAzT0)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSubsetOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSubsetOf0(X1,xS)
& aElementOf0(X1,szDzozmdt0(xc))
& sdtlpdtrp0(xc,X1) = szDzizrdt0(xd) ) )
=> ? [X1] :
( aElementOf0(X1,xT)
& ? [X2] :
( ( ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,xS) ) )
| aSubsetOf0(X2,xS) )
& isCountable0(X2)
& ! [X3] :
( ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,X2) )
& aSubsetOf0(X3,X2)
& sbrdtbr0(X3) = xK
& aElementOf0(X3,slbdtsldtrb0(X2,xK)) )
=> sdtlpdtrp0(xc,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ILkXagJeMl/E---3.1_335.p',m__) ).
fof(m__4998,hypothesis,
( ! [X1] :
( aElementOf0(X1,xO)
=> aElementOf0(X1,xS) )
& aSubsetOf0(xO,xS) ),
file('/export/starexec/sandbox/tmp/tmp.ILkXagJeMl/E---3.1_335.p',m__4998) ).
fof(m__4908,hypothesis,
( aSet0(xO)
& isCountable0(xO) ),
file('/export/starexec/sandbox/tmp/tmp.ILkXagJeMl/E---3.1_335.p',m__4908) ).
fof(m__4854,hypothesis,
( aElementOf0(szDzizrdt0(xd),xT)
& aSet0(sdtlbdtrb0(xd,szDzizrdt0(xd)))
& ! [X1] :
( aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
<=> ( aElementOf0(X1,szDzozmdt0(xd))
& sdtlpdtrp0(xd,X1) = szDzizrdt0(xd) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ILkXagJeMl/E---3.1_335.p',m__4854) ).
fof(c_0_4,negated_conjecture,
~ ( ! [X1] :
( ( ( ( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xO) ) )
| aSubsetOf0(X1,xO) )
& sbrdtbr0(X1) = xK )
| aElementOf0(X1,slbdtsldtrb0(xO,xK)) )
=> ( ~ ( ~ ? [X2] : aElementOf0(X2,X1)
| X1 = slcrc0 )
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,szNzAzT0) )
& aSubsetOf0(X1,szNzAzT0)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSubsetOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSubsetOf0(X1,xS)
& aElementOf0(X1,szDzozmdt0(xc))
& sdtlpdtrp0(xc,X1) = szDzizrdt0(xd) ) )
=> ? [X1] :
( aElementOf0(X1,xT)
& ? [X2] :
( ( ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,xS) ) )
| aSubsetOf0(X2,xS) )
& isCountable0(X2)
& ! [X3] :
( ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,X2) )
& aSubsetOf0(X3,X2)
& sbrdtbr0(X3) = xK
& aElementOf0(X3,slbdtsldtrb0(X2,xK)) )
=> sdtlpdtrp0(xc,X3) = X1 ) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,negated_conjecture,
! [X246,X249,X250,X251,X252,X253,X256] :
( ( aElementOf0(esk41_1(X246),X246)
| aElementOf0(esk40_1(X246),X246)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( X246 != slcrc0
| aElementOf0(esk40_1(X246),X246)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( ~ aElementOf0(X249,X246)
| aElementOf0(X249,szNzAzT0)
| aElementOf0(esk40_1(X246),X246)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( aSubsetOf0(X246,szNzAzT0)
| aElementOf0(esk40_1(X246),X246)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( ~ aElementOf0(X250,X246)
| aElementOf0(X250,xS)
| aElementOf0(esk40_1(X246),X246)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( aSubsetOf0(X246,xS)
| aElementOf0(esk40_1(X246),X246)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( ~ aElementOf0(X251,X246)
| aElementOf0(X251,xS)
| aElementOf0(esk40_1(X246),X246)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( aSubsetOf0(X246,xS)
| aElementOf0(esk40_1(X246),X246)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( aElementOf0(X246,szDzozmdt0(xc))
| aElementOf0(esk40_1(X246),X246)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( sdtlpdtrp0(xc,X246) = szDzizrdt0(xd)
| aElementOf0(esk40_1(X246),X246)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( aElementOf0(esk41_1(X246),X246)
| ~ aElementOf0(esk40_1(X246),xO)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( X246 != slcrc0
| ~ aElementOf0(esk40_1(X246),xO)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( ~ aElementOf0(X249,X246)
| aElementOf0(X249,szNzAzT0)
| ~ aElementOf0(esk40_1(X246),xO)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( aSubsetOf0(X246,szNzAzT0)
| ~ aElementOf0(esk40_1(X246),xO)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( ~ aElementOf0(X250,X246)
| aElementOf0(X250,xS)
| ~ aElementOf0(esk40_1(X246),xO)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( aSubsetOf0(X246,xS)
| ~ aElementOf0(esk40_1(X246),xO)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( ~ aElementOf0(X251,X246)
| aElementOf0(X251,xS)
| ~ aElementOf0(esk40_1(X246),xO)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( aSubsetOf0(X246,xS)
| ~ aElementOf0(esk40_1(X246),xO)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( aElementOf0(X246,szDzozmdt0(xc))
| ~ aElementOf0(esk40_1(X246),xO)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( sdtlpdtrp0(xc,X246) = szDzizrdt0(xd)
| ~ aElementOf0(esk40_1(X246),xO)
| ~ aSet0(X246)
| sbrdtbr0(X246) != xK )
& ( aElementOf0(esk41_1(X246),X246)
| ~ aSubsetOf0(X246,xO)
| sbrdtbr0(X246) != xK )
& ( X246 != slcrc0
| ~ aSubsetOf0(X246,xO)
| sbrdtbr0(X246) != xK )
& ( ~ aElementOf0(X249,X246)
| aElementOf0(X249,szNzAzT0)
| ~ aSubsetOf0(X246,xO)
| sbrdtbr0(X246) != xK )
& ( aSubsetOf0(X246,szNzAzT0)
| ~ aSubsetOf0(X246,xO)
| sbrdtbr0(X246) != xK )
& ( ~ aElementOf0(X250,X246)
| aElementOf0(X250,xS)
| ~ aSubsetOf0(X246,xO)
| sbrdtbr0(X246) != xK )
& ( aSubsetOf0(X246,xS)
| ~ aSubsetOf0(X246,xO)
| sbrdtbr0(X246) != xK )
& ( ~ aElementOf0(X251,X246)
| aElementOf0(X251,xS)
| ~ aSubsetOf0(X246,xO)
| sbrdtbr0(X246) != xK )
& ( aSubsetOf0(X246,xS)
| ~ aSubsetOf0(X246,xO)
| sbrdtbr0(X246) != xK )
& ( aElementOf0(X246,szDzozmdt0(xc))
| ~ aSubsetOf0(X246,xO)
| sbrdtbr0(X246) != xK )
& ( sdtlpdtrp0(xc,X246) = szDzizrdt0(xd)
| ~ aSubsetOf0(X246,xO)
| sbrdtbr0(X246) != xK )
& ( aElementOf0(esk41_1(X246),X246)
| ~ aElementOf0(X246,slbdtsldtrb0(xO,xK)) )
& ( X246 != slcrc0
| ~ aElementOf0(X246,slbdtsldtrb0(xO,xK)) )
& ( ~ aElementOf0(X249,X246)
| aElementOf0(X249,szNzAzT0)
| ~ aElementOf0(X246,slbdtsldtrb0(xO,xK)) )
& ( aSubsetOf0(X246,szNzAzT0)
| ~ aElementOf0(X246,slbdtsldtrb0(xO,xK)) )
& ( ~ aElementOf0(X250,X246)
| aElementOf0(X250,xS)
| ~ aElementOf0(X246,slbdtsldtrb0(xO,xK)) )
& ( aSubsetOf0(X246,xS)
| ~ aElementOf0(X246,slbdtsldtrb0(xO,xK)) )
& ( ~ aElementOf0(X251,X246)
| aElementOf0(X251,xS)
| ~ aElementOf0(X246,slbdtsldtrb0(xO,xK)) )
& ( aSubsetOf0(X246,xS)
| ~ aElementOf0(X246,slbdtsldtrb0(xO,xK)) )
& ( aElementOf0(X246,szDzozmdt0(xc))
| ~ aElementOf0(X246,slbdtsldtrb0(xO,xK)) )
& ( sdtlpdtrp0(xc,X246) = szDzizrdt0(xd)
| ~ aElementOf0(X246,slbdtsldtrb0(xO,xK)) )
& ( aSet0(esk43_2(X252,X253))
| aElementOf0(esk42_2(X252,X253),X253)
| ~ aSet0(X253)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( ~ aElementOf0(X256,esk43_2(X252,X253))
| aElementOf0(X256,X253)
| aElementOf0(esk42_2(X252,X253),X253)
| ~ aSet0(X253)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( aSubsetOf0(esk43_2(X252,X253),X253)
| aElementOf0(esk42_2(X252,X253),X253)
| ~ aSet0(X253)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( sbrdtbr0(esk43_2(X252,X253)) = xK
| aElementOf0(esk42_2(X252,X253),X253)
| ~ aSet0(X253)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( aElementOf0(esk43_2(X252,X253),slbdtsldtrb0(X253,xK))
| aElementOf0(esk42_2(X252,X253),X253)
| ~ aSet0(X253)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( sdtlpdtrp0(xc,esk43_2(X252,X253)) != X252
| aElementOf0(esk42_2(X252,X253),X253)
| ~ aSet0(X253)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( aSet0(esk43_2(X252,X253))
| ~ aElementOf0(esk42_2(X252,X253),xS)
| ~ aSet0(X253)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( ~ aElementOf0(X256,esk43_2(X252,X253))
| aElementOf0(X256,X253)
| ~ aElementOf0(esk42_2(X252,X253),xS)
| ~ aSet0(X253)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( aSubsetOf0(esk43_2(X252,X253),X253)
| ~ aElementOf0(esk42_2(X252,X253),xS)
| ~ aSet0(X253)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( sbrdtbr0(esk43_2(X252,X253)) = xK
| ~ aElementOf0(esk42_2(X252,X253),xS)
| ~ aSet0(X253)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( aElementOf0(esk43_2(X252,X253),slbdtsldtrb0(X253,xK))
| ~ aElementOf0(esk42_2(X252,X253),xS)
| ~ aSet0(X253)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( sdtlpdtrp0(xc,esk43_2(X252,X253)) != X252
| ~ aElementOf0(esk42_2(X252,X253),xS)
| ~ aSet0(X253)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( aSet0(esk43_2(X252,X253))
| ~ aSubsetOf0(X253,xS)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( ~ aElementOf0(X256,esk43_2(X252,X253))
| aElementOf0(X256,X253)
| ~ aSubsetOf0(X253,xS)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( aSubsetOf0(esk43_2(X252,X253),X253)
| ~ aSubsetOf0(X253,xS)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( sbrdtbr0(esk43_2(X252,X253)) = xK
| ~ aSubsetOf0(X253,xS)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( aElementOf0(esk43_2(X252,X253),slbdtsldtrb0(X253,xK))
| ~ aSubsetOf0(X253,xS)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) )
& ( sdtlpdtrp0(xc,esk43_2(X252,X253)) != X252
| ~ aSubsetOf0(X253,xS)
| ~ isCountable0(X253)
| ~ aElementOf0(X252,xT) ) ),
inference(distribute,[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,
! [X245] :
( ( ~ aElementOf0(X245,xO)
| aElementOf0(X245,xS) )
& aSubsetOf0(xO,xS) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4998])])]) ).
cnf(c_0_7,negated_conjecture,
( sdtlpdtrp0(xc,X1) = szDzizrdt0(xd)
| ~ aElementOf0(X1,slbdtsldtrb0(xO,xK)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( aElementOf0(esk43_2(X1,X2),slbdtsldtrb0(X2,xK))
| ~ aSubsetOf0(X2,xS)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT) ),
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,
! [X236] :
( aElementOf0(szDzizrdt0(xd),xT)
& aSet0(sdtlbdtrb0(xd,szDzizrdt0(xd)))
& ( aElementOf0(X236,szDzozmdt0(xd))
| ~ aElementOf0(X236,sdtlbdtrb0(xd,szDzizrdt0(xd))) )
& ( sdtlpdtrp0(xd,X236) = szDzizrdt0(xd)
| ~ aElementOf0(X236,sdtlbdtrb0(xd,szDzizrdt0(xd))) )
& ( ~ aElementOf0(X236,szDzozmdt0(xd))
| sdtlpdtrp0(xd,X236) != szDzizrdt0(xd)
| aElementOf0(X236,sdtlbdtrb0(xd,szDzizrdt0(xd))) ) ),
inference(distribute,[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,
( sdtlpdtrp0(xc,esk43_2(X1,X2)) != X1
| ~ aSubsetOf0(X2,xS)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
( sdtlpdtrp0(xc,esk43_2(X1,xO)) = szDzizrdt0(xd)
| ~ aElementOf0(X1,xT) ),
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.12 % Problem : NUM633+3 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n018.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 14:17:08 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.ILkXagJeMl/E---3.1_335.p
% 29.25/4.38 # Version: 3.1pre001
% 29.25/4.38 # Preprocessing class: FSLSSMSMSSSNFFN.
% 29.25/4.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.25/4.38 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 29.25/4.38 # Starting new_bool_3 with 300s (1) cores
% 29.25/4.38 # Starting new_bool_1 with 300s (1) cores
% 29.25/4.38 # Starting sh5l with 300s (1) cores
% 29.25/4.38 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 420 completed with status 0
% 29.25/4.38 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 29.25/4.38 # Preprocessing class: FSLSSMSMSSSNFFN.
% 29.25/4.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.25/4.38 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 29.25/4.38 # No SInE strategy applied
% 29.25/4.38 # Search class: FGHSF-SMLM32-MFFFFFNN
% 29.25/4.38 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 29.25/4.38 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 29.25/4.38 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 29.25/4.38 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 29.25/4.38 # Starting new_bool_3 with 136s (1) cores
% 29.25/4.38 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 29.25/4.38 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 431 completed with status 0
% 29.25/4.38 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 29.25/4.38 # Preprocessing class: FSLSSMSMSSSNFFN.
% 29.25/4.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.25/4.38 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 29.25/4.38 # No SInE strategy applied
% 29.25/4.38 # Search class: FGHSF-SMLM32-MFFFFFNN
% 29.25/4.38 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 29.25/4.38 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 29.25/4.38 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 29.25/4.38 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 29.25/4.38 # Starting new_bool_3 with 136s (1) cores
% 29.25/4.38 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 29.25/4.38 # Preprocessing time : 0.105 s
% 29.25/4.38 # Presaturation interreduction done
% 29.25/4.38
% 29.25/4.38 # Proof found!
% 29.25/4.38 # SZS status Theorem
% 29.25/4.38 # SZS output start CNFRefutation
% See solution above
% 29.25/4.38 # Parsed axioms : 99
% 29.25/4.38 # Removed by relevancy pruning/SinE : 0
% 29.25/4.38 # Initial clauses : 4934
% 29.25/4.38 # Removed in clause preprocessing : 7
% 29.25/4.38 # Initial clauses in saturation : 4927
% 29.25/4.38 # Processed clauses : 7306
% 29.25/4.38 # ...of these trivial : 5
% 29.25/4.38 # ...subsumed : 1004
% 29.25/4.38 # ...remaining for further processing : 6297
% 29.25/4.38 # Other redundant clauses eliminated : 2055
% 29.25/4.38 # Clauses deleted for lack of memory : 0
% 29.25/4.38 # Backward-subsumed : 19
% 29.25/4.38 # Backward-rewritten : 17
% 29.25/4.38 # Generated clauses : 3023
% 29.25/4.38 # ...of the previous two non-redundant : 2944
% 29.25/4.38 # ...aggressively subsumed : 0
% 29.25/4.38 # Contextual simplify-reflections : 94
% 29.25/4.38 # Paramodulations : 1166
% 29.25/4.38 # Factorizations : 0
% 29.25/4.38 # NegExts : 0
% 29.25/4.38 # Equation resolutions : 2057
% 29.25/4.38 # Total rewrite steps : 501
% 29.25/4.38 # Propositional unsat checks : 2
% 29.25/4.38 # Propositional check models : 2
% 29.25/4.38 # Propositional check unsatisfiable : 0
% 29.25/4.38 # Propositional clauses : 0
% 29.25/4.38 # Propositional clauses after purity: 0
% 29.25/4.38 # Propositional unsat core size : 0
% 29.25/4.38 # Propositional preprocessing time : 0.000
% 29.25/4.38 # Propositional encoding time : 0.029
% 29.25/4.38 # Propositional solver time : 0.001
% 29.25/4.38 # Success case prop preproc time : 0.000
% 29.25/4.38 # Success case prop encoding time : 0.000
% 29.25/4.38 # Success case prop solver time : 0.000
% 29.25/4.38 # Current number of processed clauses : 401
% 29.25/4.38 # Positive orientable unit clauses : 60
% 29.25/4.38 # Positive unorientable unit clauses: 0
% 29.25/4.38 # Negative unit clauses : 24
% 29.25/4.38 # Non-unit-clauses : 317
% 29.25/4.38 # Current number of unprocessed clauses: 4561
% 29.25/4.38 # ...number of literals in the above : 46701
% 29.25/4.38 # Current number of archived formulas : 0
% 29.25/4.38 # Current number of archived clauses : 4050
% 29.25/4.38 # Clause-clause subsumption calls (NU) : 6873623
% 29.25/4.38 # Rec. Clause-clause subsumption calls : 77805
% 29.25/4.38 # Non-unit clause-clause subsumptions : 1051
% 29.25/4.38 # Unit Clause-clause subsumption calls : 1868
% 29.25/4.38 # Rewrite failures with RHS unbound : 0
% 29.25/4.38 # BW rewrite match attempts : 8
% 29.25/4.38 # BW rewrite match successes : 6
% 29.25/4.38 # Condensation attempts : 0
% 29.25/4.38 # Condensation successes : 0
% 29.25/4.38 # Termbank termtop insertions : 872415
% 29.25/4.38
% 29.25/4.38 # -------------------------------------------------
% 29.25/4.38 # User time : 3.764 s
% 29.25/4.38 # System time : 0.032 s
% 29.25/4.38 # Total time : 3.796 s
% 29.25/4.38 # Maximum resident set size: 14300 pages
% 29.25/4.38
% 29.25/4.38 # -------------------------------------------------
% 29.25/4.38 # User time : 17.829 s
% 29.25/4.38 # System time : 0.102 s
% 29.25/4.38 # Total time : 17.931 s
% 29.25/4.38 # Maximum resident set size: 1856 pages
% 29.25/4.38 % E---3.1 exiting
%------------------------------------------------------------------------------