TSTP Solution File: NUM456+6 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM456+6 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n008.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 : 600s
% DateTime : Mon Jul 18 09:32:37 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 8 unt; 0 def)
% Number of atoms : 286 ( 56 equ)
% Maximal formula atoms : 102 ( 14 avg)
% Number of connectives : 377 ( 111 ~; 129 |; 122 &)
% ( 5 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 40 ( 9 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 21 ( 21 usr; 9 con; 0-3 aty)
% Number of variables : 51 ( 9 sgn 35 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2079,hypothesis,
( aSet0(sbsmnsldt0(xS))
& ! [X1] :
( aElementOf0(X1,sbsmnsldt0(xS))
<=> ( aInteger0(X1)
& ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) ) ) )
& aSet0(stldt0(sbsmnsldt0(xS)))
& ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( aInteger0(X1)
& ~ aElementOf0(X1,sbsmnsldt0(xS)) ) )
& ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( X1 = sz10
| X1 = smndt0(sz10) ) )
& stldt0(sbsmnsldt0(xS)) = cS2076 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2079) ).
fof(m__2046,hypothesis,
( aSet0(xS)
& ! [X1] :
( ( aElementOf0(X1,xS)
=> ? [X2] :
( aInteger0(X2)
& X2 != sz00
& isPrime0(X2)
& aSet0(szAzrzSzezqlpdtcmdtrp0(sz00,X2))
& ! [X3] :
( ( aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz00,X2))
=> ( aInteger0(X3)
& ? [X4] :
( aInteger0(X4)
& sdtasdt0(X2,X4) = sdtpldt0(X3,smndt0(sz00)) )
& aDivisorOf0(X2,sdtpldt0(X3,smndt0(sz00)))
& sdteqdtlpzmzozddtrp0(X3,sz00,X2) ) )
& ( ( aInteger0(X3)
& ( ? [X4] :
( aInteger0(X4)
& sdtasdt0(X2,X4) = sdtpldt0(X3,smndt0(sz00)) )
| aDivisorOf0(X2,sdtpldt0(X3,smndt0(sz00)))
| sdteqdtlpzmzozddtrp0(X3,sz00,X2) ) )
=> aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz00,X2)) ) )
& szAzrzSzezqlpdtcmdtrp0(sz00,X2) = X1 ) )
& ( ? [X2] :
( aInteger0(X2)
& X2 != sz00
& isPrime0(X2)
& ( ( aSet0(szAzrzSzezqlpdtcmdtrp0(sz00,X2))
& ! [X3] :
( ( aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz00,X2))
=> ( aInteger0(X3)
& ? [X4] :
( aInteger0(X4)
& sdtasdt0(X2,X4) = sdtpldt0(X3,smndt0(sz00)) )
& aDivisorOf0(X2,sdtpldt0(X3,smndt0(sz00)))
& sdteqdtlpzmzozddtrp0(X3,sz00,X2) ) )
& ( ( aInteger0(X3)
& ( ? [X4] :
( aInteger0(X4)
& sdtasdt0(X2,X4) = sdtpldt0(X3,smndt0(sz00)) )
| aDivisorOf0(X2,sdtpldt0(X3,smndt0(sz00)))
| sdteqdtlpzmzozddtrp0(X3,sz00,X2) ) )
=> aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz00,X2)) ) ) )
=> szAzrzSzezqlpdtcmdtrp0(sz00,X2) = X1 ) )
=> aElementOf0(X1,xS) ) )
& xS = cS2043 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2046) ).
fof(m__2171,hypothesis,
( aInteger0(xp)
& xp != sz00
& aSet0(szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& ! [X1] :
( ( aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
=> ( aInteger0(X1)
& ? [X2] :
( aInteger0(X2)
& sdtasdt0(xp,X2) = sdtpldt0(X1,smndt0(sz10)) )
& aDivisorOf0(xp,sdtpldt0(X1,smndt0(sz10)))
& sdteqdtlpzmzozddtrp0(X1,sz10,xp) ) )
& ( ( aInteger0(X1)
& ( ? [X2] :
( aInteger0(X2)
& sdtasdt0(xp,X2) = sdtpldt0(X1,smndt0(sz10)) )
| aDivisorOf0(xp,sdtpldt0(X1,smndt0(sz10)))
| sdteqdtlpzmzozddtrp0(X1,sz10,xp) ) )
=> aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ) )
& aSet0(sbsmnsldt0(xS))
& ! [X1] :
( aElementOf0(X1,sbsmnsldt0(xS))
<=> ( aInteger0(X1)
& ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) ) ) )
& ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( aInteger0(X1)
& ~ aElementOf0(X1,sbsmnsldt0(xS)) ) )
& ! [X1] :
( aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
=> aElementOf0(X1,stldt0(sbsmnsldt0(xS))) )
& aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(sz10,xp),stldt0(sbsmnsldt0(xS))) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2171) ).
fof(m__2203,hypothesis,
? [X1] :
( aInteger0(X1)
& ? [X2] :
( aInteger0(X2)
& sdtasdt0(xp,X2) = sdtpldt0(X1,smndt0(sz10)) )
& aDivisorOf0(xp,sdtpldt0(X1,smndt0(sz10)))
& sdteqdtlpzmzozddtrp0(X1,sz10,xp)
& aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& ~ ( X1 = sz10
| X1 = smndt0(sz10)
| aElementOf0(X1,cS2200) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2203) ).
fof(c_0_4,hypothesis,
! [X3,X3,X5,X6,X6,X7,X7] :
( aSet0(sbsmnsldt0(xS))
& ( aInteger0(X3)
| ~ aElementOf0(X3,sbsmnsldt0(xS)) )
& ( aElementOf0(esk4_1(X3),xS)
| ~ aElementOf0(X3,sbsmnsldt0(xS)) )
& ( aElementOf0(X3,esk4_1(X3))
| ~ aElementOf0(X3,sbsmnsldt0(xS)) )
& ( ~ aInteger0(X3)
| ~ aElementOf0(X5,xS)
| ~ aElementOf0(X3,X5)
| aElementOf0(X3,sbsmnsldt0(xS)) )
& aSet0(stldt0(sbsmnsldt0(xS)))
& ( aInteger0(X6)
| ~ aElementOf0(X6,stldt0(sbsmnsldt0(xS))) )
& ( ~ aElementOf0(X6,sbsmnsldt0(xS))
| ~ aElementOf0(X6,stldt0(sbsmnsldt0(xS))) )
& ( ~ aInteger0(X6)
| aElementOf0(X6,sbsmnsldt0(xS))
| aElementOf0(X6,stldt0(sbsmnsldt0(xS))) )
& ( ~ aElementOf0(X7,stldt0(sbsmnsldt0(xS)))
| X7 = sz10
| X7 = smndt0(sz10) )
& ( X7 != sz10
| aElementOf0(X7,stldt0(sbsmnsldt0(xS))) )
& ( X7 != smndt0(sz10)
| aElementOf0(X7,stldt0(sbsmnsldt0(xS))) )
& stldt0(sbsmnsldt0(xS)) = cS2076 ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[m__2079])])])])])])])]) ).
fof(c_0_5,hypothesis,
! [X5,X7,X7,X9,X5,X10,X11,X11,X13] :
( aSet0(xS)
& ( aInteger0(esk1_1(X5))
| ~ aElementOf0(X5,xS) )
& ( esk1_1(X5) != sz00
| ~ aElementOf0(X5,xS) )
& ( isPrime0(esk1_1(X5))
| ~ aElementOf0(X5,xS) )
& ( aSet0(szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( aInteger0(X7)
| ~ aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( aInteger0(esk2_2(X5,X7))
| ~ aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( sdtasdt0(esk1_1(X5),esk2_2(X5,X7)) = sdtpldt0(X7,smndt0(sz00))
| ~ aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( aDivisorOf0(esk1_1(X5),sdtpldt0(X7,smndt0(sz00)))
| ~ aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( sdteqdtlpzmzozddtrp0(X7,sz00,esk1_1(X5))
| ~ aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( ~ aInteger0(X9)
| sdtasdt0(esk1_1(X5),X9) != sdtpldt0(X7,smndt0(sz00))
| ~ aInteger0(X7)
| aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( ~ aDivisorOf0(esk1_1(X5),sdtpldt0(X7,smndt0(sz00)))
| ~ aInteger0(X7)
| aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( ~ sdteqdtlpzmzozddtrp0(X7,sz00,esk1_1(X5))
| ~ aInteger0(X7)
| aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)) = X5
| ~ aElementOf0(X5,xS) )
& ( aSet0(szAzrzSzezqlpdtcmdtrp0(sz00,X10))
| ~ aInteger0(X10)
| X10 = sz00
| ~ isPrime0(X10)
| aElementOf0(X5,xS) )
& ( aInteger0(X11)
| ~ aElementOf0(X11,szAzrzSzezqlpdtcmdtrp0(sz00,X10))
| ~ aInteger0(X10)
| X10 = sz00
| ~ isPrime0(X10)
| aElementOf0(X5,xS) )
& ( aInteger0(esk3_3(X5,X10,X11))
| ~ aElementOf0(X11,szAzrzSzezqlpdtcmdtrp0(sz00,X10))
| ~ aInteger0(X10)
| X10 = sz00
| ~ isPrime0(X10)
| aElementOf0(X5,xS) )
& ( sdtasdt0(X10,esk3_3(X5,X10,X11)) = sdtpldt0(X11,smndt0(sz00))
| ~ aElementOf0(X11,szAzrzSzezqlpdtcmdtrp0(sz00,X10))
| ~ aInteger0(X10)
| X10 = sz00
| ~ isPrime0(X10)
| aElementOf0(X5,xS) )
& ( aDivisorOf0(X10,sdtpldt0(X11,smndt0(sz00)))
| ~ aElementOf0(X11,szAzrzSzezqlpdtcmdtrp0(sz00,X10))
| ~ aInteger0(X10)
| X10 = sz00
| ~ isPrime0(X10)
| aElementOf0(X5,xS) )
& ( sdteqdtlpzmzozddtrp0(X11,sz00,X10)
| ~ aElementOf0(X11,szAzrzSzezqlpdtcmdtrp0(sz00,X10))
| ~ aInteger0(X10)
| X10 = sz00
| ~ isPrime0(X10)
| aElementOf0(X5,xS) )
& ( ~ aInteger0(X13)
| sdtasdt0(X10,X13) != sdtpldt0(X11,smndt0(sz00))
| ~ aInteger0(X11)
| aElementOf0(X11,szAzrzSzezqlpdtcmdtrp0(sz00,X10))
| ~ aInteger0(X10)
| X10 = sz00
| ~ isPrime0(X10)
| aElementOf0(X5,xS) )
& ( ~ aDivisorOf0(X10,sdtpldt0(X11,smndt0(sz00)))
| ~ aInteger0(X11)
| aElementOf0(X11,szAzrzSzezqlpdtcmdtrp0(sz00,X10))
| ~ aInteger0(X10)
| X10 = sz00
| ~ isPrime0(X10)
| aElementOf0(X5,xS) )
& ( ~ sdteqdtlpzmzozddtrp0(X11,sz00,X10)
| ~ aInteger0(X11)
| aElementOf0(X11,szAzrzSzezqlpdtcmdtrp0(sz00,X10))
| ~ aInteger0(X10)
| X10 = sz00
| ~ isPrime0(X10)
| aElementOf0(X5,xS) )
& ( szAzrzSzezqlpdtcmdtrp0(sz00,X10) != X5
| ~ aInteger0(X10)
| X10 = sz00
| ~ isPrime0(X10)
| aElementOf0(X5,xS) )
& xS = cS2043 ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__2046])])])])])])]) ).
fof(c_0_6,hypothesis,
! [X3,X3,X5,X6,X6,X8,X9,X9,X10] :
( aInteger0(xp)
& xp != sz00
& aSet0(szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& ( aInteger0(X3)
| ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( aInteger0(esk11_1(X3))
| ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( sdtasdt0(xp,esk11_1(X3)) = sdtpldt0(X3,smndt0(sz10))
| ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( aDivisorOf0(xp,sdtpldt0(X3,smndt0(sz10)))
| ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( sdteqdtlpzmzozddtrp0(X3,sz10,xp)
| ~ aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( ~ aInteger0(X5)
| sdtasdt0(xp,X5) != sdtpldt0(X3,smndt0(sz10))
| ~ aInteger0(X3)
| aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( ~ aDivisorOf0(xp,sdtpldt0(X3,smndt0(sz10)))
| ~ aInteger0(X3)
| aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& ( ~ sdteqdtlpzmzozddtrp0(X3,sz10,xp)
| ~ aInteger0(X3)
| aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) )
& aSet0(sbsmnsldt0(xS))
& ( aInteger0(X6)
| ~ aElementOf0(X6,sbsmnsldt0(xS)) )
& ( aElementOf0(esk12_1(X6),xS)
| ~ aElementOf0(X6,sbsmnsldt0(xS)) )
& ( aElementOf0(X6,esk12_1(X6))
| ~ aElementOf0(X6,sbsmnsldt0(xS)) )
& ( ~ aInteger0(X6)
| ~ aElementOf0(X8,xS)
| ~ aElementOf0(X6,X8)
| aElementOf0(X6,sbsmnsldt0(xS)) )
& ( aInteger0(X9)
| ~ aElementOf0(X9,stldt0(sbsmnsldt0(xS))) )
& ( ~ aElementOf0(X9,sbsmnsldt0(xS))
| ~ aElementOf0(X9,stldt0(sbsmnsldt0(xS))) )
& ( ~ aInteger0(X9)
| aElementOf0(X9,sbsmnsldt0(xS))
| aElementOf0(X9,stldt0(sbsmnsldt0(xS))) )
& ( ~ aElementOf0(X10,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
| aElementOf0(X10,stldt0(sbsmnsldt0(xS))) )
& aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(sz10,xp),stldt0(sbsmnsldt0(xS))) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[m__2171])])])])])])])]) ).
cnf(c_0_7,hypothesis,
stldt0(sbsmnsldt0(xS)) = cS2076,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,hypothesis,
xS = cS2043,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,hypothesis,
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
| ~ aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
stldt0(sbsmnsldt0(cS2043)) = cS2076,
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
fof(c_0_11,hypothesis,
( aInteger0(esk13_0)
& aInteger0(esk14_0)
& sdtasdt0(xp,esk14_0) = sdtpldt0(esk13_0,smndt0(sz10))
& aDivisorOf0(xp,sdtpldt0(esk13_0,smndt0(sz10)))
& sdteqdtlpzmzozddtrp0(esk13_0,sz10,xp)
& aElementOf0(esk13_0,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& esk13_0 != sz10
& esk13_0 != smndt0(sz10)
& ~ aElementOf0(esk13_0,cS2200) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__2203])])])])]) ).
cnf(c_0_12,hypothesis,
( X1 = smndt0(sz10)
| X1 = sz10
| ~ aElementOf0(X1,stldt0(sbsmnsldt0(xS))) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,hypothesis,
( aElementOf0(X1,cS2076)
| ~ aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_8]),c_0_10]) ).
cnf(c_0_14,hypothesis,
aElementOf0(esk13_0,szAzrzSzezqlpdtcmdtrp0(sz10,xp)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,hypothesis,
( X1 = smndt0(sz10)
| X1 = sz10
| ~ aElementOf0(X1,cS2076) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_8]),c_0_10]) ).
cnf(c_0_16,hypothesis,
aElementOf0(esk13_0,cS2076),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,hypothesis,
esk13_0 != smndt0(sz10),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,hypothesis,
esk13_0 != sz10,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM456+6 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n008.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 : 600
% 0.12/0.34 % DateTime : Thu Jul 7 14:40:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.026 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 20
% 0.24/1.42 # Proof object clause steps : 12
% 0.24/1.42 # Proof object formula steps : 8
% 0.24/1.42 # Proof object conjectures : 0
% 0.24/1.42 # Proof object clause conjectures : 0
% 0.24/1.42 # Proof object formula conjectures : 0
% 0.24/1.42 # Proof object initial clauses used : 7
% 0.24/1.42 # Proof object initial formulas used : 4
% 0.24/1.42 # Proof object generating inferences : 2
% 0.24/1.42 # Proof object simplifying inferences : 7
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 48
% 0.24/1.42 # Removed by relevancy pruning/SinE : 4
% 0.24/1.42 # Initial clauses : 206
% 0.24/1.42 # Removed in clause preprocessing : 6
% 0.24/1.42 # Initial clauses in saturation : 200
% 0.24/1.42 # Processed clauses : 202
% 0.24/1.42 # ...of these trivial : 3
% 0.24/1.42 # ...subsumed : 16
% 0.24/1.42 # ...remaining for further processing : 183
% 0.24/1.42 # Other redundant clauses eliminated : 7
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 0
% 0.24/1.42 # Generated clauses : 666
% 0.24/1.42 # ...of the previous two non-trivial : 599
% 0.24/1.42 # Contextual simplify-reflections : 0
% 0.24/1.42 # Paramodulations : 652
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 14
% 0.24/1.42 # Current number of processed clauses : 183
% 0.24/1.42 # Positive orientable unit clauses : 20
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 4
% 0.24/1.42 # Non-unit-clauses : 159
% 0.24/1.42 # Current number of unprocessed clauses: 597
% 0.24/1.42 # ...number of literals in the above : 3361
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 0
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 7902
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 1929
% 0.24/1.42 # Non-unit clause-clause subsumptions : 15
% 0.24/1.42 # Unit Clause-clause subsumption calls : 6
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 0
% 0.24/1.42 # BW rewrite match successes : 0
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 26708
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.051 s
% 0.24/1.42 # System time : 0.002 s
% 0.24/1.42 # Total time : 0.053 s
% 0.24/1.42 # Maximum resident set size: 4496 pages
%------------------------------------------------------------------------------