TSTP Solution File: NUM512+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM512+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:07:29 EDT 2023
% Result : Timeout 272.36s 300.16s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 59 ( 17 unt; 0 def)
% Number of atoms : 203 ( 86 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 237 ( 93 ~; 109 |; 26 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn; 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( sdtasdt0(sdtasdt0(sdtsldt0(xn,xr),xm),xr) = sdtasdt0(xn,xm)
& sdtasdt0(xn,xm) = sdtasdt0(sdtsldt0(sdtasdt0(xp,xk),xr),xr) ),
file('/export/starexec/sandbox2/tmp/tmp.1eSGrGyywl/E---3.1_27215.p',m__) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.1eSGrGyywl/E---3.1_27215.p',mMulComm) ).
fof(m__2342,hypothesis,
( aNaturalNumber0(xr)
& doDivides0(xr,xk)
& isPrime0(xr) ),
file('/export/starexec/sandbox2/tmp/tmp.1eSGrGyywl/E---3.1_27215.p',m__2342) ).
fof(m__1837,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox2/tmp/tmp.1eSGrGyywl/E---3.1_27215.p',m__1837) ).
fof(mMulAsso,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.1eSGrGyywl/E---3.1_27215.p',mMulAsso) ).
fof(mDefQuot,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( X1 != sz00
& doDivides0(X1,X2) )
=> ! [X3] :
( X3 = sdtsldt0(X2,X1)
<=> ( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1eSGrGyywl/E---3.1_27215.p',mDefQuot) ).
fof(m__2487,hypothesis,
doDivides0(xr,xn),
file('/export/starexec/sandbox2/tmp/tmp.1eSGrGyywl/E---3.1_27215.p',m__2487) ).
fof(m__1860,hypothesis,
( isPrime0(xp)
& doDivides0(xp,sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox2/tmp/tmp.1eSGrGyywl/E---3.1_27215.p',m__1860) ).
fof(m__2306,hypothesis,
xk = sdtsldt0(sdtasdt0(xn,xm),xp),
file('/export/starexec/sandbox2/tmp/tmp.1eSGrGyywl/E---3.1_27215.p',m__2306) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.1eSGrGyywl/E---3.1_27215.p',mSortsB_02) ).
fof(m__2362,hypothesis,
( sdtlseqdt0(xr,xk)
& doDivides0(xr,sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox2/tmp/tmp.1eSGrGyywl/E---3.1_27215.p',m__2362) ).
fof(mDefPrime,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( isPrime0(X1)
<=> ( X1 != sz00
& X1 != sz10
& ! [X2] :
( ( aNaturalNumber0(X2)
& doDivides0(X2,X1) )
=> ( X2 = sz10
| X2 = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1eSGrGyywl/E---3.1_27215.p',mDefPrime) ).
fof(mSortsC,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox2/tmp/tmp.1eSGrGyywl/E---3.1_27215.p',mSortsC) ).
fof(c_0_13,negated_conjecture,
~ ( sdtasdt0(sdtasdt0(sdtsldt0(xn,xr),xm),xr) = sdtasdt0(xn,xm)
& sdtasdt0(xn,xm) = sdtasdt0(sdtsldt0(sdtasdt0(xp,xk),xr),xr) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_14,negated_conjecture,
( sdtasdt0(sdtasdt0(sdtsldt0(xn,xr),xm),xr) != sdtasdt0(xn,xm)
| sdtasdt0(xn,xm) != sdtasdt0(sdtsldt0(sdtasdt0(xp,xk),xr),xr) ),
inference(fof_nnf,[status(thm)],[c_0_13]) ).
fof(c_0_15,plain,
! [X6,X7] :
( ~ aNaturalNumber0(X6)
| ~ aNaturalNumber0(X7)
| sdtasdt0(X6,X7) = sdtasdt0(X7,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])]) ).
cnf(c_0_16,negated_conjecture,
( sdtasdt0(sdtasdt0(sdtsldt0(xn,xr),xm),xr) != sdtasdt0(xn,xm)
| sdtasdt0(xn,xm) != sdtasdt0(sdtsldt0(sdtasdt0(xp,xk),xr),xr) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,hypothesis,
aNaturalNumber0(xr),
inference(split_conjunct,[status(thm)],[m__2342]) ).
cnf(c_0_19,negated_conjecture,
( sdtasdt0(xr,sdtsldt0(sdtasdt0(xp,xk),xr)) != sdtasdt0(xn,xm)
| sdtasdt0(sdtasdt0(sdtsldt0(xn,xr),xm),xr) != sdtasdt0(xn,xm)
| ~ aNaturalNumber0(sdtsldt0(sdtasdt0(xp,xk),xr)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_20,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1837]) ).
fof(c_0_21,plain,
! [X8,X9,X10] :
( ~ aNaturalNumber0(X8)
| ~ aNaturalNumber0(X9)
| ~ aNaturalNumber0(X10)
| sdtasdt0(sdtasdt0(X8,X9),X10) = sdtasdt0(X8,sdtasdt0(X9,X10)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])]) ).
fof(c_0_22,plain,
! [X30,X31,X32] :
( ( aNaturalNumber0(X32)
| X32 != sdtsldt0(X31,X30)
| X30 = sz00
| ~ doDivides0(X30,X31)
| ~ aNaturalNumber0(X30)
| ~ aNaturalNumber0(X31) )
& ( X31 = sdtasdt0(X30,X32)
| X32 != sdtsldt0(X31,X30)
| X30 = sz00
| ~ doDivides0(X30,X31)
| ~ aNaturalNumber0(X30)
| ~ aNaturalNumber0(X31) )
& ( ~ aNaturalNumber0(X32)
| X31 != sdtasdt0(X30,X32)
| X32 = sdtsldt0(X31,X30)
| X30 = sz00
| ~ doDivides0(X30,X31)
| ~ aNaturalNumber0(X30)
| ~ aNaturalNumber0(X31) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefQuot])])])]) ).
cnf(c_0_23,negated_conjecture,
( sdtasdt0(xr,sdtsldt0(sdtasdt0(xp,xk),xr)) != sdtasdt0(xn,xm)
| sdtasdt0(sdtasdt0(xm,sdtsldt0(xn,xr)),xr) != sdtasdt0(xn,xm)
| ~ aNaturalNumber0(sdtsldt0(sdtasdt0(xp,xk),xr))
| ~ aNaturalNumber0(sdtsldt0(xn,xr)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_20])]) ).
cnf(c_0_24,plain,
( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
( X1 = sdtasdt0(X2,X3)
| X2 = sz00
| X3 != sdtsldt0(X1,X2)
| ~ doDivides0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
( aNaturalNumber0(X1)
| X3 = sz00
| X1 != sdtsldt0(X2,X3)
| ~ doDivides0(X3,X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( sdtasdt0(xr,sdtsldt0(sdtasdt0(xp,xk),xr)) != sdtasdt0(xn,xm)
| sdtasdt0(xm,sdtasdt0(sdtsldt0(xn,xr),xr)) != sdtasdt0(xn,xm)
| ~ aNaturalNumber0(sdtsldt0(sdtasdt0(xp,xk),xr))
| ~ aNaturalNumber0(sdtsldt0(xn,xr)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_18]),c_0_20])]) ).
cnf(c_0_28,plain,
( sdtasdt0(X1,sdtsldt0(X2,X1)) = X2
| X1 = sz00
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_29,hypothesis,
doDivides0(xr,xn),
inference(split_conjunct,[status(thm)],[m__2487]) ).
cnf(c_0_30,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_31,plain,
( X1 = sz00
| aNaturalNumber0(sdtsldt0(X2,X1))
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_32,hypothesis,
doDivides0(xp,sdtasdt0(xn,xm)),
inference(split_conjunct,[status(thm)],[m__1860]) ).
cnf(c_0_33,hypothesis,
xk = sdtsldt0(sdtasdt0(xn,xm),xp),
inference(split_conjunct,[status(thm)],[m__2306]) ).
cnf(c_0_34,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__1837]) ).
fof(c_0_35,plain,
! [X4,X5] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| aNaturalNumber0(sdtasdt0(X4,X5)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).
cnf(c_0_36,hypothesis,
doDivides0(xr,sdtasdt0(xn,xm)),
inference(split_conjunct,[status(thm)],[m__2362]) ).
cnf(c_0_37,negated_conjecture,
( sdtasdt0(xr,sdtsldt0(sdtasdt0(xp,xk),xr)) != sdtasdt0(xn,xm)
| sdtasdt0(xm,sdtasdt0(xr,sdtsldt0(xn,xr))) != sdtasdt0(xn,xm)
| ~ aNaturalNumber0(sdtsldt0(sdtasdt0(xp,xk),xr))
| ~ aNaturalNumber0(sdtsldt0(xn,xr)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_17]),c_0_18])]) ).
cnf(c_0_38,hypothesis,
( sdtasdt0(xr,sdtsldt0(xn,xr)) = xn
| xr = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_18]),c_0_30])]) ).
cnf(c_0_39,hypothesis,
( xr = sz00
| aNaturalNumber0(sdtsldt0(xn,xr)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_29]),c_0_18]),c_0_30])]) ).
cnf(c_0_40,hypothesis,
( sdtasdt0(xp,xk) = sdtasdt0(xn,xm)
| xp = sz00
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_32]),c_0_33]),c_0_34])]) ).
cnf(c_0_41,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_42,hypothesis,
( sdtasdt0(xr,sdtsldt0(sdtasdt0(xn,xm),xr)) = sdtasdt0(xn,xm)
| xr = sz00
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_36]),c_0_18])]) ).
cnf(c_0_43,hypothesis,
( xr = sz00
| sdtasdt0(xr,sdtsldt0(sdtasdt0(xp,xk),xr)) != sdtasdt0(xn,xm)
| sdtasdt0(xm,xn) != sdtasdt0(xn,xm)
| ~ aNaturalNumber0(sdtsldt0(sdtasdt0(xp,xk),xr)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_44,hypothesis,
( sdtasdt0(xp,xk) = sdtasdt0(xn,xm)
| xp = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_20]),c_0_30])]) ).
cnf(c_0_45,hypothesis,
( sdtasdt0(xr,sdtsldt0(sdtasdt0(xn,xm),xr)) = sdtasdt0(xn,xm)
| xr = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_41]),c_0_20]),c_0_30])]) ).
cnf(c_0_46,hypothesis,
( xp = sz00
| xr = sz00
| sdtasdt0(xm,xn) != sdtasdt0(xn,xm)
| ~ aNaturalNumber0(sdtsldt0(sdtasdt0(xn,xm),xr)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_47,hypothesis,
( xr = sz00
| aNaturalNumber0(sdtsldt0(sdtasdt0(xn,xm),xr))
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_36]),c_0_18])]) ).
fof(c_0_48,plain,
! [X79,X80] :
( ( X79 != sz00
| ~ isPrime0(X79)
| ~ aNaturalNumber0(X79) )
& ( X79 != sz10
| ~ isPrime0(X79)
| ~ aNaturalNumber0(X79) )
& ( ~ aNaturalNumber0(X80)
| ~ doDivides0(X80,X79)
| X80 = sz10
| X80 = X79
| ~ isPrime0(X79)
| ~ aNaturalNumber0(X79) )
& ( aNaturalNumber0(esk3_1(X79))
| X79 = sz00
| X79 = sz10
| isPrime0(X79)
| ~ aNaturalNumber0(X79) )
& ( doDivides0(esk3_1(X79),X79)
| X79 = sz00
| X79 = sz10
| isPrime0(X79)
| ~ aNaturalNumber0(X79) )
& ( esk3_1(X79) != sz10
| X79 = sz00
| X79 = sz10
| isPrime0(X79)
| ~ aNaturalNumber0(X79) )
& ( esk3_1(X79) != X79
| X79 = sz00
| X79 = sz10
| isPrime0(X79)
| ~ aNaturalNumber0(X79) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefPrime])])])])]) ).
cnf(c_0_49,hypothesis,
( xr = sz00
| xp = sz00
| ~ aNaturalNumber0(sdtsldt0(sdtasdt0(xn,xm),xr)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_17]),c_0_30]),c_0_20])]) ).
cnf(c_0_50,hypothesis,
( xr = sz00
| aNaturalNumber0(sdtsldt0(sdtasdt0(xn,xm),xr)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_41]),c_0_20]),c_0_30])]) ).
cnf(c_0_51,plain,
( X1 != sz00
| ~ isPrime0(X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_52,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_53,hypothesis,
isPrime0(xr),
inference(split_conjunct,[status(thm)],[m__2342]) ).
cnf(c_0_54,hypothesis,
( xp = sz00
| xr = sz00 ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,plain,
~ isPrime0(sz00),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_51]),c_0_52])]) ).
cnf(c_0_56,hypothesis,
isPrime0(xp),
inference(split_conjunct,[status(thm)],[m__1860]) ).
cnf(c_0_57,hypothesis,
xp = sz00,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]) ).
cnf(c_0_58,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : NUM512+1 : TPTP v8.1.2. Released v4.0.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n012.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 14:25:35 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.15/0.42 Running first-order model finding
% 0.15/0.42 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.1eSGrGyywl/E---3.1_27215.p
% 272.36/300.16 # Version: 3.1pre001
% 272.36/300.16 # Preprocessing class: FSLSSMSSSSSNFFN.
% 272.36/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.36/300.16 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 272.36/300.16 # Starting new_bool_3 with 300s (1) cores
% 272.36/300.16 # Starting new_bool_1 with 300s (1) cores
% 272.36/300.16 # Starting sh5l with 300s (1) cores
% 272.36/300.16 # sh5l with pid 27299 completed with status 0
% 272.36/300.16 # Result found by sh5l
% 272.36/300.16 # Preprocessing class: FSLSSMSSSSSNFFN.
% 272.36/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.36/300.16 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 272.36/300.16 # Starting new_bool_3 with 300s (1) cores
% 272.36/300.16 # Starting new_bool_1 with 300s (1) cores
% 272.36/300.16 # Starting sh5l with 300s (1) cores
% 272.36/300.16 # SinE strategy is gf500_gu_R04_F100_L20000
% 272.36/300.16 # Search class: FGHSF-FFMM21-MFFFFFNN
% 272.36/300.16 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 272.36/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 272.36/300.16 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 27303 completed with status 0
% 272.36/300.16 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 272.36/300.16 # Preprocessing class: FSLSSMSSSSSNFFN.
% 272.36/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.36/300.16 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 272.36/300.16 # Starting new_bool_3 with 300s (1) cores
% 272.36/300.16 # Starting new_bool_1 with 300s (1) cores
% 272.36/300.16 # Starting sh5l with 300s (1) cores
% 272.36/300.16 # SinE strategy is gf500_gu_R04_F100_L20000
% 272.36/300.16 # Search class: FGHSF-FFMM21-MFFFFFNN
% 272.36/300.16 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 272.36/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 272.36/300.16 # Preprocessing time : 0.002 s
% 272.36/300.16 # Presaturation interreduction done
% 272.36/300.16
% 272.36/300.16 # Proof found!
% 272.36/300.16 # SZS status Theorem
% 272.36/300.16 # SZS output start CNFRefutation
% See solution above
% 272.36/300.16 # Parsed axioms : 54
% 272.36/300.16 # Removed by relevancy pruning/SinE : 1
% 272.36/300.16 # Initial clauses : 96
% 272.36/300.16 # Removed in clause preprocessing : 3
% 272.36/300.16 # Initial clauses in saturation : 93
% 272.36/300.16 # Processed clauses : 304
% 272.36/300.16 # ...of these trivial : 1
% 272.36/300.16 # ...subsumed : 34
% 272.36/300.16 # ...remaining for further processing : 269
% 272.36/300.16 # Other redundant clauses eliminated : 17
% 272.36/300.16 # Clauses deleted for lack of memory : 0
% 272.36/300.16 # Backward-subsumed : 9
% 272.36/300.16 # Backward-rewritten : 42
% 272.36/300.16 # Generated clauses : 791
% 272.36/300.16 # ...of the previous two non-redundant : 755
% 272.36/300.16 # ...aggressively subsumed : 0
% 272.36/300.16 # Contextual simplify-reflections : 9
% 272.36/300.16 # Paramodulations : 772
% 272.36/300.16 # Factorizations : 0
% 272.36/300.16 # NegExts : 0
% 272.36/300.16 # Equation resolutions : 19
% 272.36/300.16 # Total rewrite steps : 450
% 272.36/300.16 # Propositional unsat checks : 0
% 272.36/300.16 # Propositional check models : 0
% 272.36/300.16 # Propositional check unsatisfiable : 0
% 272.36/300.16 # Propositional clauses : 0
% 272.36/300.16 # Propositional clauses after purity: 0
% 272.36/300.16 # Propositional unsat core size : 0
% 272.36/300.16 # Propositional preprocessing time : 0.000
% 272.36/300.16 # Propositional encoding time : 0.000
% 272.36/300.16 # Propositional solver time : 0.000
% 272.36/300.16 # Success case prop preproc time : 0.000
% 272.36/300.16 # Success case prop encoding time : 0.000
% 272.36/300.16 # Success case prop solver time : 0.000
% 272.36/300.16 # Current number of processed clauses : 125
% 272.36/300.16 # Positive orientable unit clauses : 17
% 272.36/300.16 # Positive unorientable unit clauses: 0
% 272.36/300.16 # Negative unit clauses : 6
% 272.36/300.16 # Non-unit-clauses : 102
% 272.36/300.16 # Current number of unprocessed clauses: 603
% 272.36/300.16 # ...number of literals in the above : 2876
% 272.36/300.16 # Current number of archived formulas : 0
% 272.36/300.16 # Current number of archived clauses : 136
% 272.36/300.16 # Clause-clause subsumption calls (NU) : 2251
% 272.36/300.16 # Rec. Clause-clause subsumption calls : 512
% 272.36/300.16 # Non-unit clause-clause subsumptions : 47
% 272.36/300.16 # Unit Clause-clause subsumption calls : 168
% 272.36/300.16 # Rewrite failures with RHS unbound : 0
% 272.36/300.16 # BW rewrite match attempts : 4
% 272.36/300.16 # BW rewrite match successes : 4
% 272.36/300.16 # Condensation attempts : 0
% 272.36/300.16 # Condensation successes : 0
% 272.36/300.16 # Termbank termtop insertions : 19433
% 272.36/300.16
% 272.36/300.16 # -------------------------------------------------
% 272.36/300.16 # User time : 0.024 s
% 272.36/300.16 # System time : 0.006 s
% 272.36/300.16 # Total time : 0.030 s
% 272.36/300.16 # Maximum resident set size: 2048 pages
% 272.36/300.16
% 272.36/300.16 # -------------------------------------------------
% 272.36/300.16 # User time : 0.027 s
% 272.36/300.16 # System time : 0.006 s
% 272.36/300.16 # Total time : 0.033 s
% 272.36/300.16 # Maximum resident set size: 1736 pages
% 272.36/300.17 % E---3.1 exiting
%------------------------------------------------------------------------------