TSTP Solution File: NUM462+1 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : NUM462+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% Computer : n027.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 : 300s
% WCLimit : 300s
% DateTime : Mon Jun 24 12:47:39 EDT 2024
% Result : Theorem 1.41s 0.67s
% Output : CNFRefutation 1.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 50 ( 10 unt; 0 def)
% Number of atoms : 197 ( 65 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 251 ( 104 ~; 98 |; 32 &)
% ( 2 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 71 ( 0 sgn 38 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefLE,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtlseqdt0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& sdtpldt0(X1,X3) = X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.i9YmLCGbtY/E---3.1_9365.p',mDefLE) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.i9YmLCGbtY/E---3.1_9365.p',mSortsB) ).
fof(mDefDiff,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtlseqdt0(X1,X2)
=> ! [X3] :
( X3 = sdtmndt0(X2,X1)
<=> ( aNaturalNumber0(X3)
& sdtpldt0(X1,X3) = X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.i9YmLCGbtY/E---3.1_9365.p',mDefDiff) ).
fof(m__897_03,hypothesis,
( xm != sz00
& xl != xn
& sdtlseqdt0(xl,xn) ),
file('/export/starexec/sandbox/tmp/tmp.i9YmLCGbtY/E---3.1_9365.p',m__897_03) ).
fof(mAMDistr,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(sdtpldt0(X2,X3),X1) = sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.i9YmLCGbtY/E---3.1_9365.p',mAMDistr) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.i9YmLCGbtY/E---3.1_9365.p',mSortsB_02) ).
fof(m__,conjecture,
( sdtasdt0(xm,xl) != sdtasdt0(xm,xn)
& sdtlseqdt0(sdtasdt0(xm,xl),sdtasdt0(xm,xn))
& sdtasdt0(xl,xm) != sdtasdt0(xn,xm)
& sdtlseqdt0(sdtasdt0(xl,xm),sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox/tmp/tmp.i9YmLCGbtY/E---3.1_9365.p',m__) ).
fof(m__897,hypothesis,
( aNaturalNumber0(xm)
& aNaturalNumber0(xl)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/tmp/tmp.i9YmLCGbtY/E---3.1_9365.p',m__897) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.i9YmLCGbtY/E---3.1_9365.p',mMulComm) ).
fof(mMulCanc,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 != sz00
=> ! [X2,X3] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( sdtasdt0(X1,X2) = sdtasdt0(X1,X3)
| sdtasdt0(X2,X1) = sdtasdt0(X3,X1) )
=> X2 = X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.i9YmLCGbtY/E---3.1_9365.p',mMulCanc) ).
fof(c_0_10,plain,
! [X35,X36,X38] :
( ( aNaturalNumber0(esk1_2(X35,X36))
| ~ sdtlseqdt0(X35,X36)
| ~ aNaturalNumber0(X35)
| ~ aNaturalNumber0(X36) )
& ( sdtpldt0(X35,esk1_2(X35,X36)) = X36
| ~ sdtlseqdt0(X35,X36)
| ~ aNaturalNumber0(X35)
| ~ aNaturalNumber0(X36) )
& ( ~ aNaturalNumber0(X38)
| sdtpldt0(X35,X38) != X36
| sdtlseqdt0(X35,X36)
| ~ aNaturalNumber0(X35)
| ~ aNaturalNumber0(X36) ) ),
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)],[mDefLE])])])])])]) ).
fof(c_0_11,plain,
! [X5,X6] :
( ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| aNaturalNumber0(sdtpldt0(X5,X6)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).
fof(c_0_12,plain,
! [X39,X40,X41] :
( ( aNaturalNumber0(X41)
| X41 != sdtmndt0(X40,X39)
| ~ sdtlseqdt0(X39,X40)
| ~ aNaturalNumber0(X39)
| ~ aNaturalNumber0(X40) )
& ( sdtpldt0(X39,X41) = X40
| X41 != sdtmndt0(X40,X39)
| ~ sdtlseqdt0(X39,X40)
| ~ aNaturalNumber0(X39)
| ~ aNaturalNumber0(X40) )
& ( ~ aNaturalNumber0(X41)
| sdtpldt0(X39,X41) != X40
| X41 = sdtmndt0(X40,X39)
| ~ sdtlseqdt0(X39,X40)
| ~ aNaturalNumber0(X39)
| ~ aNaturalNumber0(X40) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiff])])])])]) ).
fof(c_0_13,hypothesis,
( xm != sz00
& xl != xn
& sdtlseqdt0(xl,xn) ),
inference(fof_simplification,[status(thm)],[m__897_03]) ).
cnf(c_0_14,plain,
( sdtlseqdt0(X2,X3)
| ~ aNaturalNumber0(X1)
| sdtpldt0(X2,X1) != X3
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X22,X23,X24] :
( ( sdtasdt0(X22,sdtpldt0(X23,X24)) = sdtpldt0(sdtasdt0(X22,X23),sdtasdt0(X22,X24))
| ~ aNaturalNumber0(X22)
| ~ aNaturalNumber0(X23)
| ~ aNaturalNumber0(X24) )
& ( sdtasdt0(sdtpldt0(X23,X24),X22) = sdtpldt0(sdtasdt0(X23,X22),sdtasdt0(X24,X22))
| ~ aNaturalNumber0(X22)
| ~ aNaturalNumber0(X23)
| ~ aNaturalNumber0(X24) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAMDistr])])])]) ).
fof(c_0_17,plain,
! [X7,X8] :
( ~ aNaturalNumber0(X7)
| ~ aNaturalNumber0(X8)
| aNaturalNumber0(sdtasdt0(X7,X8)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
cnf(c_0_18,plain,
( sdtpldt0(X1,X2) = X3
| X2 != sdtmndt0(X3,X1)
| ~ sdtlseqdt0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_19,hypothesis,
( xm != sz00
& xl != xn
& sdtlseqdt0(xl,xn) ),
inference(fof_nnf,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( aNaturalNumber0(X1)
| X1 != sdtmndt0(X2,X3)
| ~ sdtlseqdt0(X3,X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_21,negated_conjecture,
~ ( sdtasdt0(xm,xl) != sdtasdt0(xm,xn)
& sdtlseqdt0(sdtasdt0(xm,xl),sdtasdt0(xm,xn))
& sdtasdt0(xl,xm) != sdtasdt0(xn,xm)
& sdtlseqdt0(sdtasdt0(xl,xm),sdtasdt0(xn,xm)) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_22,plain,
( sdtlseqdt0(X1,sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_14]),c_0_15]) ).
cnf(c_0_23,plain,
( sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( sdtpldt0(X1,sdtmndt0(X2,X1)) = X2
| ~ sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_26,hypothesis,
sdtlseqdt0(xl,xn),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__897]) ).
cnf(c_0_28,hypothesis,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[m__897]) ).
cnf(c_0_29,plain,
( aNaturalNumber0(sdtmndt0(X1,X2))
| ~ sdtlseqdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[c_0_20]) ).
fof(c_0_30,negated_conjecture,
( sdtasdt0(xm,xl) = sdtasdt0(xm,xn)
| ~ sdtlseqdt0(sdtasdt0(xm,xl),sdtasdt0(xm,xn))
| sdtasdt0(xl,xm) = sdtasdt0(xn,xm)
| ~ sdtlseqdt0(sdtasdt0(xl,xm),sdtasdt0(xn,xm)) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])]) ).
cnf(c_0_31,plain,
( sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,sdtpldt0(X2,X3)))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_24]) ).
cnf(c_0_32,hypothesis,
sdtpldt0(xl,sdtmndt0(xn,xl)) = xn,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_33,hypothesis,
aNaturalNumber0(sdtmndt0(xn,xl)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_26]),c_0_28]),c_0_27])]) ).
cnf(c_0_34,negated_conjecture,
( sdtasdt0(xm,xl) = sdtasdt0(xm,xn)
| sdtasdt0(xl,xm) = sdtasdt0(xn,xm)
| ~ sdtlseqdt0(sdtasdt0(xm,xl),sdtasdt0(xm,xn))
| ~ sdtlseqdt0(sdtasdt0(xl,xm),sdtasdt0(xn,xm)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,hypothesis,
( sdtlseqdt0(sdtasdt0(X1,xl),sdtasdt0(X1,xn))
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_28])]) ).
cnf(c_0_36,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__897]) ).
fof(c_0_37,plain,
! [X15,X16] :
( ~ aNaturalNumber0(X15)
| ~ aNaturalNumber0(X16)
| sdtasdt0(X15,X16) = sdtasdt0(X16,X15) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])])]) ).
cnf(c_0_38,negated_conjecture,
( sdtasdt0(xn,xm) = sdtasdt0(xl,xm)
| sdtasdt0(xm,xn) = sdtasdt0(xm,xl)
| ~ sdtlseqdt0(sdtasdt0(xl,xm),sdtasdt0(xn,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_39,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
fof(c_0_40,plain,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 != sz00
=> ! [X2,X3] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( sdtasdt0(X1,X2) = sdtasdt0(X1,X3)
| sdtasdt0(X2,X1) = sdtasdt0(X3,X1) )
=> X2 = X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[mMulCanc]) ).
cnf(c_0_41,negated_conjecture,
( sdtasdt0(xm,xn) = sdtasdt0(xm,xl)
| sdtasdt0(xl,xm) = sdtasdt0(xm,xn)
| ~ sdtlseqdt0(sdtasdt0(xl,xm),sdtasdt0(xm,xn)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_36]),c_0_27])]) ).
fof(c_0_42,plain,
! [X28,X29,X30] :
( ( sdtasdt0(X28,X29) != sdtasdt0(X28,X30)
| X29 = X30
| ~ aNaturalNumber0(X29)
| ~ aNaturalNumber0(X30)
| X28 = sz00
| ~ aNaturalNumber0(X28) )
& ( sdtasdt0(X29,X28) != sdtasdt0(X30,X28)
| X29 = X30
| ~ aNaturalNumber0(X29)
| ~ aNaturalNumber0(X30)
| X28 = sz00
| ~ aNaturalNumber0(X28) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_40])])])])]) ).
cnf(c_0_43,negated_conjecture,
( sdtasdt0(xm,xn) = sdtasdt0(xm,xl)
| ~ sdtlseqdt0(sdtasdt0(xm,xl),sdtasdt0(xm,xn)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_39]),c_0_36]),c_0_28])]) ).
cnf(c_0_44,plain,
( X2 = X3
| X1 = sz00
| sdtasdt0(X1,X2) != sdtasdt0(X1,X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_45,hypothesis,
sdtasdt0(xm,xn) = sdtasdt0(xm,xl),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_35]),c_0_36])]) ).
cnf(c_0_46,hypothesis,
xm != sz00,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_47,hypothesis,
( xn = X1
| sdtasdt0(xm,xl) != sdtasdt0(xm,X1)
| ~ aNaturalNumber0(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_27]),c_0_36])]),c_0_46]) ).
cnf(c_0_48,hypothesis,
xl != xn,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_49,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_47]),c_0_28])]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : NUM462+1 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.13 % Command : run_E %s %d SAT
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat Jun 22 19:52:09 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 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.i9YmLCGbtY/E---3.1_9365.p
% 1.41/0.67 # Version: 3.2.0
% 1.41/0.67 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.41/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.41/0.67 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.41/0.67 # Starting new_bool_3 with 300s (1) cores
% 1.41/0.67 # Starting new_bool_1 with 300s (1) cores
% 1.41/0.67 # Starting sh5l with 300s (1) cores
% 1.41/0.67 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 9479 completed with status 0
% 1.41/0.67 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.41/0.67 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.41/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.41/0.67 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.41/0.67 # No SInE strategy applied
% 1.41/0.67 # Search class: FGUSF-FFMM22-SFFFFFNN
% 1.41/0.67 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.41/0.67 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 1.41/0.67 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.41/0.67 # Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.41/0.67 # Starting new_bool_3 with 136s (1) cores
% 1.41/0.67 # Starting new_bool_1 with 136s (1) cores
% 1.41/0.67 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 9491 completed with status 0
% 1.41/0.67 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 1.41/0.67 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.41/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.41/0.67 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.41/0.67 # No SInE strategy applied
% 1.41/0.67 # Search class: FGUSF-FFMM22-SFFFFFNN
% 1.41/0.67 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.41/0.67 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 1.41/0.67 # Preprocessing time : 0.002 s
% 1.41/0.67 # Presaturation interreduction done
% 1.41/0.67
% 1.41/0.67 # Proof found!
% 1.41/0.67 # SZS status Theorem
% 1.41/0.67 # SZS output start CNFRefutation
% See solution above
% 1.41/0.67 # Parsed axioms : 27
% 1.41/0.67 # Removed by relevancy pruning/SinE : 0
% 1.41/0.67 # Initial clauses : 47
% 1.41/0.67 # Removed in clause preprocessing : 1
% 1.41/0.67 # Initial clauses in saturation : 46
% 1.41/0.67 # Processed clauses : 1747
% 1.41/0.67 # ...of these trivial : 65
% 1.41/0.67 # ...subsumed : 1053
% 1.41/0.67 # ...remaining for further processing : 629
% 1.41/0.67 # Other redundant clauses eliminated : 105
% 1.41/0.67 # Clauses deleted for lack of memory : 0
% 1.41/0.67 # Backward-subsumed : 26
% 1.41/0.67 # Backward-rewritten : 159
% 1.41/0.67 # Generated clauses : 7992
% 1.41/0.67 # ...of the previous two non-redundant : 6463
% 1.41/0.67 # ...aggressively subsumed : 0
% 1.41/0.67 # Contextual simplify-reflections : 55
% 1.41/0.67 # Paramodulations : 7870
% 1.41/0.67 # Factorizations : 6
% 1.41/0.67 # NegExts : 0
% 1.41/0.67 # Equation resolutions : 116
% 1.41/0.67 # Disequality decompositions : 0
% 1.41/0.67 # Total rewrite steps : 9819
% 1.41/0.67 # ...of those cached : 9697
% 1.41/0.67 # Propositional unsat checks : 0
% 1.41/0.67 # Propositional check models : 0
% 1.41/0.67 # Propositional check unsatisfiable : 0
% 1.41/0.67 # Propositional clauses : 0
% 1.41/0.67 # Propositional clauses after purity: 0
% 1.41/0.67 # Propositional unsat core size : 0
% 1.41/0.67 # Propositional preprocessing time : 0.000
% 1.41/0.67 # Propositional encoding time : 0.000
% 1.41/0.67 # Propositional solver time : 0.000
% 1.41/0.67 # Success case prop preproc time : 0.000
% 1.41/0.67 # Success case prop encoding time : 0.000
% 1.41/0.67 # Success case prop solver time : 0.000
% 1.41/0.67 # Current number of processed clauses : 396
% 1.41/0.67 # Positive orientable unit clauses : 94
% 1.41/0.67 # Positive unorientable unit clauses: 0
% 1.41/0.67 # Negative unit clauses : 4
% 1.41/0.67 # Non-unit-clauses : 298
% 1.41/0.67 # Current number of unprocessed clauses: 4625
% 1.41/0.67 # ...number of literals in the above : 21890
% 1.41/0.67 # Current number of archived formulas : 0
% 1.41/0.67 # Current number of archived clauses : 228
% 1.41/0.67 # Clause-clause subsumption calls (NU) : 21390
% 1.41/0.67 # Rec. Clause-clause subsumption calls : 14029
% 1.41/0.67 # Non-unit clause-clause subsumptions : 1067
% 1.41/0.67 # Unit Clause-clause subsumption calls : 170
% 1.41/0.67 # Rewrite failures with RHS unbound : 0
% 1.41/0.67 # BW rewrite match attempts : 100
% 1.41/0.67 # BW rewrite match successes : 57
% 1.41/0.67 # Condensation attempts : 0
% 1.41/0.67 # Condensation successes : 0
% 1.41/0.67 # Termbank termtop insertions : 132884
% 1.41/0.67 # Search garbage collected termcells : 684
% 1.41/0.67
% 1.41/0.67 # -------------------------------------------------
% 1.41/0.67 # User time : 0.168 s
% 1.41/0.67 # System time : 0.006 s
% 1.41/0.67 # Total time : 0.174 s
% 1.41/0.67 # Maximum resident set size: 1832 pages
% 1.41/0.67
% 1.41/0.67 # -------------------------------------------------
% 1.41/0.67 # User time : 0.810 s
% 1.41/0.67 # System time : 0.027 s
% 1.41/0.67 # Total time : 0.838 s
% 1.41/0.67 # Maximum resident set size: 1708 pages
% 1.41/0.67 % E---3.1 exiting
% 1.41/0.68 % E exiting
%------------------------------------------------------------------------------