%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM433+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 : n009.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:55:00 PM UTC 2026
% Result : Theorem 0.13s 0.50s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 56 ( 15 unt; 0 def)
% Number of atoms : 239 ( 55 equ)
% Maximal formula atoms : 29 ( 4 avg)
% Number of connectives : 293 ( 110 ~; 96 |; 71 &)
% ( 4 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 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 : 73 ( 0 sgn 39 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& ? [X1] :
( sdtasdt0(sdtasdt0(xp,xq),X1) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X1) )
& sdtasdt0(xp,xq) != sz00 )
=> ( ( sdteqdtlpzmzozddtrp0(xa,xb,xq)
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| ? [X1] :
( sdtasdt0(xq,X1) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X1) ) )
& ( sdteqdtlpzmzozddtrp0(xa,xb,xp)
| aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ? [X1] :
( sdtasdt0(xp,X1) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
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(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(mMulComm,axiom,
! [X1,X2] :
( ( aInteger0(X2)
& aInteger0(X1) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulComm) ).
fof(mMulAsso,axiom,
! [X1,X2,X3] :
( ( aInteger0(X3)
& aInteger0(X2)
& aInteger0(X1) )
=> sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(sdtasdt0(X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulAsso) ).
fof(mIntMult,axiom,
! [X1,X2] :
( ( aInteger0(X2)
& aInteger0(X1) )
=> aInteger0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntMult) ).
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(c_0_9,negated_conjecture,
~ ( ( sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& ? [X1] :
( sdtasdt0(sdtasdt0(xp,xq),X1) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X1) )
& sdtasdt0(xp,xq) != sz00 )
=> ( ( sdteqdtlpzmzozddtrp0(xa,xb,xq)
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| ? [X1] :
( sdtasdt0(xq,X1) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X1) ) )
& ( sdteqdtlpzmzozddtrp0(xa,xb,xp)
| aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ? [X1] :
( sdtasdt0(xp,X1) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X1) ) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_10,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_11,negated_conjecture,
~ ( ( sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& ? [X1] :
( sdtasdt0(sdtasdt0(xp,xq),X1) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X1) )
& sdtasdt0(xp,xq) != sz00 )
=> ( ( sdteqdtlpzmzozddtrp0(xa,xb,xq)
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| ? [X1] :
( sdtasdt0(xq,X1) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X1) ) )
& ( sdteqdtlpzmzozddtrp0(xa,xb,xp)
| aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ? [X1] :
( sdtasdt0(xp,X1) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X1) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X22,X23,X25,X26] :
( ( ~ aInteger0(X22)
| aDivisorOf0(X25,X22)
| sdtasdt0(X25,X26) != X22
| ~ aInteger0(X26)
| X25 = sz00
| ~ aInteger0(X25) )
& ( ~ aInteger0(X22)
| ~ aDivisorOf0(X23,X22)
| sdtasdt0(X23,esk2_2(X22,X23)) = X22 )
& ( ~ aInteger0(X22)
| ~ aDivisorOf0(X23,X22)
| aInteger0(esk2_2(X22,X23)) )
& ( ~ aInteger0(X22)
| ~ aDivisorOf0(X23,X22)
| X23 != sz00 )
& ( ~ aInteger0(X22)
| ~ aDivisorOf0(X23,X22)
| aInteger0(X23) ) ),
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_10])])])])])])]) ).
fof(c_0_13,negated_conjecture,
! [X6,X7] :
( ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) )
& ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
| ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) )
& ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
| sdtasdt0(xq,X7) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X7) )
& ( ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) )
& ( ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) )
& ( ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| sdtasdt0(xq,X7) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X7) )
& ( sdtasdt0(xp,X6) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X6)
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) )
& ( sdtasdt0(xp,X6) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X6)
| ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) )
& ( sdtasdt0(xp,X6) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X6)
| sdtasdt0(xq,X7) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X7) )
& sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& sdtasdt0(sdtasdt0(xp,xq),esk1_0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(esk1_0)
& sdtasdt0(xp,xq) != sz00 ),
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_11])])])])])]) ).
fof(c_0_14,hypothesis,
( xq != sz00
& aInteger0(xq)
& xp != sz00
& aInteger0(xp)
& aInteger0(xb)
& aInteger0(xa) ),
inference(fof_simplification,[status(thm)],[m__979]) ).
cnf(c_0_15,plain,
( ~ aInteger0(X2)
| ~ aDivisorOf0(X1,X2)
| aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X30,X31] :
( aInteger0(sdtpldt0(X30,X31))
| ~ aInteger0(X31)
| ~ aInteger0(X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntPlus])])]) ).
fof(c_0_18,hypothesis,
( xq != sz00
& aInteger0(xq)
& xp != sz00
& aInteger0(xp)
& aInteger0(xb)
& aInteger0(xa) ),
inference(fof_nnf,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( ~ aInteger0(sdtpldt0(xa,smndt0(xb)))
| aInteger0(sdtasdt0(xp,xq)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( ~ aInteger0(X2)
| ~ aInteger0(X1)
| aInteger0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,hypothesis,
aInteger0(xa),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_22,plain,
! [X40] :
( aInteger0(smndt0(X40))
| ~ aInteger0(X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntNeg])])]) ).
fof(c_0_23,plain,
! [X47,X48] :
( sdtasdt0(X47,X48) = sdtasdt0(X48,X47)
| ~ aInteger0(X48)
| ~ aInteger0(X47) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])])]) ).
cnf(c_0_24,negated_conjecture,
( ~ aInteger0(smndt0(xb))
| aInteger0(sdtasdt0(xp,xq)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_25,plain,
( ~ aInteger0(X1)
| aInteger0(smndt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,hypothesis,
aInteger0(xb),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_27,plain,
! [X44,X45,X46] :
( sdtasdt0(X44,sdtasdt0(X45,X46)) = sdtasdt0(sdtasdt0(X44,X45),X46)
| ~ aInteger0(X46)
| ~ aInteger0(X45)
| ~ aInteger0(X44) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])])]) ).
fof(c_0_28,plain,
! [X42,X43] :
( aInteger0(sdtasdt0(X42,X43))
| ~ aInteger0(X43)
| ~ aInteger0(X42) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntMult])])]) ).
cnf(c_0_29,negated_conjecture,
sdtasdt0(sdtasdt0(xp,xq),esk1_0) = sdtpldt0(xa,smndt0(xb)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_30,plain,
( ~ aInteger0(X2)
| ~ aInteger0(X1)
| sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,negated_conjecture,
aInteger0(sdtasdt0(xp,xq)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_32,negated_conjecture,
aInteger0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_33,plain,
( ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(sdtasdt0(X1,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,plain,
( ~ aInteger0(X2)
| ~ aInteger0(X1)
| aInteger0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,plain,
( ~ aInteger0(X3)
| sdtasdt0(X1,X2) != X3
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| aDivisorOf0(X1,X3)
| X1 = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_36,hypothesis,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_37,hypothesis,
aInteger0(xp),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_38,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]) ).
cnf(c_0_39,negated_conjecture,
sdtasdt0(esk1_0,sdtasdt0(xp,xq)) = sdtpldt0(xa,smndt0(xb)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_40,plain,
( ~ aInteger0(X1)
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(X3,sdtasdt0(X1,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_33]),c_0_34]) ).
cnf(c_0_41,plain,
( ~ aInteger0(X1)
| ~ aInteger0(X2)
| aDivisorOf0(X1,sdtasdt0(X1,X2))
| X1 = sz00 ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_35]),c_0_34]) ).
cnf(c_0_42,negated_conjecture,
sdtasdt0(xp,sdtasdt0(xq,esk1_0)) = sdtpldt0(xa,smndt0(xb)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_33]),c_0_32]),c_0_36]),c_0_37])]) ).
cnf(c_0_43,hypothesis,
xp != sz00,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_44,plain,
! [X27,X28,X29] :
( ( X29 = sz00
| ~ aInteger0(X29)
| ~ aInteger0(X28)
| ~ aInteger0(X27)
| sdteqdtlpzmzozddtrp0(X27,X28,X29)
| ~ aDivisorOf0(X29,sdtpldt0(X27,smndt0(X28))) )
& ( X29 = sz00
| ~ aInteger0(X29)
| ~ aInteger0(X28)
| ~ aInteger0(X27)
| aDivisorOf0(X29,sdtpldt0(X27,smndt0(X28)))
| ~ sdteqdtlpzmzozddtrp0(X27,X28,X29) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_38])])])]) ).
cnf(c_0_45,negated_conjecture,
sdtasdt0(xq,sdtasdt0(esk1_0,xp)) = sdtpldt0(xa,smndt0(xb)),
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_37]),c_0_32])]) ).
cnf(c_0_46,hypothesis,
xq != sz00,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_47,negated_conjecture,
( ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_48,negated_conjecture,
( ~ aInteger0(sdtasdt0(xq,esk1_0))
| aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_37])]),c_0_43]) ).
cnf(c_0_49,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_44]) ).
cnf(c_0_50,negated_conjecture,
( ~ aInteger0(sdtasdt0(esk1_0,xp))
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_45]),c_0_36])]),c_0_46]) ).
cnf(c_0_51,negated_conjecture,
( ~ aInteger0(sdtasdt0(xq,esk1_0))
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,negated_conjecture,
( ~ aInteger0(sdtasdt0(esk1_0,xp))
| 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_49,c_0_50]),c_0_26]),c_0_21]),c_0_36])]),c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( ~ aInteger0(sdtasdt0(esk1_0,xp))
| ~ aInteger0(sdtasdt0(xq,esk1_0)) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_54,negated_conjecture,
~ aInteger0(sdtasdt0(xq,esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_34]),c_0_37]),c_0_32])]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_34]),c_0_32]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM433+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n009.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 02:29:13 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 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.13/0.50 % Version: 3.5.1
% 0.13/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.50 % Starting sh5l with 300s (1) cores
% 0.13/0.50 % new_bool_3 with pid 647344 completed with status 0
% 0.13/0.50 % Result found by new_bool_3
% 0.13/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.50 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.50 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.13/0.50 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.50 % Starting SubtermCWHack with 28s (1) cores
% 0.13/0.50 % SubtermCWHack with pid 647348 completed with status 0
% 0.13/0.50 % Result found by SubtermCWHack
% 0.13/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.50 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.50 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.13/0.50 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.50 % Starting SubtermCWHack with 28s (1) cores
% 0.13/0.50 % Preprocessing time : 0.003 s
% 0.13/0.50
% 0.13/0.50 % Proof found!
% 0.13/0.50 % SZS status Theorem
% 0.13/0.50 % SZS output start CNFRefutation
% See solution above
% 0.13/0.50 % Parsed axioms : 24
% 0.13/0.50 % Removed by relevancy pruning/SinE : 3
% 0.13/0.50 % Initial clauses : 48
% 0.13/0.50 % Removed in clause preprocessing : 1
% 0.13/0.50 % Initial clauses in saturation : 47
% 0.13/0.50 % Processed clauses : 633
% 0.13/0.50 % ...of these trivial : 10
% 0.13/0.50 % ...subsumed : 443
% 0.13/0.50 % ...remaining for further processing : 180
% 0.13/0.50 % Other redundant clauses eliminated : 7
% 0.13/0.50 % Clauses deleted for lack of memory : 0
% 0.13/0.50 % Backward-subsumed : 8
% 0.13/0.50 % Backward-rewritten : 7
% 0.13/0.50 % Generated clauses : 3243
% 0.13/0.50 % ...of the previous two non-redundant : 2633
% 0.13/0.50 % ...aggressively subsumed : 0
% 0.13/0.50 % Contextual simplify-reflections : 25
% 0.13/0.50 % Paramodulations : 3236
% 0.13/0.50 % Factorizations : 0
% 0.13/0.50 % NegExts : 0
% 0.13/0.50 % Equation resolutions : 7
% 0.13/0.50 % Disequality decompositions : 0
% 0.13/0.50 % Total rewrite steps : 3681
% 0.13/0.50 % ...of those cached : 3650
% 0.13/0.50 % Propositional unsat checks : 0
% 0.13/0.50 % Propositional check models : 0
% 0.13/0.50 % Propositional check unsatisfiable : 0
% 0.13/0.50 % Propositional clauses : 0
% 0.13/0.50 % Propositional clauses after purity: 0
% 0.13/0.50 % Propositional unsat core size : 0
% 0.13/0.50 % Propositional preprocessing time : 0.000
% 0.13/0.50 % Propositional encoding time : 0.000
% 0.13/0.50 % Propositional solver time : 0.000
% 0.13/0.50 % Success case prop preproc time : 0.000
% 0.13/0.50 % Success case prop encoding time : 0.000
% 0.13/0.50 % Success case prop solver time : 0.000
% 0.13/0.50 % Current number of processed clauses : 163
% 0.13/0.50 % Positive orientable unit clauses : 38
% 0.13/0.50 % Positive unorientable unit clauses: 0
% 0.13/0.50 % Negative unit clauses : 4
% 0.13/0.50 % Non-unit-clauses : 121
% 0.13/0.50 % Current number of unprocessed clauses: 2030
% 0.13/0.50 % ...number of literals in the above : 8868
% 0.13/0.50 % Current number of archived formulas : 0
% 0.13/0.50 % Current number of archived clauses : 15
% 0.13/0.50 % Clause-clause subsumption calls (NU) : 4393
% 0.13/0.50 % Rec. Clause-clause subsumption calls : 3313
% 0.13/0.50 % Non-unit clause-clause subsumptions : 469
% 0.13/0.50 % Unit Clause-clause subsumption calls : 127
% 0.13/0.50 % Rewrite failures with RHS unbound : 0
% 0.13/0.50 % BW rewrite match attempts : 6
% 0.13/0.50 % BW rewrite match successes : 5
% 0.13/0.50 % Condensation attempts : 0
% 0.13/0.50 % Condensation successes : 0
% 0.13/0.50 % Termbank termtop insertions : 54880
% 0.13/0.50 % Search garbage collected termcells : 654
% 0.13/0.50
% 0.13/0.50 % -------------------------------------------------
% 0.13/0.50 % User time : 0.064 s
% 0.13/0.50 % System time : 0.002 s
% 0.13/0.50 % Total time : 0.066 s
% 0.13/0.50 % Maximum resident set size: 3660 pages
% 0.13/0.50
% 0.13/0.50 % -------------------------------------------------
% 0.13/0.50 % User time : 0.066 s
% 0.13/0.50 % System time : 0.009 s
% 0.13/0.50 % Total time : 0.075 s
% 0.13/0.50 % Maximum resident set size: 4864 pages
% 0.13/0.50 % E exiting
%------------------------------------------------------------------------------