%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM433+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:04 PM UTC 2026
% Result : Theorem 0.40s 0.48s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 39 ( 9 unt; 0 def)
% Number of atoms : 196 ( 57 equ)
% Maximal formula atoms : 29 ( 5 avg)
% Number of connectives : 261 ( 104 ~; 84 |; 63 &)
% ( 2 <=>; 8 =>; 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 : 64 ( 0 sgn 24 !; 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/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__979,hypothesis,
( xq != sz00
& aInteger0(xq)
& xp != sz00
& aInteger0(xp)
& aInteger0(xb)
& aInteger0(xa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__979) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aInteger0(X2)
& aInteger0(X1) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',mMulAsso) ).
fof(mIntMult,axiom,
! [X1,X2] :
( ( aInteger0(X2)
& aInteger0(X1) )
=> aInteger0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntMult) ).
fof(mDivisor,axiom,
! [X1] :
( aInteger0(X1)
=> ! [X2] :
( aDivisorOf0(X2,X1)
<=> ( ? [X3] :
( sdtasdt0(X2,X3) = X1
& aInteger0(X3) )
& X2 != sz00
& aInteger0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDivisor) ).
fof(c_0_6,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_7,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_6]) ).
fof(c_0_8,hypothesis,
( xq != sz00
& aInteger0(xq)
& xp != sz00
& aInteger0(xp)
& aInteger0(xb)
& aInteger0(xa) ),
inference(fof_simplification,[status(thm)],[m__979]) ).
fof(c_0_9,negated_conjecture,
! [X49,X50] :
( ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) )
& ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
| ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) )
& ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
| sdtasdt0(xq,X50) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X50) )
& ( ~ 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,X50) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X50) )
& ( sdtasdt0(xp,X49) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X49)
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) )
& ( sdtasdt0(xp,X49) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X49)
| ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) )
& ( sdtasdt0(xp,X49) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X49)
| sdtasdt0(xq,X50) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X50) )
& sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& sdtasdt0(sdtasdt0(xp,xq),esk2_0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(esk2_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_7])])])])])]) ).
fof(c_0_10,plain,
! [X21,X22] :
( sdtasdt0(X21,X22) = sdtasdt0(X22,X21)
| ~ aInteger0(X22)
| ~ aInteger0(X21) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])])]) ).
fof(c_0_11,hypothesis,
( xq != sz00
& aInteger0(xq)
& xp != sz00
& aInteger0(xp)
& aInteger0(xb)
& aInteger0(xa) ),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( sdtasdt0(xp,X2) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X2)
| sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( ~ aInteger0(X2)
| ~ aInteger0(X1)
| sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,hypothesis,
aInteger0(xp),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X18,X19,X20] :
( sdtasdt0(X18,sdtasdt0(X19,X20)) = sdtasdt0(sdtasdt0(X18,X19),X20)
| ~ aInteger0(X20)
| ~ aInteger0(X19)
| ~ aInteger0(X18) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])])]) ).
fof(c_0_16,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])])]) ).
cnf(c_0_17,negated_conjecture,
( ~ aInteger0(X2)
| ~ aInteger0(X1)
| sdtasdt0(xq,X2) != sdtpldt0(xa,smndt0(xb))
| sdtasdt0(X1,xp) != sdtpldt0(xa,smndt0(xb)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_18,plain,
( ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(sdtasdt0(X1,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( ~ aInteger0(X2)
| ~ aInteger0(X1)
| aInteger0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( ~ aInteger0(X1)
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| sdtasdt0(xq,X3) != sdtpldt0(xa,smndt0(xb))
| sdtasdt0(X1,sdtasdt0(X2,xp)) != sdtpldt0(xa,smndt0(xb)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_14])]),c_0_19]) ).
cnf(c_0_21,negated_conjecture,
( ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X3)
| ~ aInteger0(sdtasdt0(X1,xp))
| sdtasdt0(xq,X3) != sdtpldt0(xa,smndt0(xb))
| sdtasdt0(sdtasdt0(X1,xp),X2) != sdtpldt0(xa,smndt0(xb)) ),
inference(spm,[status(thm)],[c_0_20,c_0_13]) ).
cnf(c_0_22,negated_conjecture,
( ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X3)
| sdtasdt0(xq,X3) != sdtpldt0(xa,smndt0(xb))
| sdtasdt0(sdtasdt0(X1,xp),X2) != sdtpldt0(xa,smndt0(xb)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_19]),c_0_14])]) ).
fof(c_0_23,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]) ).
cnf(c_0_24,negated_conjecture,
sdtasdt0(sdtasdt0(xp,xq),esk2_0) = sdtpldt0(xa,smndt0(xb)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25,negated_conjecture,
aInteger0(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,negated_conjecture,
( ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X3)
| sdtasdt0(xq,X3) != sdtpldt0(xa,smndt0(xb))
| sdtasdt0(sdtasdt0(xp,X1),X2) != sdtpldt0(xa,smndt0(xb)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_13]),c_0_14])]) ).
cnf(c_0_27,hypothesis,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_28,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_23])])])])])])]) ).
cnf(c_0_29,negated_conjecture,
( ~ aInteger0(sdtasdt0(xp,xq))
| aInteger0(sdtpldt0(xa,smndt0(xb))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_24]),c_0_25])]) ).
cnf(c_0_30,negated_conjecture,
( ~ aInteger0(X1)
| sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xb)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_24]),c_0_27]),c_0_25])]) ).
cnf(c_0_31,plain,
( ~ aInteger0(X2)
| ~ aDivisorOf0(X1,X2)
| aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,negated_conjecture,
aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_33,negated_conjecture,
aInteger0(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_19]),c_0_27]),c_0_14])]) ).
cnf(c_0_34,negated_conjecture,
( ~ aInteger0(X1)
| sdtasdt0(X1,xq) != sdtpldt0(xa,smndt0(xb)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_13]),c_0_27])]) ).
cnf(c_0_35,negated_conjecture,
aInteger0(sdtasdt0(xp,xq)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_36,negated_conjecture,
( ~ aInteger0(X1)
| ~ aInteger0(X2)
| sdtasdt0(X1,sdtasdt0(X2,xq)) != sdtpldt0(xa,smndt0(xb)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_18]),c_0_27])]),c_0_19]) ).
cnf(c_0_37,negated_conjecture,
sdtasdt0(esk2_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_24,c_0_13]),c_0_35]),c_0_25])]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_14]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM433+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.36 % Computer : n015.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 02:32:23 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.40/0.48 % Version: 3.5.1
% 0.40/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.40/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.40/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.40/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.40/0.48 % Starting sh5l with 300s (1) cores
% 0.40/0.48 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 363366 completed with status 0
% 0.40/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.40/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.40/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.40/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.40/0.48 % No SInE strategy applied
% 0.40/0.48 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.40/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.40/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.40/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.40/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with 136s (1) cores
% 0.40/0.48 % Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.40/0.48 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.40/0.48 % H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with pid 363377 completed with status 0
% 0.40/0.48 % Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S
% 0.40/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.40/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.40/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.40/0.48 % No SInE strategy applied
% 0.40/0.48 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.40/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.40/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.40/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.40/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with 136s (1) cores
% 0.40/0.48 % Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.40/0.48 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.40/0.48 % Preprocessing time : 0.002 s
% 0.40/0.48 % Presaturation interreduction done
% 0.40/0.48
% 0.40/0.48 % Proof found!
% 0.40/0.48 % SZS status Theorem
% 0.40/0.48 % SZS output start CNFRefutation
% See solution above
% 0.40/0.48 % Parsed axioms : 24
% 0.40/0.48 % Removed by relevancy pruning/SinE : 0
% 0.40/0.48 % Initial clauses : 53
% 0.40/0.48 % Removed in clause preprocessing : 1
% 0.40/0.48 % Initial clauses in saturation : 52
% 0.40/0.48 % Processed clauses : 503
% 0.40/0.48 % ...of these trivial : 29
% 0.40/0.48 % ...subsumed : 151
% 0.40/0.48 % ...remaining for further processing : 323
% 0.40/0.48 % Other redundant clauses eliminated : 4
% 0.40/0.48 % Clauses deleted for lack of memory : 0
% 0.40/0.48 % Backward-subsumed : 33
% 0.40/0.48 % Backward-rewritten : 3
% 0.40/0.48 % Generated clauses : 1982
% 0.40/0.48 % ...of the previous two non-redundant : 1716
% 0.40/0.48 % ...aggressively subsumed : 0
% 0.40/0.48 % Contextual simplify-reflections : 11
% 0.40/0.48 % Paramodulations : 1971
% 0.40/0.48 % Factorizations : 0
% 0.40/0.48 % NegExts : 0
% 0.40/0.48 % Equation resolutions : 11
% 0.40/0.48 % Disequality decompositions : 0
% 0.40/0.48 % Total rewrite steps : 1332
% 0.40/0.48 % ...of those cached : 1251
% 0.40/0.48 % Propositional unsat checks : 0
% 0.40/0.48 % Propositional check models : 0
% 0.40/0.48 % Propositional check unsatisfiable : 0
% 0.40/0.48 % Propositional clauses : 0
% 0.40/0.48 % Propositional clauses after purity: 0
% 0.40/0.48 % Propositional unsat core size : 0
% 0.40/0.48 % Propositional preprocessing time : 0.000
% 0.40/0.48 % Propositional encoding time : 0.000
% 0.40/0.48 % Propositional solver time : 0.000
% 0.40/0.48 % Success case prop preproc time : 0.000
% 0.40/0.48 % Success case prop encoding time : 0.000
% 0.40/0.48 % Success case prop solver time : 0.000
% 0.40/0.48 % Current number of processed clauses : 235
% 0.40/0.48 % Positive orientable unit clauses : 86
% 0.40/0.48 % Positive unorientable unit clauses: 0
% 0.40/0.48 % Negative unit clauses : 4
% 0.40/0.48 % Non-unit-clauses : 145
% 0.40/0.48 % Current number of unprocessed clauses: 1296
% 0.40/0.48 % ...number of literals in the above : 3677
% 0.40/0.48 % Current number of archived formulas : 0
% 0.40/0.48 % Current number of archived clauses : 88
% 0.40/0.48 % Clause-clause subsumption calls (NU) : 10198
% 0.40/0.48 % Rec. Clause-clause subsumption calls : 5005
% 0.40/0.48 % Non-unit clause-clause subsumptions : 193
% 0.40/0.48 % Unit Clause-clause subsumption calls : 860
% 0.40/0.48 % Rewrite failures with RHS unbound : 0
% 0.40/0.48 % BW rewrite match attempts : 31
% 0.40/0.48 % BW rewrite match successes : 3
% 0.40/0.48 % Condensation attempts : 0
% 0.40/0.48 % Condensation successes : 0
% 0.40/0.48 % Termbank termtop insertions : 31591
% 0.40/0.48 % Search garbage collected termcells : 663
% 0.40/0.48
% 0.40/0.48 % -------------------------------------------------
% 0.40/0.48 % User time : 0.045 s
% 0.40/0.48 % System time : 0.004 s
% 0.40/0.48 % Total time : 0.049 s
% 0.40/0.48 % Maximum resident set size: 3660 pages
% 0.40/0.48
% 0.40/0.48 % -------------------------------------------------
% 0.40/0.48 % User time : 0.196 s
% 0.40/0.48 % System time : 0.023 s
% 0.40/0.48 % Total time : 0.219 s
% 0.40/0.48 % Maximum resident set size: 4864 pages
% 0.40/0.48 % E exiting
%------------------------------------------------------------------------------