%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM436+1 : 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 : n001.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:05 PM UTC 2026
% Result : Theorem 0.24s 5.63s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 63 ( 16 unt; 0 def)
% Number of atoms : 244 ( 47 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 294 ( 113 ~; 102 |; 58 &)
% ( 4 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 87 ( 0 sgn 54 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDivisor,axiom,
! [X1] :
( aInteger0(X1)
=> ! [X2] :
( aDivisorOf0(X2,X1)
<=> ( ? [X3] :
( sdtasdt0(X2,X3) = X1
& aInteger0(X3) )
& X2 != sz00
& aInteger0(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDivisor) ).
fof(m__979,hypothesis,
( xq != sz00
& aInteger0(xq)
& xp != sz00
& aInteger0(xp)
& aInteger0(xb)
& aInteger0(xa) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__979) ).
fof(mEquMod,axiom,
! [X1,X2,X3] :
( ( X3 != sz00
& aInteger0(X3)
& aInteger0(X2)
& aInteger0(X1) )
=> ( sdteqdtlpzmzozddtrp0(X1,X2,X3)
<=> aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEquMod) ).
fof(m__1071,hypothesis,
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm))
& sdtasdt0(xp,sdtasdt0(xq,xm)) = sdtpldt0(xa,smndt0(xb)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1071) ).
fof(mIntPlus,axiom,
! [X1,X2] :
( ( aInteger0(X2)
& aInteger0(X1) )
=> aInteger0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntPlus) ).
fof(mIntNeg,axiom,
! [X1] :
( aInteger0(X1)
=> aInteger0(smndt0(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntNeg) ).
fof(mEquModTrn,axiom,
! [X1,X2,X3,X4] :
( ( aInteger0(X4)
& X3 != sz00
& aInteger0(X3)
& aInteger0(X2)
& aInteger0(X1) )
=> ( ( sdteqdtlpzmzozddtrp0(X2,X4,X3)
& sdteqdtlpzmzozddtrp0(X1,X2,X3) )
=> sdteqdtlpzmzozddtrp0(X1,X4,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEquModTrn) ).
fof(mEquModSym,axiom,
! [X1,X2,X3] :
( ( X3 != sz00
& aInteger0(X3)
& aInteger0(X2)
& aInteger0(X1) )
=> ( sdteqdtlpzmzozddtrp0(X1,X2,X3)
=> sdteqdtlpzmzozddtrp0(X2,X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEquModSym) ).
fof(mIntMult,axiom,
! [X1,X2] :
( ( aInteger0(X2)
& aInteger0(X1) )
=> aInteger0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntMult) ).
fof(mEquModRef,axiom,
! [X1,X2] :
( ( X2 != sz00
& aInteger0(X2)
& aInteger0(X1) )
=> sdteqdtlpzmzozddtrp0(X1,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEquModRef) ).
fof(m__1032,hypothesis,
( sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb))
& aInteger0(xm) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1032) ).
fof(m__,conjecture,
( sdteqdtlpzmzozddtrp0(xa,xb,xq)
& sdteqdtlpzmzozddtrp0(xa,xb,xp) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(c_0_12,plain,
! [X1] :
( aInteger0(X1)
=> ! [X2] :
( aDivisorOf0(X2,X1)
<=> ( ? [X3] :
( sdtasdt0(X2,X3) = X1
& aInteger0(X3) )
& X2 != sz00
& aInteger0(X2) ) ) ),
inference(fof_simplification,[status(thm)],[mDivisor]) ).
fof(c_0_13,hypothesis,
( xq != sz00
& aInteger0(xq)
& xp != sz00
& aInteger0(xp)
& aInteger0(xb)
& aInteger0(xa) ),
inference(fof_simplification,[status(thm)],[m__979]) ).
fof(c_0_14,plain,
! [X1,X2,X3] :
( ( X3 != sz00
& aInteger0(X3)
& aInteger0(X2)
& aInteger0(X1) )
=> ( sdteqdtlpzmzozddtrp0(X1,X2,X3)
<=> aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2))) ) ),
inference(fof_simplification,[status(thm)],[mEquMod]) ).
fof(c_0_15,plain,
! [X31,X32,X34,X35] :
( ( ~ aInteger0(X31)
| aDivisorOf0(X34,X31)
| sdtasdt0(X34,X35) != X31
| ~ aInteger0(X35)
| X34 = sz00
| ~ aInteger0(X34) )
& ( ~ aInteger0(X31)
| ~ aDivisorOf0(X32,X31)
| sdtasdt0(X32,esk1_2(X31,X32)) = X31 )
& ( ~ aInteger0(X31)
| ~ aDivisorOf0(X32,X31)
| aInteger0(esk1_2(X31,X32)) )
& ( ~ aInteger0(X31)
| ~ aDivisorOf0(X32,X31)
| X32 != sz00 )
& ( ~ aInteger0(X31)
| ~ aDivisorOf0(X32,X31)
| aInteger0(X32) ) ),
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_12])])])])])])]) ).
cnf(c_0_16,hypothesis,
sdtasdt0(xp,sdtasdt0(xq,xm)) = sdtpldt0(xa,smndt0(xb)),
inference(split_conjunct,[status(thm)],[m__1071]) ).
cnf(c_0_17,hypothesis,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(split_conjunct,[status(thm)],[m__1071]) ).
fof(c_0_18,hypothesis,
( xq != sz00
& aInteger0(xq)
& xp != sz00
& aInteger0(xp)
& aInteger0(xb)
& aInteger0(xa) ),
inference(fof_nnf,[status(thm)],[c_0_13]) ).
fof(c_0_19,plain,
! [X36,X37,X38] :
( ( X38 = sz00
| ~ aInteger0(X38)
| ~ aInteger0(X37)
| ~ aInteger0(X36)
| sdteqdtlpzmzozddtrp0(X36,X37,X38)
| ~ aDivisorOf0(X38,sdtpldt0(X36,smndt0(X37))) )
& ( X38 = sz00
| ~ aInteger0(X38)
| ~ aInteger0(X37)
| ~ aInteger0(X36)
| aDivisorOf0(X38,sdtpldt0(X36,smndt0(X37)))
| ~ sdteqdtlpzmzozddtrp0(X36,X37,X38) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
cnf(c_0_20,plain,
( ~ aInteger0(X3)
| sdtasdt0(X1,X2) != X3
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| aDivisorOf0(X1,X3)
| X1 = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,hypothesis,
sdtasdt0(xq,sdtasdt0(xp,xm)) = sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,hypothesis,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,hypothesis,
xq != sz00,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( ~ aInteger0(X1)
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aDivisorOf0(X1,sdtpldt0(X2,smndt0(X3)))
| X1 = sz00
| sdteqdtlpzmzozddtrp0(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,hypothesis,
( ~ aInteger0(X1)
| ~ aInteger0(sdtasdt0(xp,xm))
| sdtasdt0(xp,sdtasdt0(xq,xm)) != X1
| aDivisorOf0(xq,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),c_0_23]) ).
fof(c_0_26,plain,
! [X7,X8] :
( aInteger0(sdtpldt0(X7,X8))
| ~ aInteger0(X8)
| ~ aInteger0(X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntPlus])])]) ).
fof(c_0_27,plain,
! [X6] :
( aInteger0(smndt0(X6))
| ~ aInteger0(X6) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntNeg])])]) ).
fof(c_0_28,plain,
! [X1,X2,X3,X4] :
( ( aInteger0(X4)
& X3 != sz00
& aInteger0(X3)
& aInteger0(X2)
& aInteger0(X1) )
=> ( ( sdteqdtlpzmzozddtrp0(X2,X4,X3)
& sdteqdtlpzmzozddtrp0(X1,X2,X3) )
=> sdteqdtlpzmzozddtrp0(X1,X4,X3) ) ),
inference(fof_simplification,[status(thm)],[mEquModTrn]) ).
cnf(c_0_29,hypothesis,
( ~ aInteger0(X1)
| ~ aInteger0(X2)
| ~ aInteger0(sdtpldt0(X1,smndt0(X2)))
| ~ aInteger0(sdtasdt0(xp,xm))
| sdtpldt0(X1,smndt0(X2)) != sdtasdt0(xp,sdtasdt0(xq,xm))
| sdteqdtlpzmzozddtrp0(X1,X2,xq) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_22])]),c_0_23]) ).
cnf(c_0_30,plain,
( ~ aInteger0(X2)
| ~ aInteger0(X1)
| aInteger0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
( ~ aInteger0(X1)
| aInteger0(smndt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_32,plain,
! [X1,X2,X3] :
( ( X3 != sz00
& aInteger0(X3)
& aInteger0(X2)
& aInteger0(X1) )
=> ( sdteqdtlpzmzozddtrp0(X1,X2,X3)
=> sdteqdtlpzmzozddtrp0(X2,X1,X3) ) ),
inference(fof_simplification,[status(thm)],[mEquModSym]) ).
fof(c_0_33,plain,
! [X44,X45,X46,X47] :
( sdteqdtlpzmzozddtrp0(X44,X47,X46)
| ~ sdteqdtlpzmzozddtrp0(X45,X47,X46)
| ~ sdteqdtlpzmzozddtrp0(X44,X45,X46)
| ~ aInteger0(X47)
| X46 = sz00
| ~ aInteger0(X46)
| ~ aInteger0(X45)
| ~ aInteger0(X44) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])]) ).
cnf(c_0_34,hypothesis,
( ~ aInteger0(X1)
| ~ aInteger0(X2)
| ~ aInteger0(sdtasdt0(xp,xm))
| sdtpldt0(X1,smndt0(X2)) != sdtasdt0(xp,sdtasdt0(xq,xm))
| sdteqdtlpzmzozddtrp0(X1,X2,xq) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_35,hypothesis,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(rw,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_36,hypothesis,
aInteger0(xb),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_37,hypothesis,
aInteger0(xa),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_38,plain,
! [X41,X42,X43] :
( sdteqdtlpzmzozddtrp0(X42,X41,X43)
| ~ sdteqdtlpzmzozddtrp0(X41,X42,X43)
| X43 = sz00
| ~ aInteger0(X43)
| ~ aInteger0(X42)
| ~ aInteger0(X41) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])]) ).
cnf(c_0_39,plain,
( ~ sdteqdtlpzmzozddtrp0(X2,X4,X3)
| ~ sdteqdtlpzmzozddtrp0(X1,X2,X3)
| ~ aInteger0(X4)
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| sdteqdtlpzmzozddtrp0(X1,X4,X3)
| X3 = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,hypothesis,
( ~ aInteger0(sdtasdt0(xp,xm))
| sdteqdtlpzmzozddtrp0(xa,xb,xq) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37])]) ).
cnf(c_0_41,plain,
( ~ sdteqdtlpzmzozddtrp0(X1,X2,X3)
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| sdteqdtlpzmzozddtrp0(X2,X1,X3)
| X3 = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_42,hypothesis,
( ~ aInteger0(X1)
| ~ aInteger0(sdtasdt0(xp,xm))
| ~ sdteqdtlpzmzozddtrp0(X1,xa,xq)
| sdteqdtlpzmzozddtrp0(X1,xb,xq) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_36]),c_0_22]),c_0_37])]),c_0_23]) ).
fof(c_0_43,plain,
! [X9,X10] :
( aInteger0(sdtasdt0(X9,X10))
| ~ aInteger0(X10)
| ~ aInteger0(X9) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntMult])])]) ).
fof(c_0_44,plain,
! [X1,X2] :
( ( X2 != sz00
& aInteger0(X2)
& aInteger0(X1) )
=> sdteqdtlpzmzozddtrp0(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[mEquModRef]) ).
cnf(c_0_45,hypothesis,
( ~ aInteger0(X1)
| ~ aInteger0(sdtasdt0(xp,xm))
| ~ sdteqdtlpzmzozddtrp0(X1,xa,xq)
| sdteqdtlpzmzozddtrp0(xb,X1,xq) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_22]),c_0_36])]),c_0_23]) ).
cnf(c_0_46,plain,
( ~ aInteger0(X2)
| ~ aInteger0(X1)
| aInteger0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_47,hypothesis,
aInteger0(xm),
inference(split_conjunct,[status(thm)],[m__1032]) ).
cnf(c_0_48,hypothesis,
aInteger0(xp),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_49,plain,
! [X39,X40] :
( sdteqdtlpzmzozddtrp0(X39,X39,X40)
| X40 = sz00
| ~ aInteger0(X40)
| ~ aInteger0(X39) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_44])])]) ).
fof(c_0_50,negated_conjecture,
~ ( sdteqdtlpzmzozddtrp0(xa,xb,xq)
& sdteqdtlpzmzozddtrp0(xa,xb,xp) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_51,hypothesis,
( ~ aInteger0(X1)
| ~ sdteqdtlpzmzozddtrp0(X1,xa,xq)
| sdteqdtlpzmzozddtrp0(xb,X1,xq) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48])]) ).
cnf(c_0_52,plain,
( ~ aInteger0(X2)
| ~ aInteger0(X1)
| sdteqdtlpzmzozddtrp0(X1,X1,X2)
| X2 = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
fof(c_0_53,negated_conjecture,
( ~ sdteqdtlpzmzozddtrp0(xa,xb,xq)
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_50])]) ).
cnf(c_0_54,hypothesis,
sdteqdtlpzmzozddtrp0(xb,xa,xq),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_37]),c_0_22])]),c_0_23]) ).
cnf(c_0_55,negated_conjecture,
( ~ sdteqdtlpzmzozddtrp0(xa,xb,xq)
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_56,hypothesis,
sdteqdtlpzmzozddtrp0(xa,xb,xq),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_54]),c_0_22]),c_0_37]),c_0_36])]),c_0_23]) ).
cnf(c_0_57,hypothesis,
( ~ aInteger0(X1)
| ~ aDivisorOf0(X1,sdtasdt0(xp,sdtasdt0(xq,xm)))
| sdteqdtlpzmzozddtrp0(xa,xb,X1)
| X1 = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_35]),c_0_36]),c_0_37])]) ).
cnf(c_0_58,plain,
( ~ aInteger0(X1)
| ~ aInteger0(X2)
| aDivisorOf0(X1,sdtasdt0(X1,X2))
| X1 = sz00 ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_20]),c_0_46]) ).
cnf(c_0_59,hypothesis,
xp != sz00,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_60,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xb,xp),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56])]) ).
cnf(c_0_61,hypothesis,
~ aInteger0(sdtasdt0(xq,xm)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_48])]),c_0_59]),c_0_60]) ).
cnf(c_0_62,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_46]),c_0_47]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM436+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/5.47 % Computer : n001.cluster.edu
% 0.20/5.47 % Model : x86_64 x86_64
% 0.20/5.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/5.47 % Memory : 8046.5625MB
% 0.20/5.47 % OS : Linux 6.8.0-71-generic
% 0.20/5.47 % CPULimit : 300
% 0.20/5.47 % WCLimit : 300
% 0.20/5.47 % DateTime : Mon Sep 21 02:34:49 UTC 2026
% 0.20/5.47 % CPUTime :
% 0.20/5.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/5.54 Running first-order theorem proving
% 0.24/5.54 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
% 0.24/5.63 % Version: 3.5.1
% 0.24/5.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/5.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/5.63 % Starting new_bool_3 with 300s (1) cores
% 0.24/5.63 % Starting new_bool_1 with 300s (1) cores
% 0.24/5.63 % Starting sh5l with 300s (1) cores
% 0.24/5.63 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2001459 completed with status 0
% 0.24/5.63 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.24/5.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/5.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/5.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/5.63 % No SInE strategy applied
% 0.24/5.63 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.24/5.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/5.63 % Starting SubtermCWHack with 136s (1) cores
% 0.24/5.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/5.63 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with 136s (1) cores
% 0.24/5.63 % Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.24/5.63 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.24/5.63 % G-E--_208_C18_F1_AE_CS_SP_PS_S3S with pid 2001468 completed with status 0
% 0.24/5.63 % Result found by G-E--_208_C18_F1_AE_CS_SP_PS_S3S
% 0.24/5.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/5.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/5.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/5.63 % No SInE strategy applied
% 0.24/5.63 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.24/5.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/5.63 % Starting SubtermCWHack with 136s (1) cores
% 0.24/5.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/5.63 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with 136s (1) cores
% 0.24/5.63 % Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.24/5.63 % Preprocessing time : 0.003 s
% 0.24/5.63 % Presaturation interreduction done
% 0.24/5.63
% 0.24/5.63 % Proof found!
% 0.24/5.63 % SZS status Theorem
% 0.24/5.63 % SZS output start CNFRefutation
% See solution above
% 0.24/5.63 % Parsed axioms : 27
% 0.24/5.63 % Removed by relevancy pruning/SinE : 0
% 0.24/5.63 % Initial clauses : 45
% 0.24/5.63 % Removed in clause preprocessing : 1
% 0.24/5.63 % Initial clauses in saturation : 44
% 0.24/5.63 % Processed clauses : 437
% 0.24/5.63 % ...of these trivial : 8
% 0.24/5.63 % ...subsumed : 186
% 0.24/5.63 % ...remaining for further processing : 243
% 0.24/5.63 % Other redundant clauses eliminated : 8
% 0.24/5.63 % Clauses deleted for lack of memory : 0
% 0.24/5.63 % Backward-subsumed : 29
% 0.24/5.63 % Backward-rewritten : 3
% 0.24/5.63 % Generated clauses : 908
% 0.24/5.63 % ...of the previous two non-redundant : 711
% 0.24/5.63 % ...aggressively subsumed : 0
% 0.24/5.63 % Contextual simplify-reflections : 16
% 0.24/5.63 % Paramodulations : 892
% 0.24/5.63 % Factorizations : 0
% 0.24/5.63 % NegExts : 0
% 0.24/5.63 % Equation resolutions : 16
% 0.24/5.63 % Disequality decompositions : 0
% 0.24/5.63 % Total rewrite steps : 1129
% 0.24/5.63 % ...of those cached : 1105
% 0.24/5.63 % Propositional unsat checks : 0
% 0.24/5.63 % Propositional check models : 0
% 0.24/5.63 % Propositional check unsatisfiable : 0
% 0.24/5.63 % Propositional clauses : 0
% 0.24/5.63 % Propositional clauses after purity: 0
% 0.24/5.63 % Propositional unsat core size : 0
% 0.24/5.63 % Propositional preprocessing time : 0.000
% 0.24/5.63 % Propositional encoding time : 0.000
% 0.24/5.63 % Propositional solver time : 0.000
% 0.24/5.63 % Success case prop preproc time : 0.000
% 0.24/5.63 % Success case prop encoding time : 0.000
% 0.24/5.63 % Success case prop solver time : 0.000
% 0.24/5.63 % Current number of processed clauses : 167
% 0.24/5.63 % Positive orientable unit clauses : 26
% 0.24/5.63 % Positive unorientable unit clauses: 0
% 0.24/5.63 % Negative unit clauses : 4
% 0.24/5.63 % Non-unit-clauses : 137
% 0.24/5.63 % Current number of unprocessed clauses: 353
% 0.24/5.63 % ...number of literals in the above : 1497
% 0.24/5.63 % Current number of archived formulas : 0
% 0.24/5.63 % Current number of archived clauses : 76
% 0.24/5.63 % Clause-clause subsumption calls (NU) : 3340
% 0.24/5.63 % Rec. Clause-clause subsumption calls : 1621
% 0.24/5.63 % Non-unit clause-clause subsumptions : 194
% 0.24/5.63 % Unit Clause-clause subsumption calls : 115
% 0.24/5.63 % Rewrite failures with RHS unbound : 0
% 0.24/5.63 % BW rewrite match attempts : 17
% 0.24/5.63 % BW rewrite match successes : 9
% 0.24/5.63 % Condensation attempts : 0
% 0.24/5.63 % Condensation successes : 0
% 0.24/5.63 % Termbank termtop insertions : 18508
% 0.24/5.63 % Search garbage collected termcells : 522
% 0.24/5.63
% 0.24/5.63 % -------------------------------------------------
% 0.24/5.63 % User time : 0.049 s
% 0.24/5.63 % System time : 0.010 s
% 0.24/5.63 % Total time : 0.059 s
% 0.24/5.63 % Maximum resident set size: 3660 pages
% 0.24/5.63
% 0.24/5.63 % -------------------------------------------------
% 0.24/5.63 % User time : 0.189 s
% 0.24/5.63 % System time : 0.023 s
% 0.24/5.63 % Total time : 0.212 s
% 0.24/5.63 % Maximum resident set size: 4608 pages
% 0.24/5.63 % E exiting
%------------------------------------------------------------------------------