%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM443+4 : 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 : 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:06 PM UTC 2026
% Result : Theorem 0.15s 5.54s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 11 unt; 0 def)
% Number of atoms : 242 ( 32 equ)
% Maximal formula atoms : 50 ( 7 avg)
% Number of connectives : 280 ( 70 ~; 70 |; 114 &)
% ( 0 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 34 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 60 ( 0 sgn 33 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( sdteqdtlpzmzozddtrp0(xc,xb,xq)
& aDivisorOf0(xq,sdtpldt0(xc,smndt0(xb)))
& ? [X1] :
( sdtasdt0(xq,X1) = sdtpldt0(xc,smndt0(xb))
& aInteger0(X1) )
& aElementOf0(xb,stldt0(szAzrzSzezqlpdtcmdtrp0(xa,xq)))
& ~ aElementOf0(xb,szAzrzSzezqlpdtcmdtrp0(xa,xq))
& ! [X1] :
( ( ( ( sdteqdtlpzmzozddtrp0(X1,xa,xq)
| aDivisorOf0(xq,sdtpldt0(X1,smndt0(xa)))
| ? [X2] :
( sdtasdt0(xq,X2) = sdtpldt0(X1,smndt0(xa))
& aInteger0(X2) ) )
& aInteger0(X1) )
=> aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
& ( aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq))
=> ( sdteqdtlpzmzozddtrp0(X1,xa,xq)
& aDivisorOf0(xq,sdtpldt0(X1,smndt0(xa)))
& ? [X2] :
( sdtasdt0(xq,X2) = sdtpldt0(X1,smndt0(xa))
& aInteger0(X2) )
& aInteger0(X1) ) ) )
& aSet0(szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
=> ( ( ! [X1] :
( ( ( ( sdteqdtlpzmzozddtrp0(X1,xa,xq)
| aDivisorOf0(xq,sdtpldt0(X1,smndt0(xa)))
| ? [X2] :
( sdtasdt0(xq,X2) = sdtpldt0(X1,smndt0(xa))
& aInteger0(X2) ) )
& aInteger0(X1) )
=> aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
& ( aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq))
=> ( sdteqdtlpzmzozddtrp0(X1,xa,xq)
& aDivisorOf0(xq,sdtpldt0(X1,smndt0(xa)))
& ? [X2] :
( sdtasdt0(xq,X2) = sdtpldt0(X1,smndt0(xa))
& aInteger0(X2) )
& aInteger0(X1) ) ) )
& aSet0(szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
=> ( aElementOf0(xc,stldt0(szAzrzSzezqlpdtcmdtrp0(xa,xq)))
| ~ aElementOf0(xc,szAzrzSzezqlpdtcmdtrp0(xa,xq)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
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/sandbox2/benchmark/theBenchmark.p',mEquModTrn) ).
fof(m__1962,hypothesis,
( xq != sz00
& aInteger0(xq)
& aInteger0(xa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1962) ).
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/sandbox2/benchmark/theBenchmark.p',mEquModSym) ).
fof(m__2010,hypothesis,
( aInteger0(xc)
& aInteger0(xb) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2010) ).
fof(c_0_5,negated_conjecture,
~ ( ( sdteqdtlpzmzozddtrp0(xc,xb,xq)
& aDivisorOf0(xq,sdtpldt0(xc,smndt0(xb)))
& ? [X1] :
( sdtasdt0(xq,X1) = sdtpldt0(xc,smndt0(xb))
& aInteger0(X1) )
& aElementOf0(xb,stldt0(szAzrzSzezqlpdtcmdtrp0(xa,xq)))
& ~ aElementOf0(xb,szAzrzSzezqlpdtcmdtrp0(xa,xq))
& ! [X1] :
( ( ( ( sdteqdtlpzmzozddtrp0(X1,xa,xq)
| aDivisorOf0(xq,sdtpldt0(X1,smndt0(xa)))
| ? [X2] :
( sdtasdt0(xq,X2) = sdtpldt0(X1,smndt0(xa))
& aInteger0(X2) ) )
& aInteger0(X1) )
=> aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
& ( aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq))
=> ( sdteqdtlpzmzozddtrp0(X1,xa,xq)
& aDivisorOf0(xq,sdtpldt0(X1,smndt0(xa)))
& ? [X2] :
( sdtasdt0(xq,X2) = sdtpldt0(X1,smndt0(xa))
& aInteger0(X2) )
& aInteger0(X1) ) ) )
& aSet0(szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
=> ( ( ! [X1] :
( ( ( ( sdteqdtlpzmzozddtrp0(X1,xa,xq)
| aDivisorOf0(xq,sdtpldt0(X1,smndt0(xa)))
| ? [X2] :
( sdtasdt0(xq,X2) = sdtpldt0(X1,smndt0(xa))
& aInteger0(X2) ) )
& aInteger0(X1) )
=> aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
& ( aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq))
=> ( sdteqdtlpzmzozddtrp0(X1,xa,xq)
& aDivisorOf0(xq,sdtpldt0(X1,smndt0(xa)))
& ? [X2] :
( sdtasdt0(xq,X2) = sdtpldt0(X1,smndt0(xa))
& aInteger0(X2) )
& aInteger0(X1) ) ) )
& aSet0(szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
=> ( aElementOf0(xc,stldt0(szAzrzSzezqlpdtcmdtrp0(xa,xq)))
| ~ aElementOf0(xc,szAzrzSzezqlpdtcmdtrp0(xa,xq)) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,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]) ).
fof(c_0_7,negated_conjecture,
~ ( ( sdteqdtlpzmzozddtrp0(xc,xb,xq)
& aDivisorOf0(xq,sdtpldt0(xc,smndt0(xb)))
& ? [X1] :
( sdtasdt0(xq,X1) = sdtpldt0(xc,smndt0(xb))
& aInteger0(X1) )
& aElementOf0(xb,stldt0(szAzrzSzezqlpdtcmdtrp0(xa,xq)))
& ~ aElementOf0(xb,szAzrzSzezqlpdtcmdtrp0(xa,xq))
& ! [X1] :
( ( ( ( sdteqdtlpzmzozddtrp0(X1,xa,xq)
| aDivisorOf0(xq,sdtpldt0(X1,smndt0(xa)))
| ? [X2] :
( sdtasdt0(xq,X2) = sdtpldt0(X1,smndt0(xa))
& aInteger0(X2) ) )
& aInteger0(X1) )
=> aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
& ( aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq))
=> ( sdteqdtlpzmzozddtrp0(X1,xa,xq)
& aDivisorOf0(xq,sdtpldt0(X1,smndt0(xa)))
& ? [X2] :
( sdtasdt0(xq,X2) = sdtpldt0(X1,smndt0(xa))
& aInteger0(X2) )
& aInteger0(X1) ) ) )
& aSet0(szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
=> ( ( ! [X1] :
( ( ( ( sdteqdtlpzmzozddtrp0(X1,xa,xq)
| aDivisorOf0(xq,sdtpldt0(X1,smndt0(xa)))
| ? [X2] :
( sdtasdt0(xq,X2) = sdtpldt0(X1,smndt0(xa))
& aInteger0(X2) ) )
& aInteger0(X1) )
=> aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
& ( aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq))
=> ( sdteqdtlpzmzozddtrp0(X1,xa,xq)
& aDivisorOf0(xq,sdtpldt0(X1,smndt0(xa)))
& ? [X2] :
( sdtasdt0(xq,X2) = sdtpldt0(X1,smndt0(xa))
& aInteger0(X2) )
& aInteger0(X1) ) ) )
& aSet0(szAzrzSzezqlpdtcmdtrp0(xa,xq)) )
=> ( aElementOf0(xc,stldt0(szAzrzSzezqlpdtcmdtrp0(xa,xq)))
| ~ aElementOf0(xc,szAzrzSzezqlpdtcmdtrp0(xa,xq)) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_8,hypothesis,
( xq != sz00
& aInteger0(xq)
& aInteger0(xa) ),
inference(fof_simplification,[status(thm)],[m__1962]) ).
fof(c_0_9,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_10,plain,
! [X49,X50,X51,X52] :
( sdteqdtlpzmzozddtrp0(X49,X52,X51)
| ~ sdteqdtlpzmzozddtrp0(X50,X52,X51)
| ~ sdteqdtlpzmzozddtrp0(X49,X50,X51)
| ~ aInteger0(X52)
| X51 = sz00
| ~ aInteger0(X51)
| ~ aInteger0(X50)
| ~ aInteger0(X49) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_11,negated_conjecture,
! [X5,X7,X8,X10,X12,X13] :
( ~ aElementOf0(xc,stldt0(szAzrzSzezqlpdtcmdtrp0(xa,xq)))
& aElementOf0(xc,szAzrzSzezqlpdtcmdtrp0(xa,xq))
& ( aElementOf0(X12,szAzrzSzezqlpdtcmdtrp0(xa,xq))
| ~ aInteger0(X12)
| ~ sdteqdtlpzmzozddtrp0(X12,xa,xq) )
& ( aElementOf0(X12,szAzrzSzezqlpdtcmdtrp0(xa,xq))
| ~ aInteger0(X12)
| ~ aDivisorOf0(xq,sdtpldt0(X12,smndt0(xa))) )
& ( aElementOf0(X12,szAzrzSzezqlpdtcmdtrp0(xa,xq))
| ~ aInteger0(X12)
| sdtasdt0(xq,X13) != sdtpldt0(X12,smndt0(xa))
| ~ aInteger0(X13) )
& ( ~ aElementOf0(X10,szAzrzSzezqlpdtcmdtrp0(xa,xq))
| sdteqdtlpzmzozddtrp0(X10,xa,xq) )
& ( ~ aElementOf0(X10,szAzrzSzezqlpdtcmdtrp0(xa,xq))
| aDivisorOf0(xq,sdtpldt0(X10,smndt0(xa))) )
& ( ~ aElementOf0(X10,szAzrzSzezqlpdtcmdtrp0(xa,xq))
| sdtasdt0(xq,esk3_1(X10)) = sdtpldt0(X10,smndt0(xa)) )
& ( ~ aElementOf0(X10,szAzrzSzezqlpdtcmdtrp0(xa,xq))
| aInteger0(esk3_1(X10)) )
& ( ~ aElementOf0(X10,szAzrzSzezqlpdtcmdtrp0(xa,xq))
| aInteger0(X10) )
& aSet0(szAzrzSzezqlpdtcmdtrp0(xa,xq))
& sdteqdtlpzmzozddtrp0(xc,xb,xq)
& aDivisorOf0(xq,sdtpldt0(xc,smndt0(xb)))
& sdtasdt0(xq,esk2_0) = sdtpldt0(xc,smndt0(xb))
& aInteger0(esk2_0)
& aElementOf0(xb,stldt0(szAzrzSzezqlpdtcmdtrp0(xa,xq)))
& ~ aElementOf0(xb,szAzrzSzezqlpdtcmdtrp0(xa,xq))
& ( aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(xa,xq))
| ~ aInteger0(X7)
| ~ sdteqdtlpzmzozddtrp0(X7,xa,xq) )
& ( aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(xa,xq))
| ~ aInteger0(X7)
| ~ aDivisorOf0(xq,sdtpldt0(X7,smndt0(xa))) )
& ( aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(xa,xq))
| ~ aInteger0(X7)
| sdtasdt0(xq,X8) != sdtpldt0(X7,smndt0(xa))
| ~ aInteger0(X8) )
& ( ~ aElementOf0(X5,szAzrzSzezqlpdtcmdtrp0(xa,xq))
| sdteqdtlpzmzozddtrp0(X5,xa,xq) )
& ( ~ aElementOf0(X5,szAzrzSzezqlpdtcmdtrp0(xa,xq))
| aDivisorOf0(xq,sdtpldt0(X5,smndt0(xa))) )
& ( ~ aElementOf0(X5,szAzrzSzezqlpdtcmdtrp0(xa,xq))
| sdtasdt0(xq,esk1_1(X5)) = sdtpldt0(X5,smndt0(xa)) )
& ( ~ aElementOf0(X5,szAzrzSzezqlpdtcmdtrp0(xa,xq))
| aInteger0(esk1_1(X5)) )
& ( ~ aElementOf0(X5,szAzrzSzezqlpdtcmdtrp0(xa,xq))
| aInteger0(X5) )
& aSet0(szAzrzSzezqlpdtcmdtrp0(xa,xq)) ),
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_7])])])])])])]) ).
fof(c_0_12,hypothesis,
( xq != sz00
& aInteger0(xq)
& aInteger0(xa) ),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X46,X47,X48] :
( sdteqdtlpzmzozddtrp0(X47,X46,X48)
| ~ sdteqdtlpzmzozddtrp0(X46,X47,X48)
| X48 = sz00
| ~ aInteger0(X48)
| ~ aInteger0(X47)
| ~ aInteger0(X46) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
cnf(c_0_14,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_10]) ).
cnf(c_0_15,negated_conjecture,
sdteqdtlpzmzozddtrp0(xc,xb,xq),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,hypothesis,
aInteger0(xb),
inference(split_conjunct,[status(thm)],[m__2010]) ).
cnf(c_0_17,hypothesis,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,hypothesis,
aInteger0(xc),
inference(split_conjunct,[status(thm)],[m__2010]) ).
cnf(c_0_19,hypothesis,
xq != sz00,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( ~ sdteqdtlpzmzozddtrp0(X1,X2,X3)
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| sdteqdtlpzmzozddtrp0(X2,X1,X3)
| X3 = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
( ~ aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq))
| sdteqdtlpzmzozddtrp0(X1,xa,xq) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,hypothesis,
aInteger0(xa),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,negated_conjecture,
( ~ aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq))
| aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_24,negated_conjecture,
( ~ aInteger0(X1)
| ~ sdteqdtlpzmzozddtrp0(X1,xc,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_14,c_0_15]),c_0_16]),c_0_17]),c_0_18])]),c_0_19]) ).
cnf(c_0_25,negated_conjecture,
( ~ aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq))
| sdteqdtlpzmzozddtrp0(xa,X1,xq) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_17]),c_0_22])]),c_0_19]),c_0_23]) ).
cnf(c_0_26,negated_conjecture,
aElementOf0(xc,szAzrzSzezqlpdtcmdtrp0(xa,xq)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_27,negated_conjecture,
sdteqdtlpzmzozddtrp0(xa,xb,xq),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_22]),c_0_26])]) ).
cnf(c_0_28,negated_conjecture,
( ~ aInteger0(X1)
| ~ sdteqdtlpzmzozddtrp0(X1,xa,xq)
| aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(xa,xq)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_29,negated_conjecture,
sdteqdtlpzmzozddtrp0(xb,xa,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_20,c_0_27]),c_0_17]),c_0_16]),c_0_22])]),c_0_19]) ).
cnf(c_0_30,negated_conjecture,
~ aElementOf0(xb,szAzrzSzezqlpdtcmdtrp0(xa,xq)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_16])]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM443+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/5.38 % Computer : n001.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Mon Sep 21 02:35:50 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/5.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.45 Running first-order theorem proving
% 0.15/5.45 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.15/5.54 % Version: 3.5.1
% 0.15/5.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/5.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/5.54 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.54 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.54 % Starting sh5l with 300s (1) cores
% 0.15/5.54 % new_bool_3 with pid 2003079 completed with status 0
% 0.15/5.54 % Result found by new_bool_3
% 0.15/5.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/5.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/5.54 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.54 % Search class: FGHSF-FSLM31-SFFFFFNN
% 0.15/5.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.54 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.54 % SubtermCWHack with pid 2003083 completed with status 0
% 0.15/5.54 % Result found by SubtermCWHack
% 0.15/5.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/5.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/5.54 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.54 % Search class: FGHSF-FSLM31-SFFFFFNN
% 0.15/5.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.54 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.54 % Preprocessing time : 0.002 s
% 0.15/5.54
% 0.15/5.54 % Proof found!
% 0.15/5.54 % SZS status Theorem
% 0.15/5.54 % SZS output start CNFRefutation
% See solution above
% 0.15/5.54 % Parsed axioms : 43
% 0.15/5.54 % Removed by relevancy pruning/SinE : 4
% 0.15/5.54 % Initial clauses : 126
% 0.15/5.54 % Removed in clause preprocessing : 4
% 0.15/5.54 % Initial clauses in saturation : 122
% 0.15/5.54 % Processed clauses : 534
% 0.15/5.54 % ...of these trivial : 6
% 0.15/5.54 % ...subsumed : 322
% 0.15/5.54 % ...remaining for further processing : 206
% 0.15/5.54 % Other redundant clauses eliminated : 27
% 0.15/5.54 % Clauses deleted for lack of memory : 0
% 0.15/5.54 % Backward-subsumed : 2
% 0.15/5.54 % Backward-rewritten : 6
% 0.15/5.54 % Generated clauses : 1374
% 0.15/5.54 % ...of the previous two non-redundant : 1125
% 0.15/5.54 % ...aggressively subsumed : 0
% 0.15/5.54 % Contextual simplify-reflections : 8
% 0.15/5.54 % Paramodulations : 1347
% 0.15/5.54 % Factorizations : 0
% 0.15/5.54 % NegExts : 0
% 0.15/5.54 % Equation resolutions : 27
% 0.15/5.54 % Disequality decompositions : 0
% 0.15/5.54 % Total rewrite steps : 1207
% 0.15/5.54 % ...of those cached : 1186
% 0.15/5.54 % Propositional unsat checks : 0
% 0.15/5.54 % Propositional check models : 0
% 0.15/5.54 % Propositional check unsatisfiable : 0
% 0.15/5.54 % Propositional clauses : 0
% 0.15/5.54 % Propositional clauses after purity: 0
% 0.15/5.54 % Propositional unsat core size : 0
% 0.15/5.54 % Propositional preprocessing time : 0.000
% 0.15/5.54 % Propositional encoding time : 0.000
% 0.15/5.54 % Propositional solver time : 0.000
% 0.15/5.54 % Success case prop preproc time : 0.000
% 0.15/5.54 % Success case prop encoding time : 0.000
% 0.15/5.54 % Success case prop solver time : 0.000
% 0.15/5.54 % Current number of processed clauses : 173
% 0.15/5.54 % Positive orientable unit clauses : 25
% 0.15/5.54 % Positive unorientable unit clauses: 0
% 0.15/5.54 % Negative unit clauses : 3
% 0.15/5.54 % Non-unit-clauses : 145
% 0.15/5.54 % Current number of unprocessed clauses: 689
% 0.15/5.54 % ...number of literals in the above : 3042
% 0.15/5.54 % Current number of archived formulas : 0
% 0.15/5.54 % Current number of archived clauses : 8
% 0.15/5.54 % Clause-clause subsumption calls (NU) : 4870
% 0.15/5.54 % Rec. Clause-clause subsumption calls : 3273
% 0.15/5.54 % Non-unit clause-clause subsumptions : 331
% 0.15/5.54 % Unit Clause-clause subsumption calls : 37
% 0.15/5.54 % Rewrite failures with RHS unbound : 0
% 0.15/5.54 % BW rewrite match attempts : 6
% 0.15/5.54 % BW rewrite match successes : 6
% 0.15/5.54 % Condensation attempts : 0
% 0.15/5.54 % Condensation successes : 0
% 0.15/5.54 % Termbank termtop insertions : 31315
% 0.15/5.54 % Search garbage collected termcells : 2319
% 0.15/5.54
% 0.15/5.54 % -------------------------------------------------
% 0.15/5.54 % User time : 0.045 s
% 0.15/5.54 % System time : 0.003 s
% 0.15/5.54 % Total time : 0.048 s
% 0.15/5.54 % Maximum resident set size: 3952 pages
% 0.15/5.54
% 0.15/5.54 % -------------------------------------------------
% 0.15/5.54 % User time : 0.049 s
% 0.15/5.54 % System time : 0.010 s
% 0.15/5.54 % Total time : 0.059 s
% 0.15/5.54 % Maximum resident set size: 4864 pages
% 0.15/5.54 % E exiting
%------------------------------------------------------------------------------